A fix-and-optimize approach for the multi-level capacitated lot sizing problem

Stefan Helber () and Florian Sahling

International Journal of Production Economics, 2010, vol. 123, issue 2, 247-256

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: Lot; sizing; MLCLSP; Lead; times; MIP; Fix-and-optimize; Decomposition (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (60)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(09)00310-7
Full text for ScienceDirect subscribers only

Related works:
Working Paper: A Fix-and-Optimize Approach for the Multi-Level Capacitated Lot Sizing Problems (2008)
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: https://EconPapers.repec.org/RePEc:eee:proeco:v:123:y:2010:i:2:p:247-256

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().