Minimizing average completion time in the presence of release dates

Mathematical Programming, Series B

Volumn 82, Issue 1-2, 1998, Pages 199-223

  Phillips, Cynthia ^a   Stein, Clifford ^b   Wein, Joel ^c  

^a SANDIA NATIONAL LABORATORIES   (United States)

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

^c POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Average weighted completion time; Linear programming; Preemptive scheduling; Relaxations; Scheduling

Indexed keywords

EID: 0041541787     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01585872     Document Type: Article

References (23)

1. K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
2. J.L. Bruno, E.G. Coffman, R. Sethi, Scheduling independent tasks to reduce mean finishing time, Communications of the ACM 17 (1974) 382-387.
3. S. Chakrabarti, C. Phillips, A.S. Schulz, D.B. Shmoys, C. Stein, J. Wein, Improved approximation algorithms for minsum criteria, in: Proceedings of the 1996 ICALP Conference, Lecture notes in Computer Science 1099, Springer, Berlin, 1996, pp. 646-657.
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA; McGraw-Hill, New York, 1990.
5. J. Du, J.Y.T. Leung, G.H. Young, Minimizing mean flow time with release time constraint, Theoretical Computer Science 75 (1990).
6. T. Gonzalez, S. Sahni, Open shop scheduling to minimize finish time, Journal of the ACM 23 (1976) 665-679.
7. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics 5 (1979) 287-326.
8. L.A. Hall, A.S. Schulz, D.B. Shmoys, J. Wein, Scheduling to minimize average completion time: Off-line and on-line approximation algorithm, Mathematics of Operations Research 3 (1997) 513-544.
9. D.S. Hochbaum, D.B. Shmoys, A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach, SIAM Journal on Computing 17 (1998) 539-551.
10. J.A. Hoogeveen, A.P.A. Vestjens, Optimal on-line algorithms for single-machine scheduling, in: Proceedings of the Fifth Conference on Integer Programming and Combinatorial Optimization, 1996, pp. 404-414.
11. W. Horn, Minimizing average flow time with parallel machines, Operations Research 21 (1973) 846-847.
12. T. Kawaguchi, S. Kyan, Worst case bound of an LRF schedule for the mean weighted flow-time problem, SIAM Journal on Computing 15 (1986) 1119-1129.
13. H. Kellerer, T. Tautenhahn, G.J. Woeginger, Approximability and nonapproximability results for minimizing total time on a single machine, in: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, May 1996, pp. 418-426.
14. J. Labetoulle, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in: W.R. Pulleyblank (Ed.), Progress in Combinatorial Optimization, Academic Press, New York, 1984, pp. 245-261.
15. T.C. Lai, Personal communication, May 1995.
16. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: Algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in Operations Research and Management Science, vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 445-522.
17. J.K. Lenstra, A.H.G. Rinnooy Kan, P. Brucker, Complexity of machine scheduling problems, Annals of Discrete Mathematics 1 (1977) 343-362.
18. R. McNaughton, Scheduling with deadlines and loss functions, Management Science 6 (1959) 1-12.
19. R. Motwani, S. Phillips, E. Torng, Non-clairvoyant scheduling, in: Proceedings of the Fourth ACM-SIAM Symposium on Discrete Algorithms, January 1993, pp. 422-431.
20. C. Phillips, C. Stein, J. Wein, Task scheduling in networks, SIAM Journal on Discrete Mathematics 10 (4) (1997) 573-598.
21. D.B. Shmoys, C. Stein, J. Wein, Improved approximation algorithms for shop scheduling problems, SIAM Journal on Computing 23 (3) (1994) 617-632.
22. W.E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly 3 (1956) 59-66.
23. L. Stougie, 1995, Personal communication cited in [10].