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

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Production 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.

Cite

CITATION STYLE

APA

Kafiabad, S. T., Zanjani, M. K., & Nourelfath, M. (2025). A decomposition algorithm for multi-item production planning with independent random demand. International Transactions in Operational Research, 32(2), 1002–1032. https://doi.org/10.1111/itor.13333

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free