How good are SPT schedules for fair optimality criteria - Archive ouverte HAL Access content directly
Journal Articles Annals of Operations Research Year : 2008

How good are SPT schedules for fair optimality criteria

Abstract

We consider the following scheduling setting: a set of n tasks have to be executed on a set of m identical machines. It is well known that shortest processing time (SPT) schedules are optimal for the problem of minimizing the total sum of completion times of the tasks. In this paper, we measure the quality of SPT schedules, from an approximation point of view, with respect to the following optimality criteria: sum of completion times per machine, global fairness, and individual fairness.
Fichier principal
Vignette du fichier
abp6.pdf (281.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00341351 , version 1 (19-07-2009)

Identifiers

Cite

Eric Angel, Evripidis Bampis, Fanny Pascual. How good are SPT schedules for fair optimality criteria. Annals of Operations Research, 2008, 159 (1), pp.53--64. ⟨10.1007/s10479-007-0267-0⟩. ⟨hal-00341351⟩
316 View
166 Download

Altmetric

Share

Gmail Facebook X LinkedIn More