A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales
DOI10.1016/j.cor.2019.104865zbMath1458.90238OpenAlexW2996510669WikidataQ126566647 ScholiaQ126566647MaRDI QIDQ2289944
Celine Gicquel, Safia Kedad-Sidhoum, Dong Quan Vu, Franco Quezada
Publication date: 27 January 2020
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.104865
branch-and-cut algorithmvalid inequalitiesscenario treelost salesstochastic lot-sizingmulti-stage stochastic integer programmingremanufacturing system
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Production models (90B30)
Related Items (8)
Cites Work
- Capacitated dynamic production and remanufacturing planning under demand and return uncertainty
- Lot-sizing on a tree
- A stochastic production planning problem in hybrid manufacturing and remanufacturing systems with resource capacity planning
- Heuristic policies for the stochastic economic lot sizing problem with remanufacturing under service level constraints
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- A stochastic dynamic programming based model for uncertain production planning of re-manufacturing system
- A multi-stage stochastic programming approach for production planning with uncertainty in the quality of raw materials and demand
- Multi-item capacitated lot-sizing with demand uncertainty
- Cutting Planes for Multistage Stochastic Integer Programs
- Production Planning by Mixed Integer Programming
- Production planning for closed-loop supply chains with product recovery and reuse: an analytical approach
- The uncapacitated lot-sizing problem with sales and safety stocks
This page was built for publication: A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales