On-line extensible bin packing with unequal bin sizes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2009

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 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.
Fichier principal
Vignette du fichier
623-4158-1-PB.pdf (130.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00988178 , version 1 (07-05-2014)

Identifiers

Cite

Deshi Ye, Guochuan Zhang. On-line extensible bin packing with unequal bin sizes. Discrete Mathematics and Theoretical Computer Science, 2009, Vol. 11 no. 1 (1), pp.141--152. ⟨10.46298/dmtcs.472⟩. ⟨hal-00988178⟩

Collections

TDS-MACS
71 View
799 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More