NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract
Year of publication: |
1 March 2017
|
---|---|
Authors: | Akbalik, Ayse ; Hadj-Alouane, Atidel B. ; Sauer, Nathalie ; Ghribi, Houcem |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 257.2017, 2 (1.3.), p. 483-493
|
Subject: | Inventory | Lot sizing | Capacity reservation contract | Complexity | Polynomial time algorithm | Theorie | Theory | Losgröße | Lot size | Kapazitätsplanung | Capacity planning | Produktionsplanung | Production planning | Lagerhaltungsmodell | Inventory model |
-
Lagrangean heuristic for a multi-plant lot-sizing problem with transfer and storage capacities
Deleplanque, Samuel, (2013)
-
A periodic review lot sizing problem with random yields, disruptions and inventory capacity
Wang, Daqin, (2014)
-
Dynamic lot-sizing model under perishability, substitution, and limited storage capacity
Jing, Fuying, (2020)
- More ...
-
Lot sizing problem with batch ordering under periodic buyback contract and lost sales
Farhat, Mlouka, (2019)
-
Feature cluster: Planning and scheduling in industrial and logistic systems
Dauzère-Pérès, Stéphane, (2009)
-
Scheduling of piecewise constant product flows: A Petri net approach
Proth, Jean-Marie, (1998)
- More ...