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 (see Boschetti and Mingozzi 2002). With each item is associated an input parameter specifying if it has a fixed orientation or it can be rotated by \(90^{\circ}\). 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Boschetti, M.A., Mingozzi, A. The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. 4OR 1, 135–147 (2003). https://doi.org/10.1007/s10288-002-0006-y
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s10288-002-0006-y