The optimal on-line parallel machine scheduling

Computers and Mathematics with Applications

Volumn 39, Issue 7-8, 2000, Pages 117-121

  Yong, H E ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Analysis of algorithm; On line scheduling; Worst case ratio

Indexed keywords

COMPUTATIONAL COMPLEXITY; ONLINE SYSTEMS; OPTIMIZATION; SCHEDULING; SET THEORY; THEOREM PROVING;

ON LINE SCHEDULING; WORST CASE RATIO;

PARALLEL ALGORITHMS;

EID: 0034174008     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0898-1221(00)00070-5     Document Type: Article

References (12)

1. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, (1979).
2. R.L. Graham, Bounds for certain multiprocessing anomalies, Bell System Tech. 45, 1563-158 (1966).
3. B.L. Deuermeryer, D.K. Friesen and M.A. Langston, Scheduling to maximize the minimum processor finish time in a multiprocessor system, SIAM J. Algorithms Discrete Methods 3, 190-196 (1982).
4. U. Faigle, W. Kern and G. Turan, On the performance of on-line algorithm for particular problems, Acta Cybernetica 9, 107-119 (1989).
5. S. Albers, Better bounds for on-line scheduling, In Proc. 29th Annual ACM Symp. on Theory of Computing, pp. 130-139, (1997).
6. Y. Bartal, A. Fiat, A. Karloff and R. Vohra, New algorithm for an ancient scheduling problem, In Proc. 24th Annual ACM Symp. on Theory of Computing, pp. 51-58, (1992).
7. G. Galambos and G. Woeginger, An on-line scheduling heuristic with better worst-case ratio than Graham's list scheduling, SI AM J. on Computing 22, 349-355 (1993).
8. D.A. Karger, S.J. Phillips and E. Torng, A better algorithm for an ancient scheduling algorithm, J. of Algorithms 20, 400-430 (1996).
9. Y. He and G. Zhang, Semi on-line scheduling on two identical machines, Computing 62, 179-187 (1999).
10. J. Csirik, H. Kellerer and G. Woeginger, The exact LPT-bound for maximizing the minimum completion time, Oper. Res. Letters 11, 281-287 (1992).
11. G. Woeginger, A polynomial time approximation scheme for maximizing the minimum machine completion time, Oper. Res. Letters 20, 149-154 (1997).
12. H. Kellerer, Bounds for nonpreemptive scheduling jobs with similar processing times on multiprocessor systems using LPT-algorithm, Computing 46, 183-191 (1991).