A new constraint programming approach for the orthogonal packing problem

A new constraint programming approach for the orthogonal packing problem

0.00 Avg rating0 Votes
Article ID: iaor20091157
Country: United Kingdom
Volume: 35
Issue: 3
Start Page Number: 944
End Page Number: 959
Publication Date: Mar 2008
Journal: Computers and Operations Research
Authors: , , ,
Keywords: scheduling, programming: constraints
Abstract:

The two-dimensional orthogonal packing problem (2OPP) consists in determining if a set of rectangles can be packed in a larger rectangle of fixed size. We propose an exact method for 2OPP, based on a new constraint-based scheduling model. We provide a generalization of energetic reasoning techniques for the problem under investigation. Feasibility tests requiring the solution of subset-sum problems are described. Computational results confirm the efficiency of our method compared to others in the literature.

Reviews

Required fields are marked *. Your email address will not be published.