Journal of Combinatorial Optimization

, Volume 34, Issue 3, pp 810–828 | Cite as

A two-phase algorithm for bin stretching with stretching factor 1.5

  • Martin Böhm
  • Jiří Sgall
  • Rob van Stee
  • Pavel Veselý


Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin.We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We build on previous algorithms and use a two-phase approach. However, our analysis is technically more complicated and uses amortization over the bins with the help of two weight functions.


Online algorithms Bin packing Scheduling 



The authors thank Emese Bittner for useful discussions during her visit to Charles University. We also thank to referees for many useful comments.


  1. Albers S, Hellwig M (2012) Semi-online scheduling revisited. Theor Comput Sci 443:1–9MathSciNetCrossRefzbMATHGoogle Scholar
  2. Aspnes J, Azar Y, Fiat A, Plotkin S, Waarts O (1997) On-line load balancing with applications to machine scheduling and virtual circuit routing. J ACM 44:486–504MathSciNetCrossRefzbMATHGoogle Scholar
  3. Azar Y, Regev O.(1998)On-line bin-stretching. In: Proceedings of randomization and approximation techniques in computer science (RANDOM). Springer, pp 71–81Google Scholar
  4. Azar Y, Regev O (2001) On-line bin-stretching. Theor Comput Sci 268(1):17–41MathSciNetCrossRefzbMATHGoogle Scholar
  5. Berman P, Charikar M, Karpinski M (2000) On-line load balancing for related machines. J Algorithms 35:108–121MathSciNetCrossRefzbMATHGoogle Scholar
  6. Böhm M, Sgall J, van Stee R, Veselý P (2015) Better algorithms for online bin stretching. In: Proceedings of the 12th workshop on approximation and online algorithms (WAOA 2014), Lecture Notes in Computer Science 8952. Springer, pp 23–34Google Scholar
  7. Böhm M, Sgall J, van Stee R, Veselý P (2016) Online bin stretching with three bins. arXiv preprint arXiv:1404.5569v3
  8. Coffman E Jr, Csirik J, Galambos G, Martello S, Vigo D (2013) Bin packing approximation algorithms: survey and classification. In: Pardalos PM, Du DZ, Graham RL (eds) Handbook of combinatorial optimization. Springer, New York, pp 455–531CrossRefGoogle Scholar
  9. Ebenlendr T, Jawor W, Sgall J (2009) Preemptive online scheduling: optimal algorithms for all speeds. Algorithmica 53:504–522MathSciNetCrossRefzbMATHGoogle Scholar
  10. Gabay M, Brauner N, Kotov V (2013) Computing lower bounds for semi-online optimization problems: application to the bin stretching problem. HAL preprint hal-00921663, version 2Google Scholar
  11. Gabay M, Brauner N, Kotov V (2015) Improved lower bounds for the online bin stretching problem. HAL preprint hal-00921663, version 3Google Scholar
  12. Gabay M, Kotov V, Brauner N (2013) Semi-online bin stretching with bunch techniques. HAL preprint hal-00869858Google Scholar
  13. Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:263–269MathSciNetzbMATHGoogle Scholar
  14. Johnson D (1973) Near-optimal bin packing algorithms. Massachusetts Institute of Technology Technical Report MAC TR-109, Project MAC, Cambridge, MassachusettsGoogle Scholar
  15. Kellerer H, Kotov V (2013) An efficient algorithm for bin stretching. Oper Res Lett 41(4):343–346MathSciNetCrossRefzbMATHGoogle Scholar
  16. Kellerer H, Kotov V, Speranza MG, Tuza Z (1997) Semi on-line algorithms for the partition problem. Oper Res Lett 21:235–242MathSciNetCrossRefzbMATHGoogle Scholar
  17. Pruhs K, Sgall J, Torng E (2004) Online scheduling. In: Leung JY-T (ed) Handbook of scheduling: algorithms, models, and performance analysis, chapter 15. CRC Press, Boca Raton, pp 15-1–15-41Google Scholar
  18. Ullman J (1971) The performance of a memory allocation algorithm. Technical Report 100Google Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  • Martin Böhm
    • 1
  • Jiří Sgall
    • 1
  • Rob van Stee
    • 2
  • Pavel Veselý
    • 1
  1. 1.Computer Science Institute of Charles UniversityPragueCzech Republic
  2. 2.Department of Computer ScienceUniversity of LeicesterLeicesterUK

Personalised recommendations