NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract.
Ayse AkbalikAtidel B. Hadj-AlouaneNathalie SauerHoucem GhribiPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- single item
- lot sizing
- batch size
- np hard
- fixed cost
- multi item
- multistage
- holding cost
- lead time
- wagner whitin
- inventory systems
- production planning
- ordering cost
- capacity expansion
- mixed integer
- mixed integer programming
- planning horizon
- supply chain
- approximation algorithms
- setup times
- scheduling problem
- combinatorial auctions
- upper bound
- computational complexity
- special case
- optimal solution
- long run
- finite horizon
- infinite horizon
- periodic review
- joint replenishment
- linear programming
- lower bound
- lot size
- worst case
- knapsack problem