Speed is more powerful than clairvoyance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1432, Issue , 1998, Pages 255-263

  Coulston, Piotr Berman Chris ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING; SCHEDULING ALGORITHMS;

COMPETITIVE RATIO; HIGH SPEED; ON-LINE SCHEDULERS; PARTICULAR ALGORITHMS; PRIOR KNOWLEDGE; PROCESSING TIME; SINGLE- MACHINES; TOTAL RESPONSE;

ALGORITHMS;

EID: 84957675949     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054373     Document Type: Conference Paper

References (8)

1. S. Albers, Better bounds for online scheduling, STOC (1997), 130-139.
2. S. Irani and A. Karlin, Online Computation, in D. Hochbaum (ed.), Approximation Algorithms for NP Hard Problems, PWS Publishing, Boston MA, 1997, 521-563.
3. B. Kalyanasundaram and K. Pruhs Speed is as powerful as clairvoyance, FOCS (1995), 214-221.
4. T. Matsumoto, Competitive analysis of the round robin algorithm, International Symposium on Algorithms and Computation (1992), 71-77.
5. R. Motwani, S. Phillips and E. Torng, Non-clairvoyant scheduling, SODA (1993), 422-431.
6. C. Phillips, C. Stein, E. Torng and J. Wein, Optimal time-critical scheduling via resource augmentation, STOC (1997), 140-149.
7. W. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly (1956), 59-66.
8. A. Tannenbanm and A. Woodhull, Operating Systems, Prentice Hall, New Jersey, 1997.