On the computational complexity of uncapacitated multi-plant lot-sizing problems.
Jesus O. CunhaHugo Harry KramerRafael A. MeloPublished in: CoRR (2020)
Keyphrases
- lot sizing
- cutting stock
- mixed integer programming
- multistage
- multi item
- single item
- rolling horizon
- computational complexity
- mixed integer program
- wagner whitin
- lead time
- mixed integer
- inventory systems
- production planning
- assembly systems
- setup cost
- planning horizon
- special case
- decision problems
- learning algorithm
- valid inequalities
- linear program