How good are SPT schedules for fair optimality criteria
Article
First Online:
- 78 Downloads
- 5 Citations
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.
Keywords
Multiprocessor scheduling SPT Fairness measures Approximation algorithmsPreview
Unable to display preview. Download preview PDF.
References
- Bruno, J., Coffman, E. G. Jr., & Sethi, R. (1974). Algorithms for minimizing mean flow time. In Proceedings of IFIP congress 74 (pp. 504–510), Stockholm, Sweden, August 5–10, 1974. North-Holland. Google Scholar
- Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley. Google Scholar
- Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman. Google Scholar
- Kumar, A., & Kleinberg, J. (2000). Fairness measures for resource allocation. In Proceedings of 41st IEEE symposium on foundations of computer science (pp. 75–85) Google Scholar
- Phillips, C., Stein, C., & Wein, J. (1995). Scheduling jobs that arrive over time. In Lecture notes in computer science : Vol. 955. Proceedings of the fourth workshop on algorithms and data structures (pp. 86–97). Berlin: Springer. Google Scholar
- Stein, C., & Wein, J. (1997). On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21(3), 115–122. CrossRefGoogle Scholar
Copyright information
© Springer Science+Business Media, LLC 2007