Adaptation and approximate strategies for solving the lot-sizing and scheduling problem under multistage demand uncertainty

作者：Curcio Eduardo^*; Amorim Pedro; Zhang Qi; Almada Lobo Bernardo

来源：International Journal of Production Economics, 2018, 202: 81-96.

DOI：10.1016/j.ijpe.2018.04.012

• Lot-sizing and scheduling problem
• GLSP
• Adjustable robust optimization
• Multistage stochastic programming
• Rolling-horizon

This work addresses the lot-sizing and scheduling problem under multistage demand uncertainty. A flexible production system is considered, with the possibility to adjust the size and the schedule of lots in every time period based on a rolling-horizon planning scheme. Computationally intractable multistage stochastic programming models are often employed on this problem. An adaptation strategy to the multistage setting for two-stage programming and robust optimization models is proposed. We also present an approximate heuristic strategy to address the problem more efficiently, relying on multistage stochastic programming and adjustable robust optimization. In order to evaluate each strategy and model proposed, a Monte Carlo simulation experiment under a rolling-horizon scheme is performed. Results show that the strategies are promising in solving large-scale problems: the approximate strategy based on adjustable robust optimization has, on average, 6.72% better performance and is 7.9 times faster than the deterministic model.

• 出版日期2018-8