Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

capacitated single level lotsizing algorithm

2 views
Skip to first unread message

GJ

unread,
Apr 20, 2002, 12:00:59 PM4/20/02
to
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

Lutz Tautenhahn

unread,
Apr 21, 2002, 7:04:16 AM4/21/02
to
There is a "Dynamic Programming Algorithm for Single-Item Capacitated
Economic Lot Sizing with Start-up Costs, Piecewise Linear Production Costs
and Piecewise Linear Holding Costs" (sourcecode available in C++) on my
webpage at
www.tu-chemnitz.de/~luta/plt/lgrthm/lotsize.html
which probably could be adapted to your problem.
Regards,
Lutz Tautenhahn.

"GJ" <gertja...@12move.nl> schrieb im Newsbeitrag
news:61c0cf2e.02042...@posting.google.com...

0 new messages