A new upper bound 2.5545 on 2D Online Bin Packing

The 2D Online Bin Packing is a fundamental problem in Computer Science and the determination of its asymptotic competitive ratio has research attention. In a long series of papers, the lower bound of this ratio has been improved from 1.808, 1.856 to 1.907 and its upper bound reduced from 3.25, 3.0625, 2.8596, 2.7834 to 2.66013. In this article, we rewrite the upper bound record to 2.5545. Our idea for the improvement is as follows. In 2002, Seiden and van Stee [Seiden and van Stee 2003] proposed an elegant algorithm called H ⊗ C, comprised of the Harmonic algorithm H and the Improved Harmonic algorithm C, for the two-dimensional online bin packing problem and proved that the algorithm has an asymptotic competitive ratio of at most 2.66013. Since the best known online algorithm for one-dimensional bin packing is the Super Harmonic algorithm [Seiden 2002], a natural question to ask is: could a better upper bound be achieved by using the Super Harmonic algorithm instead of the Improved Harmonic algorithm? However, as mentioned in Seiden and van Stee [2003], the previous analysis framework does not work. In this article, we give a positive answer for this question. A new upper bound of 2.5545 is obtained for 2-dimensional online bin packing. The main idea is to develop new weighting functions for the Super Harmonic algorithm and propose new techniques to bound the total weight in a rectangular bin.

[1]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[2]  Leah Epstein,et al.  Optimal Online Algorithms for Multidimensional Packing Problems , 2005, SIAM J. Comput..

[3]  D. T. Lee,et al.  A simple on-line bin-packing algorithm , 1985, JACM.

[4]  D. T. Lee,et al.  On-Line Bin Packing in Linear Time , 1989, J. Algorithms.

[5]  Leah Epstein,et al.  Online square and cube packing , 2005, Acta Informatica.

[6]  D. S. Johnson,et al.  On Packing Two-Dimensional Bins , 1982 .

[7]  Yoshiko Wakabayashi,et al.  Cube Packing , 2000, LATIN.

[8]  Frank M. Liang.  A Lower Bound for On-Line Bin Packing , 1980, Inf. Process. Lett..

[9]  Takahiro Yamaguchi,et al.  Simplified Formulation: The Software Reliability Growth Model for Procedure-Based and Object-Oriented Programming , 1993 .

[10]  Brian D. Bunday.  Analysis of the SCAN Service Polling Model , 1991, Acta Cybern..

[11]  J. B. G. Frenk,et al.  Two-Dimensional Rectangle Packing: On-Line Methods and Results , 1993, Discret. Appl. Math..

[12]  Gábor Galambos.  A 1.6 Lower-Bound for the Two-Dimensional On-Line Rectangle Bin-Packing , 1991, Acta Cybern..

[13]  János Csirik,et al.  An on-line algorithm for multidimensional bin packing , 1993, Oper. Res. Lett..

[14]  Donna J. Brown,et al.  A Lower Bound for On-Line One-Dimensional Bin Packing Algorithms. , 1979 .

[15]  Steven S. Seiden,et al.  On the online bin packing problem , 2001, JACM.

[16]  Alberto Caprara,et al.  A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing , 2009, SIAM J. Comput..

[17]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[18]  Leah Epstein,et al.  Optimal online bounded space multidimensional packing , 2004, SODA '04.

[19]  Yong Zhou,et al.  Improved Online Hypercube Packing , 2006, WAOA.

[20]  Prabhakar Raghavan,et al.  Multidimensional on-line bin packing: Algorithms and worst-case analysis , 1989 .

[21]  Rob van Stee,et al.  New Bounds for Multidimensional Packing , 2003, Algorithmica.

[22]  Yoshiko Wakabayashi,et al.  Cube packing , 2003, Theor. Comput. Sci..

[23]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[24]  Gábor Galambos,et al.  Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms , 2005, Computing.

[25]  Alberto Caprara,et al.  Packing 2-dimensional bins in harmony , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[26]  José R. Correa,et al.  Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes , 2006, Math. Oper. Res..

[27]  André van Vliet,et al.  An Improved Lower Bound for On-Line Bin Packing Algorithms , 1992, Inf. Process. Lett..

[28]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .