The pallet packing problem for non-uniform box sizes

DOI10.1080/00207549108948061zbMath0729.90571OpenAlexW2063335739MaRDI QIDQ3354581

No author found.

Publication date: 1991

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549108948061

Mathematics Subject Classification ID

Mixed integer programming (90C11) Production models (90B30)

Related Items (5)

A three-dimensional bin-packing model: exact multicriteria solution and computational complexity ⋮ Loading plates with non-identical items ⋮ An analytical model for the container loading problem ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Efficient approaches for furnace loading of cylindrical parts

Cites Work

• Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
• The trim-loss and assortment problems: A survey
• An exact algorithm for the pallet loading problem
• Efficient automated pallet loading
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Generating Pallet Loading Patterns: A Special Case of the Two-Dimensional Cutting Stock Problem
• An Algorithm for Two-Dimensional Cutting Problems
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• Recursive Computational Procedure for Two-dimensional Stock Cutting

This page was built for publication: The pallet packing problem for non-uniform box sizes