Please use this identifier to cite or link to this item:
Helber, Stefan
Sahling, Florian
Year of Publication: 
Series/Report no.: 
Discussion papers // School of Economics and Management of the Hanover Leibniz University 393
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.
Document Type: 
Working Paper

Files in This Item:
169.83 kB

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.