On-Line Algorithms for Cardinality Constrained Bin Packing Problems

  • Authors:

  • Luitpold Babel;Bo Chen;Hans Kellerer;Vladimir Kotov

  • Affiliations:

  • -;-;-;-

  • Venue:
  • ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The bin packing problem asks for a packing of a list of items from [0, 1] into the smallest possible number of bins having unit capacity. The k-item bin packing problem additionally imposes the constraint that at most k items are allowed in one bin. We present two efficient approximation algorithms for the on-line version of this problem. We show that, for increasing values of k, the asymptotic worst-case performance ratio of the first algorithm tends towards 2 and that the second algorithm has an asymptotic worst-case performance ratio of 2. Both heuristics considerably improve upon the best known result 2.7 of Krause, Shen and Schwetman. Moreover, we present algorithms for k = 2 and k = 3, where the result for k = 2 is best possible.