Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
From MaRDI portal
Publication:2029964
DOI10.1016/j.ejor.2020.09.019zbMath1487.90023OpenAlexW3087622111WikidataQ115162884 ScholiaQ115162884MaRDI QIDQ2029964
Matthieu Gruson, Jean-François Cordeau, Raf Jans
Publication date: 4 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.09.019
Related Items
Split demand and deliveries in an integrated three-level lot sizing and replenishment problem, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints
- Lot-sizing on a tree
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Uncapacitated two-level lot-sizing
- Practical enhancements to the Magnanti-Wong method
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- A multicut algorithm for two-stage stochastic linear programs
- Partitioning procedures for solving mixed-variables programming problems
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
- The multiscenario lot size problem with concave costs.
- Single-item dynamic lot-sizing problems: an updated survey
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- The Benders decomposition algorithm: a literature review
- Dynamic capacitated lot sizing with random demand and dynamic safety stocks
- Handbook of stochastic models and analysis of manufacturing system operations
- A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Benders Decomposition for Production Routing Under Demand Uncertainty
- Tailoring Benders decomposition for uncapacitated network design
- Multi-Item Scheduling by Benders' Decomposition
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Introduction to Stochastic Programming
- An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem
- Production Planning by Mixed Integer Programming
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
