Online bin stretching with bunch techniques - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2015

Online bin stretching with bunch techniques

Résumé

We are given a sequence of items that can be packed into m unit size bins and the goal is to assign these items online to m bins while minimizing the stretching factor. Bins have infinite capacities and the stretching factor is the size of the largest bin. We present an algorithm with stretching factor 26/17≈1.529426/17≈1.5294 improving the best known algorithm by Kellerer and Kotov (2013) with a stretching factor 11/7≈1.571411/7≈1.5714. Our algorithm has 2 stages and uses bunch techniques: we aggregate bins into batches sharing a common purpose.
Fichier principal
Vignette du fichier
bin_stretching.pdf (276.59 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00869858 , version 1 (04-10-2013)
hal-00869858 , version 2 (07-10-2013)
hal-00869858 , version 3 (12-09-2015)

Identifiants

Citer

Michaël Gabay, Vladimir Kotov, Nadia Brauner. Online bin stretching with bunch techniques. Theoretical Computer Science, 2015, 602, pp.103 - 113. ⟨10.1016/j.tcs.2015.07.065⟩. ⟨hal-00869858v3⟩
251 Consultations
264 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More