One-dimensional stock cutting: optimization of usable leftovers in consecutive orders

被引:15
|
作者
Tomat, Luka [1 ]
Gradisar, Mirko [1 ]
机构
[1] Univ Ljubljana, Fac Econ, Acad Unit Business Informat & Logist, Kardeljeva Ploscad 17, Ljubljana 1000, Slovenia
关键词
Cutting stock problem; Usable leftovers; Trim-loss; Optimization; Simulation; TRIM-LOSS PROBLEM; PROGRAMMING APPROACH; PACKING PROBLEM; ALGORITHMS; INDUSTRY;
D O I
10.1007/s10100-017-0466-y
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper deals with usable leftovers (UL) in one-dimensional stock cutting in consecutive orders. UL are leftovers longer than a certain threshold and are returned to stock in order to be used in future orders. Shorter leftovers are treated as trim-loss. If UL are being used at a slower pace, than they are being generated for a longer period of time, excessive growth of UL in stock can appear. This is not acceptable due to higher costs of manipulations and warehousing. However, a certain amount of UL in stock is desirable because it contributes to greater variety of stock lengths, which in general results in lower trim-loss. The method solves the problem of how to calculate the near optimal amount of UL in stock and how to control the stock. The proposed method is tested by using a computer simulation in which UL from previous orders are used in the next ones instead of being randomly generated. The computational results indicate that trim-loss in consecutive orders is reduced, and excessive growth of UL in stock is prevented.
引用
收藏
页码:473 / 489
页数:17
相关论文
共 50 条
  • [1] One-dimensional stock cutting: optimization of usable leftovers in consecutive orders
    Luka Tomat
    Mirko Gradišar
    [J]. Central European Journal of Operations Research, 2017, 25 : 473 - 489
  • [2] The one-dimensional cutting stock problem with usable leftovers - A survey
    Cherri, Adriana Cristina
    Arenales, Marcos Nereu
    Yanasse, Horacio Hideki
    Poldi, Kelly Cristina
    Goncalves Vianna, Andrea Carla
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 236 (02) : 395 - 402
  • [3] Prototyping the One-Dimensional Cutting Stock Problem with Usable Leftovers for the Furniture Industry
    Oliveira, Oscar
    Gamboa, Dorabela
    Fernandes, Pedro
    [J]. NEW CONTRIBUTIONS IN INFORMATION SYSTEMS AND TECHNOLOGIES, VOL 1, PT 1, 2015, 353 : 671 - 677
  • [4] 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
  • [5] A THRESHOLD FOR RETURNING USABLE LEFTOVERS BACK ON STOCK WHEN SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH USABLE LEFTOVER
    Tomat, Luka
    Gradisar, Mirko
    Stiglic, Mitja
    [J]. SOR'13 PROCEEDINGS: THE 12TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2013, : 109 - 113
  • [6] 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
  • [7] New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers
    Cui, Yaodong
    Song, Xiang
    Chen, Yan
    Cui, Yi-Ping
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2017, 68 (03) : 269 - 280
  • [8] Hybrid heuristic for the one-dimensional cutting stock problem with usable leftovers and additional operating constraints
    Bertolinia, Massimo
    Mezzogoria, Davide
    Zammorib, Francesco
    [J]. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2024, 15 (01) : 149 - 170
  • [9] One-dimensional cutting stock optimization in consecutive time periods
    Trkman, Peter
    Gradisar, Miro
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) : 291 - 301
  • [10] A Tree-Based Heuristic for the One-Dimensional Cutting Stock Problem Optimization Using Leftovers
    Bressan, Glaucia Maria
    Pimenta-Zanon, Matheus Henrique
    Sakuray, Fabio
    [J]. MATERIALS, 2023, 16 (22)