A fix-and-optimize approach for the multi-level capacitated lot sizing problem
This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized over all real-valued variables, but only a small subset of binary setup variables. The remaining binary setup variables are tentatively fixed to values determined in previous iterations. The resulting algorithm is transparent, flexible, accurate and relatively fast. Its solution quality outperforms those of the approaches by Tempelmeier/Derstroff and by Stadtler.
Year of publication: |
2010
|
---|---|
Authors: | Helber, Stefan ; Sahling, Florian |
Published in: |
International Journal of Production Economics. - Elsevier, ISSN 0925-5273. - Vol. 123.2010, 2, p. 247-256
|
Publisher: |
Elsevier |
Keywords: | Lot sizing MLCLSP Lead times MIP Fix-and-optimize Decomposition |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
A fix-and-optimize approach for the multi-level capacitated lot sizing problem
Helber, Stefan, (2008)
-
Sahling, Florian, (2008)
-
Dynamic capacitated lot sizing with random demand and dynamic safety stocks
Helber, Stefan, (2011)
- More ...