The pallet packing problem for non-uniform box sizes
- 1 October 1991
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 29 (10) , 1963-1968
- https://doi.org/10.1080/00207549108948061
Abstract
We consider an important problem in the design of material handling systems in a flexible manufacturing environment; that of robotic palletization when the boxes to be palletized are of varying dimensions. The problem is formulated as a zero-one integer programming problem. The mathematical model includes the issue of multiple pallets and the orientation of boxes on the pallet. An illustrative problem is solved.Keywords
This publication has 18 references indexed in Scilit:
- Efficient automated pallet loadingEuropean Journal of Operational Research, 1990
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problemsOR Spectrum, 1988
- An exact algorithm for the pallet loading problemEuropean Journal of Operational Research, 1987
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search ProcedureOperations Research, 1985
- A Combined Approach to the Pallet Loading ProblemIIE Transactions, 1982
- The trim-loss and assortment problems: A surveyEuropean Journal of Operational Research, 1980
- An Algorithm for Two-Dimensional Cutting ProblemsOperations Research, 1977
- Recursive Computational Procedure for Two-dimensional Stock CuttingIBM Journal of Research and Development, 1972
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966
- Multistage Cutting Stock Problems of Two and More DimensionsOperations Research, 1965