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 条
[61]   Algorithms for the variable sized bin packing problem [J].
Kang, J ;
Park, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 147 (02) :365-372
[62]  
Katagiri H., 2004, CENTRAL EUROPEAN J O, V12, P59
[63]   Cutting optimization with variable-sized stock and inventory status data [J].
Kos, L ;
Duhovnik, J .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2002, 40 (10) :2289-2301
[64]   GUILLOTINEABLE BIN PACKING - A GENETIC APPROACH [J].
KROGER, B .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 84 (03) :645-661
[65]   Upper bounds and algorithms for the maximum cardinality bin packing problem [J].
Labbé, M ;
Laporte, G ;
Martello, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (03) :490-498
[66]   COMPACTION AND SEPARATION ALGORITHMS FOR NONCONVEX POLYGONS AND THEIR APPLICATIONS [J].
LI, ZY ;
MILENKOVIC, V .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 84 (03) :539-561
[67]   An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container [J].
Lins, L ;
Lins, S ;
Morabito, R .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) :421-439
[68]   Two-dimensional packing problems: A survey [J].
Lodi, A ;
Martello, S ;
Monaci, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) :241-252
[69]   Models and bounds for two-dimensional level packing problems [J].
Lodi, A ;
Martello, S ;
Vigo, D .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2004, 8 (03) :363-379
[70]   Heuristic algorithms for the three-dimensional bin packing problem [J].
Lodi, A ;
Martello, S ;
Vigo, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 141 (02) :410-420