Abstract
We present a solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) and its extensions. The objective is to determine a cost minimizing production plan for discrete products on multiple resources. The time-varying demand is assumed to be given for each product in each period and has to be completely fulfilled. The production is located on capacity constrained resources for the different production stages. In an iterative fashion, our Fix-and-Optimize approach solves a series of mixed-integer programs. In each of these programs all real-valued variables are treated, but only a small and iteration-specific subset of binary setup variables is optimized. All remaining binary variables are fixed. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Billington PJ, McClain JO, Thomas LJ (1983) Mathematical programming approaches to capacity-constrained MRP systems: Review, formulation and problem reduction. Management Science 39: 1126–1141
Buschkühl L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems – a classification and review of solution approaches. Operations Research Spectrum 32: 231–261
Florian M, Lenstra JK, Rinnooy Kan AHG (1980) Deterministic production planning: Algorithms and complexity. Management Science 26: 669–679
Helber S, Sahling F (2010) A fix-and-optimize approach for the multi-level capacitated lot sizing problem. International Journal of Production Economics 123: 247–256
Maes J, McClain JO, van Wassenhove LN (1991) Multilevel capacitated lotsizing complexity and LP-based heuristics. European Journal of Operational Research 53: 131–148
Sahling F (2010) Mehrstufige Losgrößenplanung bei Kapazitätsrestriktionen. Gabler, Wiesbaden
Sahling F, Buschkühl L, Helber S, Tempelmeier H (2009) Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic. Computers & Operations Research 36: 2546–2553
Stadtler H (2003) Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Operations Research 51: 487–502
Stadtler H, Sürie C (2000) Description of MLCLSP test instances. Tech. rep., Technische Universität Darmstadt
Sürie C, Stadtler H (2003) The capacitated lot-sizing problem with linked lot sizes. Management Science 49: 1039–1054
Tempelmeier H, Derstroff M (1996) A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Science 42: 738–757
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sahling, F. (2011). Solving Multi-Level Capacitated Lot Sizing Problems via a Fix-and-Optimize Approach. In: Hu, B., Morasch, K., Pickl, S., Siegle, M. (eds) Operations Research Proceedings 2010. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20009-0_101
Download citation
DOI: https://doi.org/10.1007/978-3-642-20009-0_101
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20008-3
Online ISBN: 978-3-642-20009-0
eBook Packages: Business and EconomicsBusiness and Management (R0)