Lower bound for on-line scheduling on uniformly related machines

Operations Research Letters

Volumn 26, Issue 1, 2000, Pages 17-22

  Epstein, Leah ^a   Sgall, Jiří ^b,c  

^a TEL AVIV UNIVERSITY   (Israel)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

^c CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; PROCESS ENGINEERING; RANDOM PROCESSES; SCHEDULING;

ONLINE MACHINE SCHEDULING; UNIFORMLY RELATED MACHINES;

PRODUCTION CONTROL;

EID: 0034135264     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00062-0     Document Type: Article

References (11)

1. S. Albers. Better bounds for online scheduling, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, 1997, pp. 130-139.
2. Aspnes J., Azar Y., Fiat A., Plotkin S., Waarts O. On-line load balancing with applications to machine scheduling and virtual circuit routing. J. Assoc. Comput. Mach. 44(3):1997;486-504.
3. Y. Azar, On-line load balancing, in: A. Fiat, G.J. Woeginger (Eds.), Online Algorithms: The State of the Art, Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin, 1998, pp. 178-195.
4. P. Berman, M. Charikar, M. Karpinski, On-line load balancing for related machines, in: Proceedings of the 5th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 1272, Springer, Berlin, 1997, pp. 116-125.
5. Chen B., van Vliet A., Woeginger G.J. An optimal algorithm for preemptive on-line scheduling. Oper. Res. Lett. 18:1995;127-131.
6. L. Epstein, J. Noga, S.S. Seiden, J. Sgall, G.J. Woeginger, Randomized online scheduling for two related machines, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM-SIAM, New York, 1999, pp. 317-326.
7. Gonzales T.F., Sahni S. Preemptive scheduling of uniform processor systems. J. Assoc. Comput. Mach. 25:1978;92-101.
8. Horwath E., Lam E.C., Sethi R. A level algorithm for preemptive scheduling. J. Assoc. Comput. Mach. 24:1977;32-43.
9. Sgall J. A lower bound for randomized on-line multiprocessor scheduling. Inform Process. Lett. 63(1):1997;51-55.
10. J. Sgall, On-line scheduling, in: A. Fiat, G.J. Woeginger (Eds.), Online Algorithms: The State of the Art, Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin, 1998, pp. 196-231.
11. Wen J., Du D. Preemptive on-line scheduling for two uniform processors. Oper. Res. Lett. 23:1998;113-116.