Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds

Journal of Algorithms

Volumn 30, Issue 2, 1999, Pages 323-343

  Chudak, Fabián A ^a   Shmoys, David B ^a  

^a Cornell University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000869985     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1998.0987     Document Type: Article

References (14)

1. S. Chakrabarti, C. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria, "Automata, Languages, and Processing, Proceedings of the Twenty-Third International Colloquium ICALP '96," F. Meyer auf der Heide and B. Monien, eds. Lecture Notes in Computer Science, Vol. 1099, pp. 646-657, Springer-Verlag, Berlin, 1996.
2. T. Gonzalez, O. H. Ibarra, and S. Sahni, Bounds for LPT schedules on uniform processors, SIAM J. Comput. 6 (1997), 155-166.
3. R. L. Graham, Bounds for certain multiprocessing anomalies, Bell Syst. Tech. J. 45 (1966), 1563-1581.
4. 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, Ann. Discrete Math. 5, (1979), 287-326.
5. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein, Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms, Math. Oper. Res. 22 (1997), 513-544.
6. L. A. Hall, D. B. Shmoys, and J. Wein, Scheduling to minimize average completion time: off-line and on-line algorithms, in "Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms," 1996, pp. 142-151.
7. D. S. Hochbaum and D. B. Shmoys, A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach, SIAM J. Comput. 17 (1988), 539-551.
8. J. Jaffe, Efficient scheduling of tasks without full use of processor resources, Theoret. Comput. Sci. 12 (1980), 1-17.
9. J. K. Lenstra and A. H. G. Rinnooy Kan, Complexity of scheduling under precedence constraints, Oper. Res. 26 (1978), 22-35.
10. J. H. Lin and J. S. Vitter, ∈-approximation with minimum packing constraint violation, in "Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing," 1992, pp. 771-782.
11. J. W. S. Liu and C. L. Liu, Bounds on scheduling algorithms for heterogeneous computing systems, in "Information Processing 74," J. L. Rosenfeld, Ed. pp. 349-353, North-Holland, Amsterdam, 1974.
12. A. S. Schulz, "Scheduling and Polytopes," Ph.D. thesis, Technische Universität Berlin, Berlin, Germany, 1996.
13. D. B. Shmoys, and É. Tardos, An approximation algorithm for the generalized assignment problem, Math. Programming 62 (1993), 461-474.
14. D. B. Shmoys, J. Wein, and D. P. Williamson, Scheduling parallel machines on-line, SIAM J. Comput. 24 (1995), 1313-1331.