Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure.
Jesus O. CunhaRafael A. MeloPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- lot sizing
- mixed integer programming
- valid inequalities
- mixed integer program
- mixed integer
- rolling horizon
- multi item
- lead time
- single item
- cutting stock
- multistage
- linear programming relaxation
- production planning
- network design problem
- fixed cost
- capacity expansion
- cutting plane
- setup cost
- fixed charge
- planning horizon
- random variables
- lost sales
- service level
- lot size
- linear programming
- lp relaxation
- genetic algorithm
- metaheuristic
- probability distribution
- dynamic programming
- optimal solution
- objective function
- reinforcement learning