How good are shortest processing time (SPT) schedules for fair optimality criteria?

How good are shortest processing time (SPT) schedules for fair optimality criteria?

0.00 Avg rating0 Votes
Article ID: iaor2009940
Country: Netherlands
Volume: 159
Issue: 1
Start Page Number: 53
End Page Number: 64
Publication Date: Mar 2008
Journal: Annals of Operations Research
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.