The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases.
Ayse AkbalikChristophe RapinePublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- lot sizing
- single item
- np hard
- wagner whitin
- multistage
- multi item
- inventory systems
- mixed integer programming
- capacity constraints
- setup times
- production planning
- lead time
- planning horizon
- setup cost
- linear programming
- mixed integer
- computational complexity
- fixed cost
- optimal solution
- periodic review
- joint replenishment
- special case
- lower bound
- scheduling problem
- approximation algorithms
- upper bound
- probability distribution
- lagrangian relaxation
- mathematical programming
- production system
- worst case
- dynamic programming