How good are SPT schedules for fair optimality criteria

Annals of Operations Research

Volumn 159, Issue 1, 2008, Pages 53-64

  Angel, Eric ^a   Bampis, Evripidis ^a   Pascual, Fanny ^b  

^a UNIVERSITY OF EVRY   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Approximation algorithms; Fairness measures; Multiprocessor scheduling; SPT

Indexed keywords

EID: 38749144459     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-007-0267-0     Document Type: Article

References (6)

1. 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.
2. Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley.
3. Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
4. Kumar, A., & Kleinberg, J. (2000). Fairness measures for resource allocation. In Proceedings of 41st IEEE symposium on foundations of computer science (pp. 75-85)
5. 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.
6. 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.