The integrated lot-sizing and cutting stock problem under demand uncertainty

被引:8
|
作者
Curcio, Eduardo [1 ,4 ]
de Lima, Vinicius L. [2 ]
Miyazawa, Flavio K. [2 ]
Silva, Elsa [1 ]
Amorim, Pedro [1 ,3 ]
机构
[1] INESC TEC, Campus FEUP, Porto, Portugal
[2] Univ Estadual Campinas, Inst Comp, Campinas, SP, Brazil
[3] Univ Porto, Fac Engn, Porto, Portugal
[4] INESC TEC, Campus FEUP, Rua Dr Roberto Frias,S-N, P-4200465 Porto, Portugal
基金
巴西圣保罗研究基金会;
关键词
Lot-sizing; cutting stock; stochastic programming; robust optimisation; column generation; rolling-horizon; ROBUST OPTIMIZATION APPROACH; LINEAR-PROGRAMMING APPROACH; CONSTRAINTS; ALGORITHMS; MODELS;
D O I
10.1080/00207543.2022.2136279
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Interest in integrating lot-sizing and cutting stock problems has been increasing over the years. This integrated problem has been applied in many industries, such as paper, textile and furniture. Yet, there are only a few studies that acknowledge the importance of uncertainty to optimise these integrated decisions. This work aims to address this gap by incorporating demand uncertainty through stochastic programming and robust optimisation approaches. Both robust and stochastic models were specifically conceived to be solved by a column generation method. In addition, both models are embedded in a rolling-horizon procedure in order to incorporate dynamic reaction to demand realisation and adapt the models to a multistage stochastic setting. Computational experiments are proposed to test the efficiency of the column generation method and include a Monte Carlo simulation to assess both stochastic programming and robust optimisation for the integrated problem. Results suggest that acknowledging uncertainty can cut costs by up to 39.7%, while maintaining or reducing variability at the same time.
引用
收藏
页码:6691 / 6717
页数:27
相关论文
共 50 条
  • [1] Integrated lot-sizing and cutting stock problem applied to the mattress industry
    Christofoletti, Mauricio Moz
    de Araujo, Silvio Alexandre
    Cherri, Adriana Cristina
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2021, 72 (06) : 1279 - 1293
  • [2] An analysis of the integrated lot-sizing and cutting-stock problem formulation
    Pierini, Livia Maria
    Poldi, Kelly Cristina
    [J]. APPLIED MATHEMATICAL MODELLING, 2021, 99 : 155 - 165
  • [3] The adaptive robust lot-sizing problem with backorders under demand uncertainty
    Metzker, Paula
    Thevenin, Simon
    Adulyasak, Yossiri
    Dolgui, Alexandre
    [J]. 2021 IEEE 17TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2021, : 997 - 1001
  • [4] A combined cutting-stock and lot-sizing problem
    Nonås, SL
    Thorstenson, A
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) : 327 - 342
  • [5] Combined cutting stock and lot-sizing problem with pattern setup
    Ma, Ning
    Liu, Ya
    Zhou, Zhili
    Chu, Chengbin
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2018, 95 : 44 - 55
  • [6] The combined cutting stock and lot-sizing problem in industrial processes
    Gramani, Maria Cristina N.
    Franca, Paulo M.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (01) : 509 - 521
  • [7] An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem
    Oliveira, Washington A.
    Fiorotto, Diego J.
    Song, Xiang
    Jones, Dylan F.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 295 (03) : 996 - 1007
  • [8] Capacitated Stochastic Lot-sizing and Production Planning Problem Under Demand Uncertainty
    Seyfi, Seyed Amin
    Yilmaz, Gorkem
    Yanikoglu, Ihsan
    Garip, Alpaslan
    [J]. IFAC PAPERSONLINE, 2022, 55 (10): : 2731 - 2736
  • [9] Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers
    D. N. do Nascimento
    S. A. de Araujo
    A. C. Cherri
    [J]. Annals of Operations Research, 2022, 316 : 785 - 803
  • [10] Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers
    do Nascimento, D. N.
    de Araujo, S. A.
    Cherri, A. C.
    [J]. ANNALS OF OPERATIONS RESEARCH, 2022, 316 (02) : 785 - 803