An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem
We present an asymptotic PTAS for Two-Dimensional Bin Packing, which requires packing (or cutting) a given set of rectangles from the minimum number of square bins, with the further restriction that cutting the rectangles from the bins can be done in two stages, as is frequently the case in real-world applications. To the best of our knowledge, this is the first approximation scheme for a nontrivial two-dimensional (and real-world) generalization of classical one-dimensional Bin Packing in which rectangles have to be packed in (finite) squares. A simplification of our method yields an asymptotic PTAS for the two-stage packing of rectangles in a bin of unit width and infinite height. Moreover, we point out that our method may lead to a better approximation guarantee for Two-Dimensional Bin Packing without stage restrictions, provided some structural property holds.
KeywordsApproximation Scheme Approximation Guarantee Strip Packing Consecutive Item Orthogonal Packing
Unable to display preview. Download preview PDF.
- 4.E.G. Coffman, Jr., M.R. Garey, and D.S. Johnson. Approximation algorithms for bin packing: A survey. In D.S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, 1997.Google Scholar
- 10.N. Karmarkar and R.M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In Proc. 23rd Annual IEEE Symp. Found. Comput. Sci., pages 312–320, 1982.Google Scholar
- 13.S.S. Seiden and R. van Stee. New bounds for multi-dimensional packing. In Proc. 13th Annual ACM-SIAM Symp. Discr. Alg. (SODA’02), 485–495, 2002.Google Scholar