Deshi Ye ; Guochuan Zhang - On-line extensible bin packing with unequal bin sizes

dmtcs:472 - Discrete Mathematics & Theoretical Computer Science, January 1, 2009, Vol. 11 no. 1 - https://doi.org/10.46298/dmtcs.472
On-line extensible bin packing with unequal bin sizesArticle

Authors: Deshi Ye 1; Guochuan Zhang ORCID1

  • 1 College of Computer Science [Hangzhou]

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 give the complete analysis on a list scheduling algorithm (LS). Namely we present tight bounds of LS for every collection of original bin sizes and every number of bins. We further show better on-line algorithms for the two-bin case and the three-bin case. Interestingly, it is proved that the on-line algorithms have better competitive ratios for unequal bins than for equal bins. Some variants of the problem are also discussed.


Volume: Vol. 11 no. 1
Section: Analysis of Algorithms
Published on: January 1, 2009
Imported on: March 26, 2015
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Consultation statistics

This page has been seen 396 times.
This article's PDF has been downloaded 296 times.