Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost.
Ayse AkbalikChristophe RapinePublished in: Oper. Res. Lett. (2012)
Keyphrases
- lot sizing
- single item
- multi item
- production planning
- production cost
- multistage
- wagner whitin
- inventory systems
- production rate
- setup cost
- lot size
- mixed integer
- lead time
- mixed integer programming
- holding cost
- planning horizon
- fixed cost
- learning algorithm
- optimization problems
- joint replenishment
- computational complexity
- combinatorial auctions
- lost sales
- special case
- storage space
- combinatorial optimization
- resource allocation
- np hard