Better bounds for online scheduling

SIAM Journal on Computing

Volumn 29, Issue 2, 1999, Pages 459-473

  Albers, Susanne ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; PARALLEL PROCESSING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

COMPETITIVE ANALYSIS; MAKESPAN MINIMIZATION; ONLINE SCHEDULING;

ONLINE SYSTEMS;

EID: 0033300942     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797324874     Document Type: Article

References (14)

1. J. ASPNES, Y. AZAR, A. FIAT, S. PLOTKIN, AND O. WAARTS, On-line routing of virtual circuits with applications to load balancing and machine scheduling, J. ACM, 44 (1997), pp. 486-504.
2. p norm, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Piscataway, NJ, 1995, pp. 1583-391.
3. Y. BARTAL, A. FIAT, H. KARLOFF, AND R. VOHRA, New algorithms for an ancient scheduling problem, J. Comput. System Sci., 51 (1995), pp. 359-366.
4. Y. BARTAL, H. KARLOFF, AND Y. RABANI, A better lower bound for on-line scheduling, Inform. Process. Lett., 50 (1994), pp. 113-116.
5. Y. BARTAL, S. LEONARDI, A. MARCHETTI-SPECCAMELA, J. SGALL, AND L. STOUGIE, Multiprocessor scheduling with rejection, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1996, pp. 95-104.
6. B. CHEN, A. VAN VLIET, AND G. WOEGINGER, New lower and upper bounds for on-line scheduling, Oper. Re. Lett., 16 (1994), pp. 221-230.
7. U. FAIGLE, W. KERN, AND G. TURAN, On the performance of on-line algorithms for particular problems, Acta Cybernet., 9 (1989), pp. 107-119.
8. G. GALAMBOS AND G. WOEGINGER, An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling, SIAM J. Comput., 22 (1993), pp. 349-355.
9. M.R. GARAY AND D.S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, 1979.
10. R.L. GRAHAM, Bounds for certain multi-processing anomalies, Bell. System Tech. J., 45 (1966), pp. 1563-1581.
11. D.R. KARGER, S.J. PHILLIPS, AND E. TORNG, A better algorithm for an ancient scheduling problem, J. of Algorithms, 20 (1996), pp. 400-430.
12. R. MOTWANI, S. PHILLIPS, AND E. TORNG, Non-clearvoyant scheduling, in Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1993, pp. 422-431.
13. D.D. SLEATOR AND R.E. TARJAN, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.
14. D. SHMOYS, J. WEIN, AND D.P. WILLIAMSON. Scheduling parallel machines on-line, in Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Piscataway, NJ, 1991, pp. 131-140.