Analysis of upper bounds for the Pallet Loading Problem

European Journal of Operational Research

Volumn 132, Issue 3, 2001, Pages 582-593

  Letchford, Adam N ^a   Amaral, André ^b  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b FEDERAL UNIVERSITY OF ESPÍRITO SANTO   (Brazil)

Author keywords

Mathematical programming; Packing; Pallet loading

Indexed keywords

LINEAR PROGRAMMING; LOADING; PACKING; PALLETS; PROBLEM SOLVING; RELAXATION PROCESSES; SCHEDULING; STRATEGIC PLANNING;

NELISSEN THEORY; PALLET LOADING PROBLEM (PLP);

OPERATIONS RESEARCH;

EID: 0035427778     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00163-6     Document Type: Article

References (22)

1. F.W. Barnes Packing the maximum number of m × n tiles in a large p × q rectangle Discrete Mathematics 26 1979 93 100
2. S. Barnett G. Kynch Exact solution of a simple cutting problem Operations Research 15 1967 1051 1056
3. J.E. Beasley An exact two-dimensional non-guillotine-cutting tree search procedure Operations Research 33 1985 49 64
4. E. Bischoff W.B. Dowsland An application of the micro to product design and distribution Journal of the Operational Research Society 33 1982 271 281
5. H. Carpenter W.B. Dowsland Practical considerations of the pallet loading problem Journal of the Operational Research Society 36 1985 489 497
6. K.A. Dowsland The three-dimensional pallet chart: An analysis of the factors affecting the set of feasible layouts for a class two-dimensional packing problems Journal of the Operational Research Society 35 1984 895 905
7. Dowsland, K.A., 1985a. Graph theory and OR – an exact solution for the pallet loading problem, Ph.D. Thesis, University of Swansea, UK
8. K.A. Dowsland Determining an upper bound for a class of rectangular packing problems Computers and Operations Research 12 1985 201 205
9. K.A. Dowsland An exact algorithm for the pallet loading problem European Journal of Operational Research 31 1987 78 84
10. H. Dyckhoff A typology of cutting and packing problems European Journal of Operational Research 44 1990 145 160
11. H. Exeler Upper bounds for the homogeneous case of a two-dimensional packing problem Zeitschrift für Operations Research 35 1991 45 58
12. D.R. Fulkerson O.A. Gross Incidence matrices and interval graphs Pacific Journal of Mathematics 15 1965 835 855
13. P.C. Gilmore R.W. Gomory A linear programming approach to the cutting stock problem Operations Research 9 1961 849 859
14. P.C. Gilmore R.W. Gomory A linear programming approach to the cutting stock problem. Part II Operations Research 11 1963 863 888
15. E. Hadjiconstantinou N. Christofides An exact algorithm for general, orthogonal, two-dimensional knapsack problems European Journal of Operational Research 83 1995 39 56
16. D.S. Hirschberg C.K. Wong A polynomial-time algorithm for the knapsack problem with two variables Journal of the Association for Computing Machinery 23 1976 147 154
17. H. Isermann Ein Planungssytem zur Optimierung der Palettenbeladung mit kongruenten rechteckigen Versandgebinden OR Spectrum 9 1987 235 249
18. O. Marcotte An instance of the cutting stock problem for which the integer rounding property does not hold Operations Research Letters 4 1986 239 243
19. R. Morabito S. Morales A simple and effective heuristic to solve the manufacturer's pallet loading problem Journal of the Operational Research Society 49 1998 819 828
20. Naujoks, G., 1989. Neue heuristiken und strukturanalysen zumzweidimensionalen homogen packproblem. Operations Research Proceedings. Springer, Berlin, 1990
21. Nelissen, J., 1993. New approaches to the pallet loading problem. Working Paper, RWTH Aachen (available via anonymous ftp fromftp.informatik.rwth-aachen.de (137.226.225.3) as/pub/reports/others/pallets.ps.Z)
22. G. Scheithauer J. Terno The G4-heuristic for the pallet loading problem Journal of the Operational Research Society 47 1996 511 522