Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00341351
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Sunday, July 19, 2009 - 11:08:54 PM
Last modification on : Monday, February 15, 2021 - 9:55:11 AM
Long-term archiving on: : Monday, June 7, 2010 - 11:20:19 PM

File

abp6.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Les métriques sont temporairement indisponibles