A sequential heuristic procedure for one-dimensional cutting

被引：54
作者：
Gradisar, M
Kljajic, M
Resinovic, G
Jesenko, J
机构：
[1] Univ Maribor, Fac Org Sci, Maribor, Slovenia
[2] Univ Ljubljana, Fac Econ, Ljubljana 1000, Slovenia
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1999年 / 114卷 / 03期
关键词：
cutting; heuristics; optimisation;
D O I：
10.1016/S0377-2217(98)00140-4
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
The article examines the Sequential Heuristic Procedure (SHP) for optimising one-dimensional stock cutting when all stock lengths are different. In order to solve a bicriterial multidimensional knapsack problem with side constraints a lexicographic approach is applied. An item-oriented solution was found through a combination of approximations and heuristics that minimize the influence of ending conditions leading to almost optimal solutions. The computer program CUT was developed, based on the proposed algorithm. Two sample problems are presented and solved. A statistical analysis of parameters that affect material utilisation was also made. (C) 1999 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：557 / 568
页数：12
相关论文
共 50 条
[31]   Application of the two-stage one-dimensional cutting stock problem in the steel industry [J].
Santos, Jose Luis ;
Santos, Joni ;
Ferreira, Manuel Joao ;
Alves, Nelson ;
Guevara, Miguel .
2018 IEEE 27TH INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS (ISIE), 2018, :683-690
[32]   A THRESHOLD FOR RETURNING USABLE LEFTOVERS BACK ON STOCK WHEN SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEM WITH USABLE LEFTOVER [J].
Tomat, Luka ;
Gradisar, Mirko ;
Stiglic, Mitja .
SOR'13 PROCEEDINGS: THE 12TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2013, :109-113
[33]   Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost [J].
Cui, Yaodong ;
Zhong, Cheng ;
Yao, Yi .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 243 (02) :540-546
[34]   One-Dimensional Cutting Stock Optimization with Usable Leftover: A Case of Low Stock-to-Order Ratio [J].
Gradisar, Miro ;
Erjavec, Jure ;
Tomat, Luka .
INTERNATIONAL JOURNAL OF DECISION SUPPORT SYSTEM TECHNOLOGY, 2011, 3 (01) :54-66
[35]   Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost [J].
Silva, Eduardo M. ;
Melega, Gislaine M. ;
Akartunali, Kerem ;
de Araujo, Silvio A. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 304 (02) :443-460
[36]   A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading [J].
Vasko, FJ ;
Newhart, DD ;
Stott, KL .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 114 (01) :72-82
[37]   Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths [J].
Holthaus, O .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) :295-312
[38]   An Analysis of One-Dimensional Schelling Segregation [J].
Brandt, Christina ;
Immorlica, Nicole ;
Kamath, Gautam ;
Kleinberg, Robert .
STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, :789-803
[39]   New heuristics for one-dimensional bin-packing [J].
Fleszar, K ;
Hindi, KS .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (07) :821-839
[40]   One-dimensional heuristics adapted for two-dimensional rectangular strip packing [J].
Belov, G. ;
Scheithauer, G. ;
Mukhacheva, E. A. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (06) :823-832
12345