On-line extensible bin packing with unequal bin sizes

Abstract

In the extensible bin packing problem we are asked to pack a set of items into a given number of bins, each with an original size. However, the original bin sizes can be extended if necessary. The goal is to minimize the total size of the bins. We consider the problem with unequal (original) bin sizes and present the tight bound of a list scheduling algorithm for each collection of original bin sizes and each number of bins. We further give better on-line algorithms for the two-bin case and the three-bin case. Interestingly, it is shown that the on-line algorithms have better competitive ratios for unequal bins than for equal bins. Some variants of the problem are also discussed.