Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty.
Franco QuezadaCéline GicquelSafia Kedad-SidhoumPublished in: INFORMS J. Comput. (2022)
Keyphrases
- lot sizing
- integer programming
- production planning
- assembly systems
- multi item
- multistage
- single item
- rolling horizon
- facility location
- mixed integer programming
- exact methods
- wagner whitin
- lead time
- stochastic inventory control
- mixed integer
- integer program
- planning horizon
- lagrangian relaxation
- cutting stock
- set partitioning
- network design problem
- np hard
- setup cost
- linear programming
- valid inequalities
- cutting plane
- network flow
- lot size
- transportation problem
- timetabling problem
- reinforcement learning
- column generation
- search algorithm