Approximation techniques for average completion time scheduling

SIAM Journal on Computing

Volumn 31, Issue 1, 2001, Pages 146-166

  Chekuri, C ^a   Motwani, R ^b   Natarajan, B ^c   Stein, C ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b Stanford University   (United States)

^c Arcot Systems   (United States)

^d Dartmouth Department of Computer Science_Dartmouth College   (United States)

Author keywords

Approximation algorithms; Parallel machine scheduling; Precedence constraints; Release dates; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; ONLINE SYSTEMS; SCHEDULING; TREES (MATHEMATICS);

PARALLEL MACHINE SCHEDULING;

PROBLEM SOLVING;

EID: 0036213040     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797327180     Document Type: Article

References (35)

1. D.L. ADOLPHSON, Single machine job sequencing with precedence constraints, SIAM J Comput., 6 (1977), pp. 40-54.
2. F. AFRATI, E. BAMPIS, C. CHEKURI, D. KARGER, C. KENYON, S. KHANNA, I. MILIS, M. QUEYRANNE, M. SKUTELLA, C. STEIN, AND M. SVIRIDENKO, Approximation schemes for minimizing average weighted completion time with release dates, in Proceedings of the 40th Symposium on the Foundations of Computer Science, 1999, pp. 32-43.
3. S. CHAKRABARTI, C. PHILLIPS, A. SCHULZ, D.B. SHMOYS, C. STEIN, AND J. WEIN, Improved scheduling algorithms for minsum criteria, in Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, Springer, 1996, pp. 646-657
4. C. CHEKURI, R. JOHNSON, R. MOTWANI, B.K. NATARAJAN, B.R. RAU, AND M. SCHLANSKER, Profile-driven instruction level parallel scheduling with applications to super blocks, in Proceeding of the 29th Annual International Symposium on Microarchitechture (MICRO-29), 1996, pp. 58-67.
5. C. CHEKURI, R. MOTWANI, B. NATARAJAN, AND C. STEIN, Approximation techniques for average completion time scheduling, in Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 1997, pp. 609-618.
6. C. CHEKURI AND R. MOTWANI, Precedence constrained scheduling to minimize weighted completion time on a single machine, Discrete Appl. Math., 98 (1999), pp. 29-38.
7. F. CHUDAK AND D. SHMOYS, Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds, in Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 1997, pp. 581-590.
8. F. CHUDAK AND D. HOCHBAUM, A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine, Oper. Res. Lett., 25 (1999), pp. 199-204.
9. J. DU, J.Y.T. LEUNG, AND G.H. YOUNG, Minimizing mean flow time with release time constraint, Theoret. Comput. Sci., 75 (1990), pp. 347-355.
10. J. DU, J.Y.T. LEUNG, AND G.H. YOUNG, Scheduling chain structured tasks to minimize makespan and mean flow time, Inform. and Comput., 92 (1991), pp. 219-236.
11. M.R. GAREY AND D.S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
12. M.X. GOEMANS, Improved approximation algorithms for scheduling with release dates, in Proceedings of the Eighth ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 1997, pp. 591-598.
13. M. GOEMANS, M. QUEYRANNE, A. SCHULZ, M. SKUTELLA, AND Y. WANG, Single machine scheduling with release dates, submitted.
14. R.L. GRAHAM Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 416-429.
15. 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 ACM-SIAM Symposium on Discrete Algorithms, Atlanta, 1996, pp. 142-151.
16. L.A. HALL, A.S. SCHULZ, D.B. SHMOYS, AND J. WEIN, Scheduling to minimize average completion time: Offline and online algorithms, Math. Oper. Res., 22 (1997), pp. 513-544.
17. J.L. HENNESSY AND T. GROSS, Postpass code optimization of pipeline constraints, ACM Trans. Program. Lang. and Systems, 5 (1983), pp. 422-448.
18. J.A. HOOGEVEEN, P. SCHUURMAN, AND G.J. WOEGINGER, Non-approximability results for scheduling problems with minsum criteria, in Integer Programming and Combinatorial Optimization, R.E. Bixby, E.A. Boyd, and R.Z. Rfos-Mercado, eds., Lecture Notes in Comput. Sci., Springer, Berlin, 1998, pp. 353-366.
19. W.A. HORN, Single-machine job sequencing with treelike precedence ordering and linear delay penalties, SIAM J. Appl. Math., 23 (1972), pp. 189-202.
20. 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), pp. 539-551.
21. J.A. HOOGEVEEN AND A.P.A. VESTJENS, Optimal On-line algorithms for single-machine scheduling in Proceedings of the Fifth Conference On Integer Programming and Combinatorial Optimization, Vancouver, BC, Canada, 1996, pp. 404-414.
22. E.L. LAWLER, Sequencing jobs to minimize total weighted completion time, Ann. Discrete Math., 2 (1978), pp. 75-90.
23. E.L. LAWLER, J.K. LENSTRA, A.H.G. RINNOOY KAN, AND D.B. SHMOYS, Sequencing and scheduling: Algorithms and complexity, in Handbooks in Operations Research and Management Science, Vol. 4: Logistics of Production and Inventory, North-Holland, Amsterdam, 1990.
24. A. MUNIER, M. QUEYRANNE, AND A. S. SCHULZ, Approximation bounds for a general class of precedence constrained parallel machine scheduling problems, in Integer Programming and Combinatorial Optimization, R.E. Bixby, E.A. Boyd, and R.Z. Ríos-Mercado, eds., Lecture Notes in Comput. Sci., Springer, Berlin, 1998, pp. 367-382.
25. C. PHILLIPS, C. STEIN, AND J. WEIN, Scheduling jobs that arrive over time, in Proceedings of the Fourth International Workshop on Algorithms and Data Structures, Kingston, ON, Canada, 1995, pp. 86-97.
26. A.S. SCHULZ AND M. SKUTELLA, Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria, Technical Report 533-1996, Fachbereich Mathematik, Technische Universität Berlin, Berlin, Germany, 1996.
27. A.S. SCHULZ, Scheduling to minimize total weighted completion time: Performance guarantees of lp based heuristics and lower bounds, in Proceedings of the Fifth Conference On Integer Programming and Combinatorial Optimization, Vancouver, BC, Canada, 1996, pp. 301-315.
28. A.S. SCHULZ AND M. SKUTELLA, Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria, in Proceedings of the Fifth Annual European Symposium on Algorithms, Graz, Austria, 1997, pp. 416-429.
29. A.S. SCHULZ AND M. SKUTELLA, Random-based scheduling: New approximations and lp lower bounds, in Randomization and Approximation Techniques in Computer Science (RANDOM), J. Rolim, ed., Lecture Notes in Comput. Sci. 1269, Springer, Berlin, 1997, pp. 119-133.
30. W.B. SMITH, Various optimizers for single-stage production, Naval Res. Logist. Quart., 3 (1956), pp. 59-66.
31. C. STEIN AND J. WEIN, On the existence of schedules that are near-optimal for both makespan and total weighted completion time, Oper. Res. Lett., 21 (1997), pp. 115-22.
32. L. STOUGIE, private communication cited in [21], 1995.
33. L. STOUGIE AND A. VESTJENS, private communication, 1996.
34. E. TORNG AND P. UTHAISOMBUT, Lower Bounds for SRPT-Subsequence Algorithms for Non-preemptive Scheduling, manuscript, 1998.
35. S. WEISS AND J.E. SMITH, A study of scalar compilation techniques for pipelined supercomputers, in Proceedings of the 2nd International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 1987, pp. 105-109.