Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
From MaRDI portal
Publication:5060792
Recommendations
- Stochastic dual dynamic integer programming
- Multi-item capacitated lot-sizing with demand uncertainty
- Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- Heuristic methods for the capacitated stochastic lot-sizing problem under the static-dynamic uncertainty strategy
Cites work
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A classification of the literature on the planning of substitutable products
- A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales
- A multi-stage stochastic optimization model of a pastoral dairy farm
- A stochastic programming approach for supply chain network design under uncertainty
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
- An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem
- Analysis of stochastic dual dynamic programming method
- Benders decomposition for production routing under demand uncertainty
- Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
- Computational complexity of uncapacitated multi-echelon production planning problems
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Dynamic lot sizing with random demand and non-stationary costs
- Efficient reformulations for dynamic lot-sizing problems with product substitution
- Handbook of stochastic models and analysis of manufacturing system operations
- Importance sampling in stochastic programming: a Markov chain Monte Carlo approach
- Improving the performance of stochastic dual dynamic programming
- Introduction to stochastic programming.
- Linear programming models for a stochastic dynamic capacitated lot sizing problem
- Modeling industrial lot sizing problems: a review
- Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand
- Multi-item capacitated lot-sizing with demand uncertainty
- Multi-stage stochastic optimization applied to energy planning
- On the solution variability reduction of stochastic dual dynamic programming applied to energy planning
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
- Practical enhancements to the Magnanti-Wong method
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
- Progressive selection method for the coupled lot-sizing and cutting-stock problem
- Random yield and random demand in a production system with downward substitution
- Randomization of Number Theoretic Methods for Multiple Integration
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Single-item dynamic lot-sizing problems: an updated survey
- Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics
- Spatio-temporal hydro forecasting of multireservoir inflows for hydro-thermal scheduling
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- The Monte Carlo Method
- The effects of strategic and manufacturing flexibilities and supply chain agility on firm performance in the fashion industry
- Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns
- Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
Cited in
(5)- An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem
- Efficient approximate algorithms for a class of dynamic lot size problems under product substitution
- An efficient algorithm for capacitated assortment planning with stochastic demand and substitution
- Efficient reformulations for dynamic lot-sizing problems with product substitution
- Product configuration with partial demand misfit in an uncertain environment
This page was built for publication: Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060792)
