On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra.
Andrew J. MillerGeorge L. NemhauserMartin W. P. SavelsberghPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- lot sizing
- multi item
- multistage
- single item
- rolling horizon
- dynamic programming
- production planning
- mixed integer
- inventory systems
- setup times
- cutting stock
- mixed integer programming
- planning horizon
- knapsack problem
- setup cost
- assembly systems
- lead time
- supplier selection
- multi period
- fixed cost
- special case
- mixed integer program
- optimal solution
- production rate
- upper bound
- markov decision processes
- optimization problems