Arbeitspapier
An O(Tˆ3) algorithm for the capacitated lot sizing problem with minimum order quantities
This paper explores a single-item capacitated lot sizing problem with minimum order quantity, which plays the role of minor set-up cost. We work out the necessary and suffcient solvability conditions and apply the general dynamic programming technique to develop an O(T³) exact algorithm that is based on the concept of minimal sub-problems. An investigation of the properties of the optimal solution structure allows us to construct explicit solutions to the obtained sub-problems and prove their optimality. In this way, we reduce the complexity of the algorithm considerably and confirm its efficiency in an extensive computational study.
- Sprache
-
Englisch
- Erschienen in
-
Series: Discussion Paper ; No. 284
- Klassifikation
-
Wirtschaft
- Thema
-
production planning
capacitated lot sizing problem
single item
minimum order quantities
capacity constraints
dynamic programming
Produktionsplanung
Kapazitätsplanung
Auftragsfertigung
Losgröße
Dynamische Optimierung
Theorie
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Okhrin, Irena
Richter, Knut
- Ereignis
-
Veröffentlichung
- (wer)
-
European University Viadrina, Department of Business Administration and Economics
- (wo)
-
Frankfurt (Oder)
- (wann)
-
2010
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:42 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Okhrin, Irena
- Richter, Knut
- European University Viadrina, Department of Business Administration and Economics
Entstanden
- 2010
Ähnliche Objekte (12)
Capacitated lot-sizing with linked production quantities of adjacent periods
The linear dynamic lot size problem with minimum order quantities
The economic lot-sizing problem with remanufacturing: Analysis and an improved algorithm
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
The capacitated lot sizing problem with linked lot sizes
Proportional lot sizing and scheduling: Some extensions
Multi-level lot sizing: A literature survey
Lot sizing and scheduling: Survey and extensions
Cooperative lot sizing games in supply chains
Capacitated lot-sizing with sequence dependent setup costs
Lot sizing and scheduling for flexible flow lines
Capacitated lot-sizing with linked production quantities of adjacent periods
The linear dynamic lot size problem with minimum order quantities
The economic lot-sizing problem with remanufacturing: Analysis and an improved algorithm
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
The capacitated lot sizing problem with linked lot sizes
Proportional lot sizing and scheduling: Some extensions
Multi-level lot sizing: A literature survey
Lot sizing and scheduling: Survey and extensions
Cooperative lot sizing games in supply chains
Capacitated lot-sizing with sequence dependent setup costs
Lot sizing and scheduling for flexible flow lines
Capacitated lot-sizing with linked production quantities of adjacent periods
The linear dynamic lot size problem with minimum order quantities
The economic lot-sizing problem with remanufacturing: Analysis and an improved algorithm
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
The capacitated lot sizing problem with linked lot sizes
Proportional lot sizing and scheduling: Some extensions
Multi-level lot sizing: A literature survey
Lot sizing and scheduling: Survey and extensions
Cooperative lot sizing games in supply chains
Capacitated lot-sizing with sequence dependent setup costs