A Two-Phase Optimization Approach for Reducing the Size of the Cutting Problem in the Box-Production Industry: A Case Study

被引:13
作者
Mosallaeipour, Sam [1 ]
Nazerian, Ramtin [1 ]
Ghadirinejad, Mazyar [1 ]
机构
[1] Eastern Mediterranean Univ, Dept Ind Engn, TR-99628 Famagusta, North Cyprus, Turkey
来源
INDUSTRIAL ENGINEERING IN THE INDUSTRY 4.0 ERA | 2018年
关键词
Material selection; Production planning; Cutting problem; PACKING PROBLEMS; ALGORITHM; STOCK;
D O I
10.1007/978-3-319-71225-3_6
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this study, the cutting problem as one of the main problems within the box-production industries is discussed. The cutting problem refers to the problem of dividing a piece of rectangular raw material, which is usually large, into smaller pieces to produce various products. Cutting problems are NP-hard problems. Numerous researches offering good solutions to these problems have been conducted over the past few years. In the present study, considering the complexity of the problem, a model reflecting the nature of the problem is proposed and a new two-phase solution approach is suggested. Utilizing the proposed method significantly reduces the size of the problem and simplifies the applicability of the solution approach in real life. Furthermore, to evaluate the efficiency and utilization of the proposed method, its application in a specific company is tested. Finally, the performance of the method is calculated and its use is compared with the company's traditional method.
引用
收藏
页码:63 / 81
页数:19
相关论文
共 12 条
[1]  
BEASLEY JE, 1985, J OPER RES SOC, V36, P297
[2]   AN EXACT TWO-DIMENSIONAL NON-GUILLOTINE CUTTING TREE-SEARCH PROCEDURE [J].
BEASLEY, JE .
OPERATIONS RESEARCH, 1985, 33 (01) :49-64
[3]   Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm [J].
Birgin, E. G. ;
Lobato, R. D. ;
Morabito, R. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2012, 63 (02) :183-200
[4]   AN EXACT ALGORITHM FOR ORTHOGONAL 2-D CUTTING PROBLEMS USING GUILLOTINE CUTS [J].
CHRISTOFIDES, N ;
HADJICONSTANTINOU, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 83 (01) :21-38
[5]   Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation [J].
Cintra, G. F. ;
Miyazawa, F. K. ;
Wakabayashi, Y. ;
Xavier, E. C. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 191 (01) :61-85
[6]   THEORY AND COMPUTATION OF KNAPSACK FUNCTIONS [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1966, 14 (06) :1045-&
[7]   MULTISTAGE CUTTING STOCK PROBLEMS OF 2 AND MORE DIMENSIONS [J].
GILMORE, PC ;
GOMORY, RE .
OPERATIONS RESEARCH, 1965, 13 (01) :94-&
[8]   An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems [J].
Kang, M. ;
Yoon, K. .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (15) :4437-4455
[9]   Two-dimensional packing problems: A survey [J].
Lodi, A ;
Martello, S ;
Monaci, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) :241-252
[10]   An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems [J].
Russo, Mauro ;
Sforza, Antonio ;
Aerie, Claudio .
COMPUTERS & OPERATIONS RESEARCH, 2014, 50 :97-114