An improved typology of cutting and packing problems

European Journal of Operational Research

Volumn 183, Issue 3, 2007, Pages 1109-1130

  Wäscher, Gerhard ^a   Haußner, Heike ^a   Schumann, Holger ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

Cutting; Packing; Typology

Indexed keywords

PROBLEM SOLVING; RESEARCH AND DEVELOPMENT MANAGEMENT; SOCIETIES AND INSTITUTIONS; SYSTEMS ENGINEERING;

CONSISTENT SYSTEMS; PACKING PROBLEMS; TYPOLOGY;

OPERATIONS RESEARCH;

EID: 34447100387     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.12.047     Document Type: Article

References (116)

1. Abdou G., and Elmasry M. 3D random stacking of weakly heterogeneous palletization problems. International Journal of Production Research 37 (1999) 1505-1524
2. Babel L., Chen B., Kellerer H., and Kotov V. Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Applied Mathematics 143 (2004) 238-251
3. Beasley J.E. Bounds for two-dimensional cutting. Journal of the Operational Research Society 36 (1985) 71-74
4. Beasley J.E. An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research 33 (1985) 49-64
5. Beasley J.E. Algorithms for unconstrained two-dimensional guillotine cutting. Journal of the Operational Research Society 36 (1985) 297-306
6. Beasley J.E. A population heuristic for constrained two-dimensional non-guillotine cutting. European Journal of Operational Research 156 (2004) 601-627
7. Belov G., and Scheithauer G. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research 141 (2002) 274-294
8. Benati S. An algorithm for a cutting stock problem on a strip. Journal of the Operational Research Society 48 (1997) 288-294
9. Bennell J.A., and Dowsland K.A. Hybridising tabu search with optimisation techniques for irregular stock cutting. Management Science 47 (2001) 1160-1172
10. Birgin E.G., Martinez J.M., and Ronconi D.P. Optimizing the packing of cylinders into a rectangular container: A nonlinear approach. European Journal of Operational Research 160 (2005) 19-33
11. Bischoff E.E., and Marriott M.D. A comparative evaluation of heuristics for container loading. European Journal of Operational Research 44 (1990) 267-276
12. Bischoff E.E., and Ratcliff M.S.W. Loading multiple pallets. Journal of Operational Research Society 46 (1995) 1322-1336
13. Bischoff E.E., Janetz F., and Ratcliff M.S.W. Loading pallets with non-identical items. European Journal of Operational Research 84 (1995) 681-692
14. Błażewicz J., Ecker K.H., Pesch E., Schmidt G., and We{ogonek}glarz J. Scheduling Computer and Manufacturing Processes. 2nd ed. (2001), Springer, Berlin
15. Bortfeldt A. Eine Heuristik für Multiple Containerladeprobleme. OR Spektrum 22 (2000) 239-261
16. Bortfeldt A., and Gehring H. Ein Tabu Search-Verfahren für Containerbelade probleme mit schwach heterogenem Kistenvorrat. OR Spektrum 20 (1998) 237-250
17. Bortfeldt A., and Gehring H. A hybrid genetic algorithm for the container loading problem. European Journal of Operational Research 131 (2001) 143-161
18. Bortfeldt A., Gehring H., and Mack D. A parallel tabu search algorithm for solving the container loading problem. Parallel Computing 29 (2003) 641-662
19. Brucker P. Scheduling Algorithms. 4th ed. (2004), Springer, Berlin
20. Caprara A., and Monaci M. On the two-dimensional knapsack problem. Operations Research Letters 32 (2004) 5-14
21. Carnieri C., Mendoza G.A., and Gavinho L.G. Solution procedures for cutting lumber into furniture parts. European Journal of Operational Research 73 (1994) 495-501
22. Carravilla M.A., Ribeiro C., and Oliveira J.F. Solving nesting problems with non-convex polygons by constraint logic programming. International Transactions in Operational Research 10 (2003) 651-664
23. Chen C.S., Lee S.M., and Shen Q.S. An analytical model for the container loading problem. European Journal of Operational Research 80 (1995) 68-76
24. Christofides N., and Hadjiconstantinou E. An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research 83 (1995) 39-56
25. Christofides N., and Whitlock C. An algorithm for two-dimensional cutting problems. Operations Research 25 (1977) 30-44
26. Chu C., and La R. Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms. SIAM Journal on Computing 30 (2001) 2069-2083
27. Coffman E.G., and Lueker G.S. Approximation algorithms for extensible bin packing. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (2001), Society for Industrial and Applied Mathematics, Philadelphia 586-588
28. Correia M.H., Oliveira J.F., and Ferreira J.S. Cylinder packing by simulated annealing. Pesquisa Operacional 20 (2000) 269-286
29. Correia M.H., Oliveira J.F., and Ferreira J.S. A new upper bound for the cylinder packing problem. International Transactions in Operational Research 8 (2001) 571-583
30. Das S., and Ghosh D. Binary knapsack problems with random budgets. Journal of the Operational Research Society 54 (2003) 970-983
31. Dowsland K.A. An exact algorithm for the pallet loading problem. European Journal of Operational Research 31 (1987) 78-84
32. Drexl A. A simulated annealing approach to the multiconstraint zero-one knapsack problem. Computing 40 (1988) 1-8
33. Dyckhoff H. A new linear programming approach to the cutting stock problem. Operations Research 29 (1981) 1092-1104
34. Dyckhoff H. A typology of cutting and packing problems. European Journal of Operational Research 44 (1990) 145-159
35. Eley M. A bottleneck assignment approach to the multiple container loading problem. OR Spectrum 25 (2003) 45-60
36. Faroe O., Pisinger D., and Zachariasen M. Guided local search for the three-dimensional bin-packing problem. INFORMS Journal on Computing 15 (2003) 267-283
37. Fekete S.P., and Schepers J. A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Burkard R., and Woeginger G.J. (Eds). Algorithms-Proceedings of the 5th Annual European Symposium, Graz, Austria, Sept. 15-17, 1997. Lecture Notes in Computer Science vol. 1284 (1997), Springer, Berlin 144-156
38. Foerster H., and Wäscher G. Simulated annealing for order spread minimization in sequencing cutting patterns. European Journal of Operational Research 110 (1998) 272-281
39. Gavish B., and Pirkul H. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality. Mathematical Programming 31 (1985) 78-105
40. George J.A. A method for solving container packing for a single size of box. Journal of the Operations Research Society 43 (1992) 307-312
41. George J.A., and Robinson D.F. A heuristic for packing boxes into a container. Computers & Operations Research 7 (1980) 147-156
42. George J.A., George J.M., and Lamar B.W. Packing different-sized circles into a rectangular container. European Journal of Operational Research 84 (1995) 693-712
43. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting-stock problem. Operations Research 9 (1961) 849-859
44. Gilmore P.C., and Gomory R.E. A linear programming approach to the cutting-stock problem-Part II. Operations Research 11 (1963) 864-888
45. Gilmore P.C., and Gomory R.E. Multistage cutting stock problems of two and more dimensions. Operations Research 13 (1965) 94-120
46. Golden B.L. Approaches to the cutting stock problem. AIIE Transactions 8 (1976) 265-274
47. Gradišar M., Kljajić M., Resinovič G., and Jesenko J. A sequential heuristic procedure for one-dimensional cutting. European Journal of Operational Research 114 (1999) 557-568
48. Gradišar M., Resinovič G., and Kljajić M. Evaluation of algorithms for one-dimensional cutting. Computers & Operations Research 29 (2002) 1207-1220
49. Haims M.J., and Freeman H. A multistage solution of the template-layout problem. IEEE Transactions on Systems Science and Cybernetics SSC-6 (1970) 145-151
50. Healy P., and Moll R. A local optimization-based solution to the rectangle layout problem. Journal of the Operational Research Society 47 (1996) 523-537
51. Hemminki J., Leipälä T., and Nevalainen O. On-line packing with boxes of different sizes. International Journal of Production Research 36 (1998) 2225-2245
52. Herz J.C. Recursive computational procedure for two-dimensional stock cutting. IBM Journal of Research and Development 16 (1972) 462-469
53. Heuer J. Das Multiprocessor Scheduling-Problem mit reihenfolgeabhängigen Rüstzeiten (2004), Deutscher Universitäts-Verlag, Wiesbaden
54. Hifi M. Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study. Computers & Operations Research 31 (2004) 657-674
55. Hifi M., and M'Hallah R. Approximate algorithms for constrained circular cutting problems. Computers & Operations Research 31 (2004) 675-694
56. Hifi M., and Ouafi R. A best-first branch-and-bound algorithm for orthogonal rectangular packing problems. International Transactions in Operational Research 5 (1998) 345-356
57. Hodgson T.J. A combined approach to the pallet loading problem. IIE Transactions 14 (1982) 175-182
58. Hopper E., and Turton B.C.H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128 (2001) 34-57
59. Hopper E., and Turton B.C.H. A review of the application of meta-heuristic algorithms to 2D strip packing problems. Artificial Intelligence Review 16 (2001) 257-300
60. Isermann H. Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. OR Spektrum 13 (1991) 213-223
61. Jacobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research 88 (1996) 165-181
62. Kang J., and Park S. Algorithms for the variable sized bin packing problem. European Journal of Operational Research 147 (2003) 365-372
63. Katagiri H., Ishii H., and Sakawa M. On fuzzy random linear knapsack problems. Central European Journal of Operations Research 12 (2004) 59-70
64. Kos L., and Duhovnik J. Cutting optimization with variable-sized stock and inventory status data. International Journal of Production Research 40 (2002) 2289-2301
65. Kröger B. Guillotineable bin packing: A genetic approach. European Journal of Operational Research 84 (1995) 645-661
66. Labbé M., Laporte G., and Martello S. Upper bounds and algorithms for the maximum cardinality bin packing problem. European Journal of Operational Research 149 (2003) 490-498
67. Li Z., and Milenkovic V. Compaction and separation algorithms for non-convex polygons and their applications. European Journal of Operational Research 84 (1995) 539-561
68. Lins L., Lins S., and Morabito R. An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container. European Journal of Operational Research 141 (2002) 421-439
69. Lodi A., Martello S., and Vigo D. Approximation algorithms for the oriented two-dimensional bin packing problem. European Journal of Operational Research 112 (1999) 158-166
70. Lodi A., Martello S., and Monaci M. Two-dimensional packing problems: A survey. European Journal of Operational Research 141 (2002) 241-252
71. Lodi A., Martello S., and Vigo D. Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123 (2002) 379-396
72. Lodi A., Martello S., and Vigo D. Heuristic algorithms for the three-dimensional bin packing problem. European Journal of Operational Research 141 (2002) 410-420
73. Lodi A., Martello S., and Vigo D. Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization 8 (2004) 363-379
74. Lorie J.H., and Savage L.J. Three problems in rationing capital. Journal of Business 28 (1955) 229-239
75. Martello S., and Toth P. Knapsack Problems - Algorithms and Computer Implementations (1990), John Wiley & Sons, Chichester
76. Martello S., and Vigo D. Exact solution of the two-dimensional finite bin packing problem. Management Science 44 (1998) 388-399
77. Martello S., Pisinger D., and Toth P. New trends in exact algorithms for the 0-1 knapsack problem. European Journal of Operational Research 123 (2000) 325-332
78. Martello S., Monaci M., and Vigo D. An exact approach to the strip-packing problem. INFORMS Journal on Computing 15 (2003) 310-319
79. Milenkovic V.J., and Daniels K. Translational polygon containment and minimal enclosure using mathematical programming. International Transactions in Operational Research 6 (1999) 525-554
80. Miyazawa F.K., and Wakabayashi Y. An algorithm for the three-dimensional packing problem with asymptotic performance analysis. Algorithmica 18 (1997) 122-144
81. Miyazawa F.K., and Wakabayashi Y. Cube packing. Theoretical Computer Science 297 (2003) 355-366
82. Morabito R., and Arenales M.N. Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach. European Journal of Operational Research 94 (1996) 548-560
83. Morabito R., and Morales S. A simple and effective recursive procedure for the manufacturer's pallet loading problem. Journal of the Operational Research Society 49 (1998) 819-828
84. Nonås S.L., and Thorstenson A. A combined cutting-stock and lot-sizing problem. European Journal of Operational Research 120 (2000) 327-342
85. Oliveira J.F., and Ferreira J.S. Algorithms for nesting problems. In: Vidal R.V.V. (Ed). Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems vol. 396 (1993), Springer, Berlin et al 255-273
86. Oliveira J.F., Gomes A.M., and Ferreira J.S. TOPOS - A new constructive algorithm for nesting problems. OR Spektrum 22 (2000) 263-284
87. Pisinger D. An exact algorithm for large multiple knapsack problems. European Journal of Operational Research 114 (1999) 528-541
88. Pisinger D. Heuristics for the container loading problem. European Journal of Operational Research 141 (2002) 382-392
89. Raidl G.R., and Kodydek G. Genetic algorithms for the multiple container packing problem. In: Eiben A.E., Bäck T., Schoenauer M., and Schwefel H.-P. (Eds). Parallel Problem Solving from Nature. Lecture Notes in Computer Science vol. 1498 (1998), Springer, Berlin 875-884
90. Rao M.R. On the cutting stock problem. Journal of the Computer Society of India 7 (1976) 35-39
91. Ratcliff M.S.W., and Bischoff E.E. Allowing for weight considerations in container loading. OR Spektrum 20 (1998) 65-71
92. Riehme J., Scheithauer G., and Terno J. The solution of two-stage guillotine cutting stock problems having extremely varying order demands. European Journal of Operational Research 91 (1996) 543-552
93. Scheithauer G. A three-dimensional bin packing algorithm. Journal of Information Processing and Cybernetics 27 (1991) 263-271
94. Scheithauer G. LP-based bounds for the container and multi-container loading problem. International Transactions in Operational Research 6 (1999) 199-213
95. Scheithauer G., and Sommerweiß U. 4-Block heuristic for the rectangle packing problem. European Journal of Operational Research 108 (1998) 509-526
96. Schilling K.E. The growth of m-constraint random knapsacks. European Journal of Operational Research 46 (1990) 109-112
97. Scholl A. Balancing and Sequencing of Assembly Lines. 2nd ed. (1995), Physica, Heidelberg
98. Scholl A., Klein R., and Jürgens C. BISON: A fast hybris procedure for exactly solving the one-dimensional bin packing problem. Computers & Operations Research 24 (1997) 627-645
99. Schwerin P., and Wäscher G. The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP. International Transactions in Operational Research 4 (1997) 377-389
100. Smith A., and de Cani P. An algorithm to optimize the layout of boxes in pallets. Journal of the Operational Research Society 31 (1980) 573-578
101. Steudel H.J. Generating pallet loading patterns: A special case of the two-dimensional cutting stock problem. Management Science 25 (1979) 997-1004
102. Stoyan Y.G., and Patsuk V.N. A method of optimal lattice packing of congruent oriented polygons in the plane. European Journal of Operational Research 124 (2000) 204-216
103. Stoyan Y.G., and Yaskov G.N. Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints. International Transactions in Operational Research 5 (1998) 45-57
104. Talbot F.B., Patterson J.H., and Gehrlein W.V. A comparative evaluation of heuristic balancing techniques. Management Science 32 (1986) 430-454
105. Tarasova T.D., Rozanova L.F., and Gabitov V.A. Integer models of rectangular guillotine cutting. In: Kashaeva Z.G. (Ed). Decision Making Under Conditions of Uncertainty (Cutting-Packing Problems) (1997), Ufa State Aviation Technical University, Ufa 125-139
106. Terno J., Scheithauer G., Sommerweiß U., and Riehme J. An efficient approach for the multi-pallet loading problem. European Journal of Operational Research 123 (2000) 372-381
107. Thiel J., and Voss S. Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms. INFOR 32 (1994) 226-242
108. Vance P.H., Barnhart C., Johnson E.L., and Nemhauser G.L. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 3 (1994) 111-130
109. Vanderbeck F. Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem. Operations Research 48 (2000) 915-926
110. Vanderbeck F. A nested decomposition approach to a three-stage, two-dimensional cutting-stock problem. Management Science 47 (2001) 864-879
111. Wang P.Y. Two algorithms for constrained two-dimensional cutting stock problems. Operations Research 31 (1983) 573-586
112. Wäscher G. An LP-based approach to cutting stock problems with multiple objectives. European Journal of Operational Research 44 (1990) 175-184
113. Wäscher G., and Gau T. Heuristics for the integer one-dimensional cutting stock problem: A computational study. OR Spektrum 18 (1996) 131-144
114. Yanasse H.H. On a pattern sequencing problem to minimize the maximum number of open stacks. European Journal of Operational Research 100 (1997) 454-463
115. Yuen B.J. Improved heuristics for sequencing cutting patterns. European Journal of Operational Research 87 (1995) 57-64
116. Yuen B.J., and Richardson K.V. Establishing the optimality of sequencing heuristics for cutting stock problems. European Journal of Operational Research 84 (1995) 590-598