A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problems

Stefan Helber () and Florian Sahling

Diskussionspapiere der Wirtschaftswissenschaftlichen Fakultät der Universität Hannover from Universität Hannover, Wirtschaftswissenschaftliche Fakultät

Abstract: 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.

Keywords: multi-level lot sizing; MLCLSP; lead times; Fix-and-Optimize heuristic. (search for similar items in EconPapers)
JEL-codes: C61 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-cmp
Date: 2008-03
View list of references View citations in EconPapers

Downloads: (external link)
http://www.wiwi.uni-hannover.de/Forschung/Diskussionspapiere/dp-393.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:han:dpaper:dp-393

Access Statistics for this paper

More papers in Diskussionspapiere der Wirtschaftswissenschaftlichen Fakultät der Universität Hannover from Universität Hannover, Wirtschaftswissenschaftliche Fakultät
Contact information at EDIRC.
Series data maintained by Dietrich, Karl ().