Probabilistic Analysis of Online (Class-Constrained) Bin Packing and Bin Covering

  • Carsten FischerEmail author
  • Heiko Röglin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10807)


We study online algorithms for bin packing and bin covering in two different probabilistic settings in which the item sizes are drawn randomly or the items are adversarial but arrive in random order. We prove several results on the expected performance of well-known online algorithms in these settings. In particular, we prove that the simple greedy algorithm Dual Next-Fit for bin covering performs in the random-order setting strictly better than in the worst case, proving a conjecture by Christ et al. (Theoret Comput Sci 556:71–84, 2014).

Additionally we also study class-constrained bin packing and bin covering. In these problems, each item has not only a size but also a color and there are constraints on the number of different colors in each bin. These problems have been studied before in the classical worst-case model and we provide the first probabilistic analysis of these problems. We prove for several simple online algorithms bounds on their expected performance in the two probabilistic models discussed above. We observe that in the case of class constrained bin packing for several algorithms their performance differs with respect to the two probabilistic performance measures.


  1. 1.
    Babel, L., Chen, B., Kellerer, H., Kotov, V.: Algorithms for on-line bin-packing problems with cardinality constraints. Discrete Appl. Math. 143, 238–251 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: Lower bounds for several online variants of bin packing. CoRR, abs/1708.03228 (2017)Google Scholar
  3. 3.
    Balogh, J., Békési, J., Dósa, G., Epstein, L., Levin, A.: Online bin packing with cardinality constraints resolved. In: Proceedings of the 25th European Symposium on Algorithms (ESA), vol. 87, pp. 10:1–10:14 (2017)Google Scholar
  4. 4.
    Christ, M.G., Favrholdt, L.M., Larsen, K.S.: Online bin covering: expectations vs. guarantees. Theoret. Comput. Sci. 556, 71–84 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Dósa, G., Sgall, J.: Optimal analysis of best fit bin packing. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 429–441. Springer, Heidelberg (2014). Google Scholar
  6. 6.
    Epstein, L., Imreh, C., Levin, A.: Class constrained bin covering. Theory Comput. Syst. 46(2), 246–260 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Epstein, L., Imreh, C., Levin, A.: Class constrained bin packing revisited. Theoret. Comput. Sci. 411(34–36), 3073–3089 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Fischer, C., Röglin, H.: Probabilistic analysis of the dual next-fit algorithm for bin covering. In: Kranakis, E., Navarro, G., Chávez, E. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 469–482. Springer, Heidelberg (2016). CrossRefGoogle Scholar
  9. 9.
    Coffman Jr., E.G., Csirik, J., Rónyai, L., Zsbán, A.: Random-order bin packing. Discrete Appl. Math. 156(14), 2810–2816 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Kenyon, C.: Best-fit bin-packing with random order. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 359–364 (1996)Google Scholar
  11. 11.
    Krause, K.L., Shen, V., Schwetman, H.D.: Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J. ACM 22(4), 522–550 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. J. ACM 32(3), 562–572 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Shachnai, H., Tamir, T.: Polynomial time approximation schemes for class-constrained packing problems. J. Sched. 4(6), 313–338 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Shachnai, H., Tamir, T.: Tight bounds for online class-constrained packing. Theoret. Comput. Sci. 321(1), 103–123 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Ullman, J.D.: The Performance of a Memory Allocation Algorithm. Technical report 100 (Princeton University, Department of Electrical Engineering, Computer Sciences Laboratory). Princeton University (1971)Google Scholar
  16. 16.
    Xavier, E.C., Miyazawa, F.K.: The class constrained bin packing problem with applications to video-on-demand. Theoret. Comput. Sci. 393(1–3), 240–259 (2008)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of BonnBonnGermany

Personalised recommendations