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] A Petri Net-Based Algorithm for Solving the One-Dimensional Cutting Stock Problem
    Barragan-Vite, Irving
    Medina-Marin, Joselito
    Hernandez-Romero, Norberto
    Anaya-Fuentes, Gustavo Erick
    APPLIED SCIENCES-BASEL, 2024, 14 (18):
  • [32] 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
  • [33] A forward-looking matheuristic approach for the multi-period two-dimensional non-guillotine cutting stock problem with usable leftovers
    Birgin, Ernesto G.
    Romao, Oberlan C.
    Ronconi, Debora P.
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 223
  • [34] Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
    Scheithauer, G
    OPERATIONS RESEARCH PROCEEDINGS 1999, 2000, : 86 - 91
  • [35] Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
    Scheithauer, G
    Terno, J
    Müller, A
    Belov, G
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (12) : 1390 - 1401
  • [36] 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
  • [37] 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
  • [38] 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
  • [39] A heuristic for the one-dimensional cutting stock problem with pattern reduction
    Cui, Y.
    Zhao, X.
    Yang, Y.
    Yu, P.
    PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2008, 222 (06) : 677 - 685
  • [40] THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM USING 2 OBJECTIVES
    SINUANYSTERN, Z
    WEINER, I
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (02) : 231 - 236
12345