A computational study of the general lot-sizing and scheduling model under demand uncertainty via robust and stochastic approaches

作者：Alem Douglas^*; Curcio Eduardo; Amorim Pedro; Almada Lobo Bernardo

来源：Computers & Operations Research, 2018, 90: 125-141.

DOI：10.1016/j.cor.2017.09.005

• Lot sizing and scheduling problems
• GLSP
• Robust optimization
• Stochastic programming
• Empirical study
• Monte carlo simulation

This paper presents an empirical assessment of the General Lot-Sizing and Scheduling Problem (GLSP) under demand uncertainty by means of a budget-uncertainty set robust optimization and a two-stage stochastic programming with recourse model. We have also developed a systematic procedure based on Monte Carlo simulation to compare both models in terms of protection against uncertainty and computational tractability. The extensive computational experiments cover different instances characteristics, a considerable number of combinations between budgets of uncertainty and variability levels for the robust optimization model, as well as an increasing number of scenarios and probability distribution functions for the stochastic programming model. Furthermore, we have devised some guidelines for decision-makers to evaluate a priori the most suitable uncertainty modeling approach according to their preferences.

• 出版日期2018-2