An Exact Algorithm for Higher-Dimensional Orthogonal Packing

Sándor P. Fekete (), Jörg Schepers () and Jan C. van der Veen ()
Additional contact information
Sándor P. Fekete: Department of Mathematical Optimization, Braunschweig University of Technology, D--38106 Braunschweig, Germany
Jörg Schepers: IBM Germany, Gustav-Heinemann-Ufer 120/122, D--50968 Köln, Germany
Jan C. van der Veen: Department of Mathematical Optimization, Braunschweig University of Technology, D--38106 Braunschweig, Germany

Operations Research, 2007, vol. 55, issue 3, 569-587

Abstract: Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing feasible packings with our new classes of lower bounds, and other heuristics, we develop a two-level tree search algorithm for solving higher-dimensional packing problems to optimality. Computational results are reported, including optimal solutions for all two-dimensional test problems from recent literature.This is the third in a series of articles describing new approaches to higher-dimensional packing.

Keywords: production; scheduling; cutting stock; trim (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (40)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1060.0369 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:55:y:2007:i:3:p:569-587

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().