Arbeitspapier
A Dynamic Lot-Sizing Model with Demand Time Windows
One of the basic assumptions of the classical dynamic lot-sizing model is that theaggregate demand of a given period must be satisfied in that period. Under thisassumption, if backlogging is not allowed then the demand of a given period cannotbe delivered earlier or later than the period. If backlogging is allowed, the demandof a given period cannot be delivered earlier than the period, but can be deliveredlater at the expense of a backordering cost. Like most mathematical models, theclassical dynamic lot-sizing model is a simplified paraphrase of what might actuallyhappen in real life. In most real life applications, the customer offers a graceperiod - we call it a demand time window - during which a particular demand can besatisfied with no penalty. That is, in association with each demand, the customerspecifies an earliest and a latest delivery time. The time interval characterizedby the earliest and latest delivery dates of a demand represents the correspondingtime window.This paper studies the dynamic lot-sizing problem with demand time windows andprovides polynomial time algorithms for computing its solution. If shortages arenot allowed, the complexity of the proposed algorithm is order T square. Whenbacklogging is allowed, the complexity of the proposed algorithm is order T cube.
- Sprache
-
Englisch
- Erschienen in
-
Series: Tinbergen Institute Discussion Paper ; No. 99-095/4
- Klassifikation
-
Wirtschaft
- Thema
-
lot-sizing
dynamic programming
time windows
Losgröße
Auftrag
Produktionssteuerung
Theorie
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Lee, Chung-Yee
Çetinkaya, Sila
Wagelmans, Albert P.M.
- Ereignis
-
Veröffentlichung
- (wer)
-
Tinbergen Institute
- (wo)
-
Amsterdam and Rotterdam
- (wann)
-
1999
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:45 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
- Lee, Chung-Yee
- Çetinkaya, Sila
- Wagelmans, Albert P.M.
- Tinbergen Institute
Entstanden
- 1999
Ähnliche Objekte (12)
Dynamic capacitated lot sizing with random demand and dynamic safety stocks
Comparison of different approaches to multistage lot sizing with uncertain demand
Dynamic stochastic lot sizing with forecast evolution in rolling‐horizon planning
The capacitated lot sizing problem with linked lot sizes
Demand shuffle - a novel method for multi-level proportional lot sizing and scheduling
The performance of lot sizing heuristics in the case of sparse demand patterns
Coordinated Lot-sizing and Dynamic Pricing under a Supplier All-units Quantity Discount
The block planning approach for continuous time-based dynamic lot sizing and scheduling
Cooperative lot sizing games in supply chains
Multi-level lot sizing: A literature survey
Lot sizing and scheduling: Survey and extensions
Proportional lot sizing and scheduling: Some extensions
Dynamic capacitated lot sizing with random demand and dynamic safety stocks
Comparison of different approaches to multistage lot sizing with uncertain demand
Dynamic stochastic lot sizing with forecast evolution in rolling‐horizon planning
The capacitated lot sizing problem with linked lot sizes
Demand shuffle - a novel method for multi-level proportional lot sizing and scheduling
The performance of lot sizing heuristics in the case of sparse demand patterns
Coordinated Lot-sizing and Dynamic Pricing under a Supplier All-units Quantity Discount
The block planning approach for continuous time-based dynamic lot sizing and scheduling
Cooperative lot sizing games in supply chains
Multi-level lot sizing: A literature survey
Lot sizing and scheduling: Survey and extensions
Proportional lot sizing and scheduling: Some extensions
Dynamic capacitated lot sizing with random demand and dynamic safety stocks
Comparison of different approaches to multistage lot sizing with uncertain demand
Dynamic stochastic lot sizing with forecast evolution in rolling‐horizon planning
The capacitated lot sizing problem with linked lot sizes
Demand shuffle - a novel method for multi-level proportional lot sizing and scheduling
The performance of lot sizing heuristics in the case of sparse demand patterns
Coordinated Lot-sizing and Dynamic Pricing under a Supplier All-units Quantity Discount
The block planning approach for continuous time-based dynamic lot sizing and scheduling
Cooperative lot sizing games in supply chains
Multi-level lot sizing: A literature survey
Lot sizing and scheduling: Survey and extensions