I did some research on the capacitated single level lotsizing problem
(more specific the one without backlogging, linear holding cost and a
fixed charge setupcost). And I looked on the net for papers related to
this. As you all might know this is a quite complex problem. There are
algorithms which can solve this problem optimally in quasi-polynomial
time O(d*n^2) (1 second on average for a problem with 48 buckets).
However I'm looking for a very fast algorithm which solves this
problem, but of course then with near-optimal results. Anyone
references for this?
Best regards,
GJ