Journal of Combinatorial Optimization

, Volume 27, Issue 1, pp 115–131

On-line bin packing with restricted repacking

  • János Balogh
  • József Békési
  • Gábor Galambos
  • Gerhard Reinelt
Article

DOI: 10.1007/s10878-012-9489-4

Cite this article as:
Balogh, J., Békési, J., Galambos, G. et al. J Comb Optim (2014) 27: 115. doi:10.1007/s10878-012-9489-4

Abstract

Semi-on-line algorithms for the bin-packing problem allow, in contrast to pure on-line algorithms, the use of certain types of additional operations for each step. Examples include repacking, reordering or lookahead before packing the items. Here we define and analyze a semi-on-line algorithm where for each step at most k items can be repacked, for some positive integer k. We prove that the upper bound for the asymptotic competitive ratio of the algorithm is a decreasing function of k, which tends to 3/2 as k goes to infinity. We also establish lower bounds for this ratio and show that the gap between upper and lower bounds is relatively small.

Keywords

Bin-packing Semi-on-line algorithm Worst-case behavior Competitive analysis 

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • János Balogh
    • 1
  • József Békési
    • 1
  • Gábor Galambos
    • 1
  • Gerhard Reinelt
    • 2
  1. 1.Department of Applied Informatics, Gyula Juhász Faculty of EducationUniversity of SzegedSzegedHungary
  2. 2.Institute of Computer ScienceUniversity of HeidelbergHeidelbergGermany