A decomposition algorithm for multi-item production planning with independent random demand

DOI10.1111/ITOR.13333MaRDI QIDQ6659124zbMATH OpenFDO

Authors Shayan Tavakoli Kafiabad, Masoumeh Kazemi Zanjani, Mustapha Nourelfath

Publication date 8 January 2025

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/ITOR.13333

zbMATH Keywords

Lagrangian relaxationmultistage stochastic programmingproduction planningrandom demandscenario tree

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty
• A multi-stage stochastic optimization model of a pastoral dairy farm
• A multi-stage stochastic programming approach for production planning with uncertainty in the quality of raw materials and demand
• A multi-stage stochastic programming approach in master production scheduling
• A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem
• Cluster Lagrangean decomposition in multistage stochastic optimization
• Comparing an expected value with a multistage stochastic optimization approach for the case of wine grape harvesting operations with quality degradation
• Coordinating harvest planning and scheduling in an agricultural supply chain through a stochastic bilevel programming
• Dynamic reverse supply chain network design under uncertainty: mathematical modeling and solution algorithm
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• Introduction to stochastic programming.
• Managing quality, supplier selection, and cold‐storage contracts in agrifood supply chain through stochastic optimization
• Models for Design and Control of Stochastic, Multi-Item Batch Production Systems
• Multi-item capacitated lot-sizing with demand uncertainty
• Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating
• Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints

This page was built for publication: A decomposition algorithm for multi-item production planning with independent random demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659124)