On-Line Uniform Machine Scheduling with Rejection

Computing (Vienna/New York)

Volumn 65, Issue 1, 2000, Pages 1-12

  He, Y ^a   Min, X ^a,b  

^a ZHEJIANG UNIVERSITY   (China)

^b Zhejiang Economic College   (China)

Author keywords

Competitive ratio; On line scheduling; Uniform machine; Worst case analysis

Indexed keywords

EID: 0042782765     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. Aspnes, J., Azar, Y., Fiat, A., Plotakin, S., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. Proc. of the 25th Ann. ACM Symp. on Theory of Computing, 623-631 (1993).
2. Azar, Y.: On-line load balancing. Manuscript, 1998.
3. Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 95-103 (1996).
4. Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. Manuscript, 1997.
5. Cho, Y., Sahni, S.: Bounds for list scheduling on uniform processors. SIAM J. Computing 9, 91-103 (1980).
6. Epstein, L., Noga, J., Seiden, S. S., Sgall, J., Woeginger, G. J.: Randomized on-line scheduling for two related machines. Proc. of the 10th ACM-SIAM Symp. on Discrete Algorithms, 317-326 (1999).
7. Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. To appear in Proc. of the 7th Ann. European Symp. on Algorithms, 1999.
8. Hochbaum, D. S., Shmoys, D. B.: A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM J. Computing 17, 539-551 (1988).
9. Li, R. H., Shi, L. J.: An on-line algorithm for some uniform processor scheduling. SIAM J. Computing 27, 414-442 (1998).
10. Seiden, S. S.: Randomization in online computation. Ph.D. thesis, University of California, Irvine, 1997.
11. Sgall, J.: On-line scheduling. In: Online algorithms: The state of the arts (Fiat, A., Woeginger, G. J., eds.), Lecture Notes in Comput. Sci. 1442, 196-231 (1998).
12. Sleator, D., Tarjan, R. E.: Amortized efficiency of list update and paging rules. Comm. ACM 28, 202-208 (1985).