On-line bin packing with restricted repacking
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.
KeywordsBin-packing Semi-on-line algorithm Worst-case behavior Competitive analysis
- Balogh J, Békési J (2012) Semi-on-line bin packing: a short overview and a new lower bound. Centr Eur J Oper Res. Submitted for publication Google Scholar
- Balogh J, Békési J, Galambos G (2011) New lower bounds for certain classes of bin packing algorithms. In: Proceedings of WAOA 2010 (8th workshop on approximation and online algorithms). LNCS, vol 6534, pp 25–36 Google Scholar
- Brown DJ (1979) A lower bound for on-line one-dimensional bin packing algorithms. Tech Rept R-864, Coordinated Science Laboratory, University of Illinois, Urbana, IL Google Scholar
- Galambos G (1985) A new heuristic for the classical bin packing problem. Tech Rept 82, Institut für Mathematik, Universität Augsburg Google Scholar
- Grove EF (1995) Online bin packing with lookahead, SODA, pp 430–436 Google Scholar