A THRESHOLD FOR RETURNING USABLE LEFTOVERS BACK ON STOCK WHEN SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH USABLE LEFTOVER

被引：0
作者：
Tomat, Luka [1 ]
Gradisar, Mirko [1 ]
Stiglic, Mitja [1 ]
机构：
[1] Univ Ljubljana, Fac Econ, Kardeljeva Ploscad 17, SI-1000 Ljubljana, Slovenia
来源：
SOR'13 PROCEEDINGS: THE 12TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA | 2013年
关键词：
inventory management; cost prevention; cutting; usable leftovers; optimization; simulation; heuristics; PROGRAMMING APPROACH; OPTIMIZATION; INDUSTRY;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
For solving the one-dimensional cutting stock problem with usable leftover (1DCSPUL) exists many methods none of which consider the prevention of too many usable leftovers (UL) being returned back on stock after several successive instances. If the UL are longer than or equal to the threshold t they are returned back on stock to meet the future orders. Since the amount of UL on stock mostly depends on t we proposed a heuristic algorithm to determine optimal threshold t and the optimal number of UL in stock. The results show the effectiveness of the proposed method.
引用
收藏
页码：109 / 113
页数：5
相关论文
共 50 条
  • [31] Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
    Poldi, Kelly Cristina
    Arenales, Marcos Nereu
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) : 2074 - 2081
  • [32] ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH DIVISIBLE ITEMS: A CASE STUDY IN STEEL INDUSTRY
    Tanir, D.
    Ugurlu, O.
    Guler, A.
    Nuriyev, U.
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2019, 9 (03): : 473 - 484
  • [33] Pattern-set generation algorithm for the one-dimensional multiple stock sizes cutting stock problem
    Cui, Yaodong
    Cui, Yi-Ping
    Zhao, Zhigang
    ENGINEERING OPTIMIZATION, 2015, 47 (09) : 1289 - 1301
  • [34] On the one-dimensional stock cutting problem in the paper tube industry
    Matsumoto, Kazuki
    Umetani, Shunji
    Nagamochi, Hiroshi
    JOURNAL OF SCHEDULING, 2011, 14 (03) : 281 - 290
  • [35] Solving One-Dimensional Cutting Stock Problems with the Deep Reinforcement Learning
    Fang, Jie
    Rao, Yunqing
    Luo, Qiang
    Xu, Jiatai
    MATHEMATICS, 2023, 11 (04)
  • [36] One-dimensional cutting stock optimization in consecutive time periods
    Trkman, Peter
    Gradisar, Miro
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 179 (02) : 291 - 301
  • [37] Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
    Poldi, Kelly Cristina
    de Araujo, Silvio Alexandre
    ANNALS OF OPERATIONS RESEARCH, 2016, 238 (1-2) : 497 - 520
  • [38] A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
    Pitombeira-Neto, Anselmo Ramalho
    Prata, Bruno de Athayde
    TOP, 2020, 28 (01) : 178 - 192
  • [39] Heuristics for the integer one-dimensional cutting stock problem: A computational study
    Wascher, G
    Gau, T
    OR SPEKTRUM, 1996, 18 (03) : 131 - 144
  • [40] Optimization System Design for One-Dimensional Cutting-Stock Problem
    Cao Shukun
    Zhao Fang
    Ai Changsheng
    Dong Ke
    2008 IEEE INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING WORKSHOP PROCEEDINGS, VOLS 1 AND 2, 2008, : 877 - +
12345