An on-line algorithm for some uniform processor scheduling

SIAM Journal on Computing

Volumn 27, Issue 2, 1998, Pages 414-422

  Rongheng, L I ^a   Shi, Lijie ^b  

^a HUNAN NORMAL UNIVERSITY   (China)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

List scheduling; On line scheduling; Uniform machines

Indexed keywords

EID: 0012393043     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539799527969     Document Type: Article

References (4)

1. Y. CHO AND S. SAHNI, Bounds for list schedules on uniform processors, SIAM J. Comput., 9 (1980), pp. 91-103.
2. R. L. GRAHAM, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 416-429.
3. G. GALAMBOS AND G. J. WOEGINGER, An on-line scheduling heuristic with better worst case ratio than Graham's List Scheduling, SIAM J. Comput., 22 (1993), pp. 349-355.
4. Y. BARTAL, A. FIAT, H. KARLOFF, AND R. VOHRA, New algorithms for an ancient scheduling problem, in Proc. 24th ACM Symp. on Theory of Computing, ACM, New York, 1992, pp. 51-58.