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 条

[41] On the one-dimensional stock cutting problem in the paper tube industry
Kazuki Matsumoto
Shunji Umetani
Hiroshi Nagamochi
Journal of Scheduling, 2011, 14 : 281 - 290
[42] 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
[43] A NEW HEURISTIC ALGORITHM FOR THE ONE-DIMENSIONAL CUTTING STOCK PROBLEM
Berberler, M. E.
Nuriyev, U. G.
APPLIED AND COMPUTATIONAL MATHEMATICS, 2010, 9 (01) : 19 - 30
[44] Solving one-dimensional cutting stock problems with multiple stock material lengths using cutting plane approach
Scheithauer, G
Belov, G
OPERATIONS RESEARCH PROCEEDINGS 2001, 2002, : 285 - 292
[45] Solving a one-dimensional cutting-stock problem in a small manufacturing firm: a case study
Lefrancois, Pierre
Gascon, Andre
IIE Transactions (Institute of Industrial Engineers), 1995, 27 (04): : 483 - 496
[46] An efficient mathematical model for solving one-dimensional cutting stock problem using sustainable trim
Vishwakarma, Ravi
Powar, P. L.
ADVANCES IN INDUSTRIAL AND MANUFACTURING ENGINEERING, 2021, 3
[47] Solving One-Dimensional Cutting Stock Problems with the Deep Reinforcement Learning
Fang, Jie
Rao, Yunqing
Luo, Qiang
Xu, Jiatai
MATHEMATICS, 2023, 11 (04)
[48] An Ant Colony Optimization Algorithm for the One-dimensional Cutting Stock Problem with Multiple Stock Lengths
Lu, Qiang
Wang, Zhiguang
Chen, Ming
ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 7, PROCEEDINGS, 2008, : 475 - 479
[49] A balance approach for the one-dimensional multiple stock size cutting stock problem with setup cost
Wu, Dianjian
Yan, Chunping
PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART B-JOURNAL OF ENGINEERING MANUFACTURE, 2016, 230 (12) : 2182 - 2189
[50] Heuristics for the integer one-dimensional cutting stock problem: A computational study
Wascher, G
Gau, T
OR SPEKTRUM, 1996, 18 (03) : 131 - 144

← 1 2 3 4 5 →