Arbeitspapier
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
This paper presents a new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last product produced in a period are determined by the model. We solve a model which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs. Our algorithm solves a series of mixed-integer linear programs in an iterative so-called Fix-and-Optimize approach. In each instance of these mixed-integer linear programs a large number of binary setup variables is fixed whereas only a small subset of these variables is optimized, together with the complete set of the inventory and lot size variables. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.
- Sprache
-
Englisch
- Erschienen in
-
Series: Diskussionsbeitrag ; No. 400
- Klassifikation
-
Wirtschaft
- Thema
-
Produktionsplanung
Losgröße
Scheduling-Verfahren
Produktionskapazität
Heuristisches Verfahren
Theorie
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Sahling, Florian
Buschkühl, Lisbeth
Tempelmeier, Horst
Helber, Stefan
- Ereignis
-
Veröffentlichung
- (wer)
-
Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät
- (wo)
-
Hannover
- (wann)
-
2008
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:44 MEZ
Datenpartner
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Sahling, Florian
- Buschkühl, Lisbeth
- Tempelmeier, Horst
- Helber, Stefan
- Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät
Entstanden
- 2008
Ähnliche Objekte (12)
An LP-rounding heuristic to solve a multi-period facility relocation problem
Multi-period disassembly planning
A cellular automaton based heuristic for multi-level lot sizing and scheduling
A fix-and-optimize approach for the multi-level capacitated lot sizing problem
Multi-period credit portfolio selection
Multi-period credit portfolio selection
Automated generation of heuristic methods for the multi-level capacitated lot-sizing problem
Dynamic Multi-Period Routing With Two Classes
A multi-period and multi-product optimizer for cooperative supply chains
A neuristic for multi-product, multi-period, single-level batch production
Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions
Multi-period investment strategies under cumulative prospect theory
An LP-rounding heuristic to solve a multi-period facility relocation problem
Multi-period disassembly planning
A cellular automaton based heuristic for multi-level lot sizing and scheduling
A fix-and-optimize approach for the multi-level capacitated lot sizing problem
Multi-period credit portfolio selection
Multi-period credit portfolio selection
Automated generation of heuristic methods for the multi-level capacitated lot-sizing problem
Dynamic Multi-Period Routing With Two Classes
A multi-period and multi-product optimizer for cooperative supply chains
A neuristic for multi-product, multi-period, single-level batch production
Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions
Multi-period investment strategies under cumulative prospect theory
An LP-rounding heuristic to solve a multi-period facility relocation problem
Multi-period disassembly planning
A cellular automaton based heuristic for multi-level lot sizing and scheduling
A fix-and-optimize approach for the multi-level capacitated lot sizing problem
Multi-period credit portfolio selection
Multi-period credit portfolio selection
Automated generation of heuristic methods for the multi-level capacitated lot-sizing problem
Dynamic Multi-Period Routing With Two Classes
A multi-period and multi-product optimizer for cooperative supply chains
A neuristic for multi-product, multi-period, single-level batch production
Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions