Shayan Tavakoli Kafiabad, Masoumeh Kazemi Zanjani, Mustapha Nourelfath

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

  • Management of Technology and Innovation
  • Management Science and Operations Research
  • Strategy and Management
  • Computer Science Applications
  • Business and International Management
Save to CiteDrive Show PDF

AbstractProduction planning in a multiproduct setting where the demands for different items are independent random variables that are also featured with a dynamic behavior over the planning horizon is a challenging task. With a particular focus on maintenance facilities, this study proposes a multistage stochastic programming (MSP) model for operations planning under independent random demand of faulty components in the modular‐structured devices (e.g., gas turbines) received for repair and overhaul services. A Lagrangian relaxation‐based decomposition heuristic is also developed to efficiently solve the problem for real‐size instances. This heuristic relies on decomposing the MSP model into submodels corresponding to component STs and coordinating them via a subgradient algorithm to obtain a high‐quality feasible solution. Our numerical experiments conducted on a range of problem instances endorse the significant value of incorporating demand uncertainty and the effectiveness of the proposed solution methodology in overcoming computational complexity.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

  • Web-based, modern reference management
  • Collaborate and share with fellow researchers
  • Integration with Overleaf
  • Comprehensive BibTeX/BibLaTeX support
  • Save articles and websites directly from your browser
  • Search for new articles from a database of tens of millions of references
Try out CiteDrive

More from our Archive