Single machine scheduling with release dates

SIAM Journal on Discrete Mathematics

Volumn 15, Issue 2, 2002, Pages 165-192

  Goemans, Michel X ^a   Queyranne, Maurice ^a   Schulz, Andreas S ^a   Skutella, Martin ^a   Wang, Yaoguang ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithm; LP relaxation; On line algorithm; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; PROBLEM SOLVING; THEOREM PROVING;

ON-LINE ALGORITHM; SINGLE MACHINE SCHEDULING;

SCHEDULING;

EID: 0036487488     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089548019936223X     Document Type: Article

References (39)

1. 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 Annual IEEE Symposium on Foundations of Computer Science, New York, NY, 1999, pp. 32-43.
2. E. J. Anderson and C. N. Potts, On-line scheduling of a single machine to minimize total weighted completion time, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2002, pp. 548-557.
3. E. Balas, On the facial structure of scheduling polyhedra, Math. Programming Stud., 24 (1985), pp. 179-218.
4. H. Belouadah, M. E. Posner, and C. N. Potts, Scheduling with release dates on a single machine to minimize total weighted completion time, Discrete Appl. Math., 36 (1992), pp. 213-231.
5. S. Chakrabarti, C. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein, Improved scheduling algorithms for minsum criteria, in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 1099, F. Meyer auf der Heide and B. Montein, eds., Springer, Berlin, 1996, pp. 646-657.
6. C. Chekuri, R. Motwani, B. Natarajan, and C. Stein, Approximation techniques for average completion time scheduling, SIAM J. Comput., 31 (2001), pp. 146-166.
7. C.-F. Chou, M. Queyranne, and D. Simchi-Levi, The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates, in Integer Programming and Combinatorial Optimization, Lecture-Notes in Comput. Sci. 2081, K. Aardal and B. Gerards, eds., Springer, Berlin, 2001, pp. 45-59.
8. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed., MIT Press, Cambridge, MA, 2001.
9. M. E. Dyer and L. A. Wolsey, Formulating the single machine sequencing problem with release dates as a mixed integer program, Discrete Appl. Math., 26 (1990), pp. 255-270.
10. M. X. Goemans, A supermodular relaxation for scheduling with release dates, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1084, W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds., Springer, Berlin, 1996, pp. 288-300.
11. M. X. Goemans, Improved approximation algorithms for scheduling with release dates, in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, 1997, ACM, New York, 1997, pp. 591-598.
12. 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), pp. 287-326.
13. 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), pp. 513-544.
14. 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 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 1996, ACM, New York, 1996, pp. 142-151.
15. J. A. Hoogeveen, and A. P. A. Vestjens, Optimal on-line algorithms for single-machine scheduling, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1084, W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds., Springer, Berlin, 1996, pp. 404-414.
16. J. Labetoulle, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, Preemptive scheduling of uniform machines subject to release dates, in Progress in Combinatorial Optimization, W. R. Pulleyblank, ed., Academic Press, New York, 1984, pp. 245-261.
17. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker, Complexity of machine scheduling problems, Ann. Discrete Math., 1 (1977), pp. 343-362.
18. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, UK, 1995.
19. 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, Lecture Notes in Comput. Sci. 1412, R. E. Bixby, E. A. Boyd, and R. Z. Ríos-Mercado, eds., Springer, Berlin, 1998, pp. 367-382, SIAM J. Comput., to appear.
20. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, An analysis of approximations for maximizing submodular set functions. I, Math. Programming, 14 (1978), pp. 265-294.
21. C. Phillips, C. Stein, and J. Wein, Minimizing average completion time in the presence of release dates, Math. Programming, 82 (1998), pp. 199-223.
22. M. Queyranne. Structure of a simple scheduling polyhedron, Math. Programming, 58 (1993), pp. 263-285.
23. M. Queyranne and A. S. Schulz, Polyhedral Approaches to Machine Scheduling, Preprint 408, Department of Mathematics, Technische Universität Berlin, Germany, 1994.
24. M. Queyranne and A. S. Schulz, Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 920, Springer, Berlin, 1995, pp. 307-320.
25. M. W. P. Savelsbergh, R. N. Uma, and J. M. Wein, An experimental study of LP-based approximation algorithms for scheduling problems, in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998, ACM, New York, 1998, pp. 453-462.
26. A. S. Schulz, Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1084, W. H. Cunningham, S. T. McCormick, and M. Queyranne, eds., Springer, Berlin, 1996, pp. 301-315.
27. A. S. Schulz and M. Skutella, Random-based scheduling: New approximations and LP lower bounds, in Randomization and Approximation Techniques in Computer Science, Lecture Notes in Comput. Sci. 1269, J. Rolim, ed., Springer, Berlin, 1997, pp. 119-133.
28. A. S. Schulz and M. Skutella, Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria, in Algorithms-ESA '97, Lecture Notes in Comput. Sci. 1284, Springer, Berlin, 1997, pp. 416-429, SIAM J. Discrete Math., to appear under the title "Scheduling unrelated machines by randomized rounding."
29. A. S. Schulz and M. Skutella, The power of α-points in preemptive single machine scheduling, J. Sched., 5 (2002), to appear.
30. J. Sgall, On-line scheduling-a survey, in Online Algorithms: The State of the Art, Lecture Notes in Comput. Sci. 1441, A. Fiat and G. J. Woeginger, eds., Springer, Berlin, 1998, pp. 196-231.
31. L. S. Shapley, Cores of convex games, Internat. J. Game Theory, 1 (1971), pp. 11-26.
32. M. Skutella, Approximation and Randomization in Scheduling, Ph.D. thesis, Technische Universität Berlin, Germany, 1998.
33. M. Skutella, Convex quadratic and semidefinite programming relaxations in scheduling, J. ACM, 48 (2001), pp. 206-242.
34. M. Skutella and G. J. Woeginger, A PTAS for minimizing the total weighted completion time on identical parallel machines, Math. Oper. Res., 25 (2000), pp. 63-75.
35. W. E. Smith, Various optimizers for single-stage production, Naval Res. Logist. Quart., 3 (1956), pp. 56-66.
36. L. Stougie, private communication in [15], 1995.
37. L. Stougie and A. P. A. Vestjens, Randomized algorithms for on-line scheduling problems: How low can't you go? Oper. Res. Lett., to appear.
38. R. N. Uma and J. M. Wein, On the relationship between combinatorial and LP-based approaches to NP-hard scheduling problems, in Integer Programming and Combinatorial Optimization, Lecture Notes in Comput. Sci. 1412, R. E. Bixby, E. A. Boyd, and R. Z. Ríos-Mercado, eds., Springer, Berlin, 1998, pp. 394-408.
39. A. P. A. Vestjens, On-Line Machine Scheduling, Ph. D. thesis, Eindhoven University of Technology, The Netherlands, 1997.