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 条
  • [21] The multiperiod two-dimensional non-guillotine cutting stock problem with usable leftovers
    Birgin, E. G.
    Romao, O. C.
    Ronconi, D. P.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (03) : 1392 - 1418
  • [22] A Tree-Based Heuristic for the One-Dimensional Cutting Stock Problem Optimization Using Leftovers
    Bressan, Glaucia Maria
    Pimenta-Zanon, Matheus Henrique
    Sakuray, Fabio
    MATERIALS, 2023, 16 (22)
  • [23] A combined approach to the solution to the general one-dimensional cutting stock problem
    Gradisar, M
    Trkman, P
    COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (07) : 1793 - 1807
  • [24] A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
    Belov, G
    Scheithauer, G
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) : 274 - 294
  • [25] The one-dimensional cutting stock problem with due dates
    Reinertsen, Harald
    Vossen, Thomas W. M.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 201 (03) : 701 - 711
  • [26] Using genetic algorithms in solving the one-dimensional cutting stock problem in the construction industry
    Shahin, AA
    Salem, OM
    CANADIAN JOURNAL OF CIVIL ENGINEERING, 2004, 31 (02) : 321 - 332
  • [27] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Gonçalo R. L. Cerqueira
    Sérgio S. Aguiar
    Marlos Marques
    Journal of Combinatorial Optimization, 2021, 42 : 657 - 674
  • [28] Modified Greedy Heuristic for the one-dimensional cutting stock problem
    Cerqueira, Goncalo R. L.
    Aguiar, Sergio S.
    Marques, Marlos
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 42 (03) : 657 - 674
  • [29] A simulated annealing heuristic for the one-dimensional cutting stock problem
    Chen, CLS
    Hart, SM
    Tham, WM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (03) : 522 - 535
  • [30] An evolutionary algorithm for the one-dimensional cutting stock problem
    Araujo, Silvio A.
    Constantino, Ademir A.
    Poldi, Kelly C.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2011, 18 (01) : 115 - 127
12345