Arbeitspapier
A fix-and-optimize approach for the multi-level capacitated lot sizing problem
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.
- Language
-
Englisch
- Bibliographic citation
-
Series: Diskussionsbeitrag ; No. 393
- Classification
-
Wirtschaft
- Subject
-
Produktionsplanung
Losgröße
Ganzzahlige Optimierung
Mehrstufige Produktion
Theorie
- Event
-
Geistige Schöpfung
- (who)
-
Helber, Stefan
Sahling, Florian
- Event
-
Veröffentlichung
- (who)
-
Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät
- (where)
-
Hannover
- (when)
-
2008
- Handle
- Last update
-
10.03.2025, 11:42 AM CET
Data provider
This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.
Object type
- Arbeitspapier
Associated
- Helber, Stefan
- Sahling, Florian
- Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät
Time of origin
- 2008
Other Objects (12)
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
Multi-level lot sizing: A literature survey
Optimal multi-level lot sizing and scheduling with dedicated machines
Multi-level, single-machine lot sizing and scheduling: With initial inventory
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
A cellular automaton based heuristic for multi-level lot sizing and scheduling
Automated generation of heuristic methods for the multi-level capacitated lot-sizing problem
Polynomial Time Algorithms for Some Multi-Level Lot-Sizing Problems with Production Capacities
Demand shuffle - a novel method for multi-level proportional lot sizing and scheduling
The capacitated lot sizing problem with linked lot sizes
Complementary, competitive methods for multi-level lot sizing and scheduling: Tabu search and randomized regrets
Proportional lot sizing and scheduling: Some extensions
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
Multi-level lot sizing: A literature survey
Optimal multi-level lot sizing and scheduling with dedicated machines
Multi-level, single-machine lot sizing and scheduling: With initial inventory
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
A cellular automaton based heuristic for multi-level lot sizing and scheduling
Automated generation of heuristic methods for the multi-level capacitated lot-sizing problem
Polynomial Time Algorithms for Some Multi-Level Lot-Sizing Problems with Production Capacities
Demand shuffle - a novel method for multi-level proportional lot sizing and scheduling
The capacitated lot sizing problem with linked lot sizes
Complementary, competitive methods for multi-level lot sizing and scheduling: Tabu search and randomized regrets
Proportional lot sizing and scheduling: Some extensions
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
Multi-level lot sizing: A literature survey
Optimal multi-level lot sizing and scheduling with dedicated machines
Multi-level, single-machine lot sizing and scheduling: With initial inventory
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
A cellular automaton based heuristic for multi-level lot sizing and scheduling
Automated generation of heuristic methods for the multi-level capacitated lot-sizing problem
Polynomial Time Algorithms for Some Multi-Level Lot-Sizing Problems with Production Capacities
Demand shuffle - a novel method for multi-level proportional lot sizing and scheduling
The capacitated lot sizing problem with linked lot sizes
Complementary, competitive methods for multi-level lot sizing and scheduling: Tabu search and randomized regrets