Single-item dynamic lot-sizing problems: An updated survey

•Almost 300 papers on the single item lot sizing problem are surveyed.•A structured classification is presented for solution approaches and different extensions of the single item lot sizing problem.•Future research directions are proposed. Following our previous paper (Brahimi, Dauzère-Pérès, Najid...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:European journal of operational research Jg. 263; H. 3; S. 838 - 863
Hauptverfasser: Brahimi, Nadjib, Absi, Nabil, Dauzère-Pérès, Stéphane, Nordli, Atle
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 16.12.2017
Elsevier
Schlagworte:
Computer Science
Dynamic demand
Lot sizing
Operations Research
Planning
Production
Single item
Dynamic demand
Lot sizing
Planning
Production
Single item
Lot Sizing
Single Item
Dynamic Demand
ISSN:0377-2217, 1872-6860
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•Almost 300 papers on the single item lot sizing problem are surveyed.•A structured classification is presented for solution approaches and different extensions of the single item lot sizing problem.•Future research directions are proposed. Following our previous paper (Brahimi, Dauzère-Pérès, Najid, & Nordli, 2006), we present an updated and extended survey of Single-Item Lot-Sizing Problems with focus on publications from 2004 to 2016. Exact and heuristic solution procedures are surveyed. A concise and comprehensive summary of different extensions of the problem is given. The classification of the extensions is based on different characteristics such as resource limitations, assumptions on demand and cost structure. The large number of surveyed papers shows the increased interest of researchers in lot-sizing problems in general and in single-item problems in particular. The survey and the proposed classification should help researchers to identify new research topics, to propose relevant problems and/or novel solution approaches.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2017.05.008