Name
Abstract | ||
|---|---|---|
We consider the following scheduling setting: a set of tasks have to be exe- cuted on a set of 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10479-007-0267-0 | Annals OR |
Keywords | DocType | Volume |
Multiprocessor scheduling,SPT,Fairness measures,Approximation algorithms | Journal | 159 |
Issue | ISSN | Citations |
1 | 0254-5330 | 3 |
PageRank | References | Authors |
0.50 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eric Angel | 1 | 116 | 14.54 |
| Evripidis Bampis | 2 | 571 | 55.19 |
| Fanny Pascual | 3 | 97 | 14.48 |