An improved typology of cutting and packing problems

被引:941
作者
Wascher, Gerhard [1 ]
HauBner, Heike [1 ]
Schumann, Holger [1 ]
机构
[1] Otto von Guericke Univ, Fac Econ & Management, D-39016 Magdeburg, Germany
关键词
cutting; packing; typology;
D O I
10.1016/j.ejor.2005.12.047
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The number of publications in the area of Cutting and Packing (C&P) has increased considerably over the last two decades. The typology of C&P problems introduced by Dyckhoff [Dyckhoff, H., 1990. A typology of cutting and packing problems. European Journal of Operational Research 44, 145-159] initially provided an excellent instrument for the organisation and categorisation of existing and new literature. However, over the years also some deficiencies of this typology became evident, which created problems in dealing with recent developments and prevented it from being accepted more generally. In this paper, the authors present an improved typology, which is partially based on Dyckhoff's original ideas, but introduces new categorisation criteria, which define problem categories different from those of Dyckhoff. Furthermore, a new, consistent system of names is suggested for these problem categories. Finally, the practicability of the new scheme is demonstrated by using it as a basis for a categorisation of the C&P literature from the years between 1995 and 2004. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:1109 / 1130
页数:22
相关论文
共 116 条
[1]   3D random stacking of weakly heterogeneous palletization problems [J].
Abdou, G ;
Elmasry, M .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1999, 37 (07) :1505-1524
[2]   Algorithms for on-line bin-packing problems with cardinality constraints [J].
Babel, L ;
Chen, B ;
Kellerer, H ;
Kotov, V .
DISCRETE APPLIED MATHEMATICS, 2004, 143 (1-3) :238-251
[3]  
BEASLEY JE, 1985, J OPER RES SOC, V36, P297
[4]   AN EXACT TWO-DIMENSIONAL NON-GUILLOTINE CUTTING TREE-SEARCH PROCEDURE [J].
BEASLEY, JE .
OPERATIONS RESEARCH, 1985, 33 (01) :49-64
[5]  
BEASLEY JE, 1985, J OPER RES SOC, V36, P71, DOI 10.1057/jors.1985.10
[6]   A population heuristic for constrained two-dimensional non-guillotine cutting [J].
Beasley, JE .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 156 (03) :601-627
[7]   A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths [J].
Belov, G ;
Scheithauer, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) :274-294
[8]  
Benati S, 1997, J OPER RES SOC, V48, P288
[9]   Hybridising tabu search with optimisation techniques for irregular stock cutting [J].
Bennell, JA ;
Dowsland, KA .
MANAGEMENT SCIENCE, 2001, 47 (08) :1160-1172
[10]   Optimizing the packing of cylinders into a rectangular container:: A nonlinear approach [J].
Birgin, EG ;
Martínez, JM ;
Ronconi, DP .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 160 (01) :19-33