The two-dimensional finite bin packing problem. Part II: New lower and upper bounds

The two-dimensional finite bin packing problem. Part II: New lower and upper bounds

0.00 Avg rating0 Votes
Article ID: iaor2005961
Country: Germany
Volume: 1
Issue: 2
Start Page Number: 135
End Page Number: 147
Publication Date: Jan 2003
Journal: 4OR
Authors: ,
Keywords: bin packing
Abstract:

This paper is the second of a two part series and describes new lower and upper bounds for a more general version of the Two-Dimensional Finite Bin Packing Problem (2BP) than the one considered in Part I. With each item is associated an input parameter specifying if it has a fixed orientation or it can be rotated by 90°. This problem contains as special cases the oriented and non-oriented 2BP. The new lower bound is based on the one described in Part I for the oriented 2BP. The computational results on the test problems derived from the literature show the effectiveness of the new proposed lower and upper bounds.

Reviews

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