Semi-Online Preemptive Scheduling: One Algorithm for All Variants

Abstract : We present a unified optimal semi-online algorithm for preemptive schedul- ing on uniformly related machines with the objective to minimize the makespan. This algorithm works for all types of semi-online restrictions, including the ones studied before, like sorted (decreasing) jobs, known sum of processing times, known maximal processing time, their combinations, and so on. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation ratios for a small number of machines.
Type de document :
Communication dans un congrès
Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.349-360, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00359630
Contributeur : Publications Loria <>
Soumis le : lundi 9 février 2009 - 09:16:10
Dernière modification le : vendredi 13 février 2009 - 10:44:51
Document(s) archivé(s) le : mardi 8 juin 2010 - 20:29:24

Fichier

29-ebenlendr.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00359630, version 1

Collections

Citation

Tomas Ebenlendr, Jiri Sgall. Semi-Online Preemptive Scheduling: One Algorithm for All Variants. Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.349-360, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00359630〉

Partager

Métriques

Consultations de la notice

50

Téléchargements de fichiers

123