A I I E Transactions · 1982 · 96 citations · 13 references
Natural SciencesDecision SciencesOperations ManagementOptimizationCombinatorial OptimizationLoad AnalysisLoad BalancingLoad CalculationCombined LoadingLoad OptimizationPalletization
Abstract In this paper the two-dimensional pallet loading problem is considered: that is, the problem of loading a rectangular pallet of size L by W, drawing from a set of n rectangular boxes. The objective is to maximize the area covered on the pallet by the boxes loaded. The problem is approached using a combination of dynamic programming and heuristics. The structured solutions resulting from the application of the dynamic program have two serendipitous characteristics: any item may be placed on the periphery of the pallet for easy access, and some control may be retained over the center of gravity of the pallet. Computational results are given.
13
Orthogonal Packings in Two Dimensions
Brenda S. Baker, E. G. Coffman, Ronald L. Rivest · SIAM Journal on Computing · 1980 · 695 citations
The Theory and Computation of Knapsack Functions
Paul C. Gilmore, Ralph E. Gomory · Operations Research · 1966 · 607 citations
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
E. G. Coffman, M. R. Garey, David S. Johnson et al. · SIAM Journal on Computing · 1980 · 478 citations
Introduction to dynamic programming
R. Larson · IEEE Transactions on Automatic Control · 1967 · 311 citations