Solving Multi-Level Capacitated Lot Sizing Problems via a Fix-and-Optimize Approach

Florian Sahling ()
Additional contact information
Florian Sahling: Leibniz Universität Hannover

A chapter in Operations Research Proceedings 2010, 2011, pp 641-646 from Springer

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

Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-20009-0_101

Ordering information: This item can be ordered from
http://www.springer.com/9783642200090

DOI: 10.1007/978-3-642-20009-0_101

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().