Capacitated Dynamic Lot Sizing:
Solution of the CLSP with the ABC heuristic
The dynamic capacitated lot sizing problem (CLSP)
is solved with the "ABC-Heuristic"
of Maes und Van Wassenhove.
||Demand of product k in
||Setup cost for product
||Inventory cost for product
||Unit processing time for
||Capazity of the resource
in period t
After all data have been entering, the heuristic is started.
The complete solution process is documented as follows:
- Tempelmeier (2005)