Document Open Access Logo

Beating the Harmonic Lower Bound for Online Bin Packing

Authors Sandy Heydrich, Rob van Stee

Thumbnail PDF


  • Filesize: 0.61 MB
  • 14 pages

Document Identifiers

Author Details

Sandy Heydrich
Rob van Stee

Cite AsGet BibTex

Sandy Heydrich and Rob van Stee. Beating the Harmonic Lower Bound for Online Bin Packing. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 41:1-41:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


In the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. Harmonic++ achieves a competitive ratio of 1.58889 and belongs to the Super Harmonic framework [Seiden, J. ACM, 2002]; a lower bound of Ramanan et al. shows that within this framework, no competitive ratio below 1.58333 can be achieved [Ramanan et al., J. Algorithms, 1989]. In this paper, we present an online bin packing algorithm with asymptotic performance ratio of 1.5815, which constitutes the first improvement in fifteen years and reduces the gap to the lower bound by roughly 15%. We make two crucial changes to the Super Harmonic framework. First, some of the decisions of the algorithm will depend on exact sizes of items, instead of only their types. In particular, for item pairs where the size of one item is in (1/3,1/2] and the other is larger than 1/2 (a large item), when deciding whether to pack such a pair together in one bin, our algorithm does not consider their types, but only checks whether their total size is at most 1. Second, for items with sizes in (1/3,1/2] (medium items), we try to pack the larger items of every type in pairs, while combining the smallest items with large items whenever possible. To do this, we postpone the coloring of medium items (i.e., the decision which items to pack in pairs and which to pack alone) where possible, and later select the smallest ones to be reserved for combining with large items. Additionally, in case such large items arrive early, we pack medium items with them whenever possible. This is a highly unusual idea in the context of Harmonic-like algorithms, which initially seems to preclude analysis (the ratio of items combined with large items is no longer a fixed constant). For the analysis, we carefully mark medium items depending on how they end up packed, enabling us to add crucial constraints to the linear program used by Seiden. We consider the dual, eliminate all but one variable and then solve it with the ellipsoid method using a separation oracle. Our implementation uses additional algorithmic ideas to determine previously hand set parameters automatically and gives certificates for easy verification of the results. We give a lower bound of 1.5766 for algorithms like ours. This shows that fundamentally different ideas will be required to make further improvements
  • Bin packing
  • online algorithms
  • harmonic algorithm


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Luitpold Babel, Bo Chen, Hans Kellerer, and Vladimir Kotov. Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Applied Mathematics, 143(1-3):238-251, 2004. URL:
  2. János Balogh, József Békési, György Dósa, Jirí Sgall, and Rob van Stee. The optimal absolute ratio for online bin packing. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 1425-1438. SIAM, 2015. URL:
  3. János Balogh, József Békési, and Gábor Galambos. New lower bounds for certain classes of bin packing algorithms. In Klaus Jansen and Roberto Solis-Oba, editors, Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers, volume 6534 of Lecture Notes in Computer Science, pages 25-36. Springer, 2010. URL:
  4. Donna J. Brown. A lower bound for on-line one-dimensional bin packing algorithms. Technical Report R-864, Coordinated Sci. Lab., Urbana, Illinois, 1979. Google Scholar
  5. Edward G. Coffman, Michael R. Garey, and David S. Johnson. Approximation algorithms for bin packing: A survey. In D. Hochbaum, editor, Approximation algorithms. PWS Publishing Company, 1997. Google Scholar
  6. Wenceslas Fernandez de la Vega and George S. Lueker. Bin packing can be solved within 1+ε in linear time. Combinatorica, 1:349-355, 1981. Google Scholar
  7. Michael R. Garey, Ronald L. Graham, and Jeffrey D. Ullman. Worst-case analysis of memory allocation algorithms. In Proceedings of the Fourth Annual ACM Symposium on Theory of Computing, pages 143-150. ACM, 1972. Google Scholar
  8. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the theory of of NP-Completeness. Freeman and Company, San Francisco, 1979. Google Scholar
  9. Michel X. Goemans and Thomas Rothvoß. Polynomiality for bin packing with a constant number of item types. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014, pages 830-839. SIAM, 2014. URL:
  10. David S. Johnson. Near-optimal bin packing algorithms. PhD thesis, MIT, Cambridge, MA, 1973. Google Scholar
  11. David S. Johnson. Fast algorithms for bin packing. Journal of Computer and System Sciences, 8:272-314, 1974. Google Scholar
  12. Narendra Karmarkar and Richard M. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pages 312-320, 1982. Google Scholar
  13. Chung-Chieh Lee and D. T. Lee. A simple online bin packing algorithm. Journal of the ACM, 32:562-572, 1985. Google Scholar
  14. Frank M. Liang. A lower bound for online bin packing. Information Processing Letters, 10:76-79, 1980. Google Scholar
  15. Prakash V. Ramanan, Donna J. Brown, Chung-Chieh Lee, and D. T. Lee. Online bin packing in linear time. Journal of Algorithms, 10:305-326, 1989. Google Scholar
  16. Michael B. Richey. Improved bounds for harmonic-based bin packing algorithms. Discrete Applied Mathematics, 34:203-227, 1991. Google Scholar
  17. Thomas Rothvoß. Approximating bin packing within o(log OPT * log log OPT) bins. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pages 20-29. IEEE Computer Society, 2013. URL:
  18. Steve S. Seiden. On the online bin packing problem. Journal of the ACM, 49(5):640-671, 2002. Google Scholar
  19. Jeffrey D. Ullman. The performance of a memory allocation algorithm. Technical Report 100, Princeton University, Princeton, NJ, 1971. Google Scholar
  20. André van Vliet. An improved lower bound for online bin packing algorithms. Information Processing Letters, 43:277-284, 1992. Google Scholar
  21. Andrew C. C. Yao. New algorithms for bin packing. Journal of the ACM, 27:207-227, 1980. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail