(Incremental) priority algorithms

Algorithmica (New York)

Volumn 37, Issue 4, 2003, Pages 295-326

  Borodin, Allan ^a   Nielsen, Morten N ^b   Rackoff, Charles ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Greedy algorithms; Priority algorithms; Scheduling

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; SCHEDULING; THEOREM PROVING;

COMBINATORIAL OPTIMIZATION; GREEDY ALGORITHM; JOB SCHEDULING; PRIORITY ALGORITHM;

PARALLEL ALGORITHMS;

EID: 0344550431     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1036-3     Document Type: Article

References (39)

1. M. Adler, A.L. Rosenberg, R.K. Sitaraman, and W. Unger. Scheduling time-constrained communication in linear networks. In Proceedings of the Tenth International ACM Symposium on Parallel Algorithms and Architecture, pages 269-278, 1998.
2. S. Angelopoulos and A. Borodin. On the power of priority algorithms for facility location and set cover. In Proceedings of the Fifth International Workshop, Approx 2002, pages 26-39, Rome, September 2002.
3. E.M. Arkin and E.L. Silverberg. Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18:1-8, 1987.
4. 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. Journal of the ACM, 44(3):486-504, May 1997.
5. Y. Azar, J. Naor, and R. Rom. The competitiveness of online assignments. Journal of Algorithms, 18(2):221-237, 1995.
6. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48(5):1069-1090, 2001.
7. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of multiple machines under real-time scheduling. SICOMP, 31(2):331-352, 2001.
8. S. Baruah, G. Koren, B. Mishra, A. Raghunathon, L. Rosier, and D. Shasha. On-line scheduling in the presence of overload. In FOCS: IEEE Symposium of Foundations of Computing, pages 100-110, 1991.
9. P. Berman and B. Das Gupta. Improvements in throughput maximization for real-time scheduling. In STOC: ACM Symposium on Theory of Computing, 2000.
10. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, April 1998.
11. G. Brassard and P. Bratley. Introduction to Algorithms, Chapter 6. Prentice-Hall, Englewood Cliffs, New Jersey, 1996.
12. A.Z. Broder, A. Frieze, C. Lund, S. Phillips, and N. Reingold. Balanced allocations for tree-like inputs. Information Processing Letters, 55(6):329-332, 1995.
13. M.C. Carlisle and E.L. Lloyd. On the k-coloring of intervals. Lecture Notes in Computer Science, volume 497, pages 90-101. Springer-Verlag, Berlin, 1991.
14. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. In STOC: ACM Symposium on Theory of Computing, pages 626-635, 1997.
15. Y. Cho and S. Sahni. Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1):91-103, 1980.
16. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms, chapter 28. MIT Press, Cambridge, Massachusetts, 1990.
17. G. Dobson. Scheduling independent tasks on uniform processors. SIAM Journal on Computing, 13(4):705-716, 1984.
18. T. Erlebach and F.C.R. Spieksma. Interval Selection: Applications, Algorithms, and Lower Bounds. Technical Report 152, Computer Engineering and Networks Laboratory, ETH, October 2002.
19. U. Faigle and W.M. Nawijn. Greedy k-decomposition of interval orders. In Proceedings of the Second Twente Workshop in Graphs and Combinatorial Optimization, pages 53-56, University of Twente, 1991.
20. D.K. Friesen. Tighter bounds for LPT scheduling on uniform processors. SIAM Journal on Computing, 16(3):554-560, June 1987.
21. M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, New York City, New York, 1996.
22. T.E. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985.
23. R.L. Graham. Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal, 45:1563-1581, 1966.
24. R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17(1):416-429, March 1969.
25. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5:287-326, 1979.
26. D.S. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS, Boston, Massachusetts, 1997.
27. D.S. Hochbaum and D.B. Shmoys. Using dual approximation algorithms for scheduling problems: practical and theoretical results. Journal of the ACM, 34:144-162, 1987.
28. D.S. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS, Boston, Massachusetts, 1997.
29. R. Impagliazzo and S. Davis. Models of greedy algorithms for graph problems. Unpublished manuscript, November 2002.
30. G. Koren and D. Shasha. Moca: a multiprocessor on-line competitive scheduling algorithm for real-time system scheduling. Theoretical Computer Science, 128:75-97, 1994.
31. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. Sequencing and scheduling: algorithms and complexity. In S.C. Graves, A.H.G. Rinnooy Kan, and P. Zipkin, editors, Handbooks in Operations Research and Management Science, Volume 4. North-Holland, Amsterdam, 1993.
32. S. Leonardi, A. Marchetti-Spaccamela, A. Presciutti, and A. Rosén. On-line randomized call control revisited. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 323-332, San Francisco, California, January 1998.
33. R. McNaughton. An n-job, one machine sequencing algorithms for minimizing the number of late jobs. Management Science, 15:101-109, 1959.
34. B.M.E. Moret and H.D. Shapiro. Algorithms from P to NP, chapter 5. Benjamin/Cummings, Redwood City, California, 1991.
35. O. Regev. Priority algorithms for makespan minimization in the subset model. Information Processing Letters, 84(3):153-157, September 2002.
36. S.K. Sahni. Algorithms for scheduling independent tasks. Journal of the ACM, 23(1):116-127, January 1976.
37. S. Seiden, J. Sgall, and G. Woeginger. Semi-online scheduling with decreasing job sizes. Operations Research Letters, 27(5):215-221, 2000.
38. J. Sgall. On-line scheduling. Lecture Notes in Computer Science, volume 1442, pages 196-231. Springer-Verlag, Berlin, 1998.
39. F.C.R. Spieksma. On the approximability of an interval scheduling problem. Journal of Scheduling, (2):215-227, 1999.