The power of α-points in preemptive single machine scheduling

Journal of Scheduling

Volumn 5, Issue 2, 2002, Pages 121-133

  Schulz, Andreas S ^a   Skutella, Martin ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithm; Combinatorial optimization; LP relaxation; On line algorithm; Randomized algorithm; Scheduling theory

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MACHINERY;

APPROXIMATION ALGORITHM; COMBINATORIAL OPTIMIZATION; LP RELAXATION; SCHEDULING THEORY;

SCHEDULING;

EID: 0003358528     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/jos.93     Document Type: Article

References (24)

1. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 1979; 5:287-326.
2. Labetoulle J, Lawler EL, Lenstra JK, Rinnooy Kan AHG. Preemptive scheduling of uniform machines subject to release dates. In Progress in Combinatorial Optimization, Pulleyblank WR (ed.). Academic Press, New York, 1984; 245-261.
3. Borodin A, El-Yaniv R. Online Computation and Competitive Analysis. Cambridge University Press: Cambridge, 1998.
4. Sgall J. On-line scheduling. In Online Algorithm: The state of the Art, Chapter 9, Fiat A, Woeginger GJ (eds). Springer, Berlin, 1998; 196-231.
5. Phillips C, Stein C, Wein J. Minimizing average completion time in the presence of release dates. Mathematical Programming B 1998; 82:199-223
6. Chakrabarti S, Phillips C, Schulz AS, Shmoys DB, Stein C, Wein J. Improved scheduling algorithms for minsum criteria. In Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 1099, Meyer auf der Heide F, Monien B (eds). Springer: Berlin, 1996; 646-657.
7. Chekuri CS, Motwani R, Natarajan B, Stein C. Approximation techniques for average completion time scheduling. SIAM Journal on Computing, to appear. (An earlier version appeared in Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997; 609-618).
8. Goemans MX. Improved approximation algorithms for scheduling with release dates. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms 1997; 591-598.
9. Hall LA, Shmoys DB, Wein J. Scheduling to minimize average completion time: Off-line and on-line algorithms. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms 1996; 142-151.
10. Goemans MX, Queyranne M, Schulz AS, Skutella M, Wang Y. Single machine scheduling with release dates, 1999. Submitted.
11. Skutella M. Approximation and randomization in scheduling. Ph.D. Thesis, Technische Universität, Berlin, Germany, 1998.
12. Hall LA, Schulz AS, Shmoys DB, Wein J. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research 1997; 22:513-544.
13. Goemans MX, Wein JM, Williamson DP. A 1.47-approximation algorithm for a preemptive single-machine scheduling problem. Operations Research Letters 2000; 26:149-154.
14. Afrati F, Bampis E, Chekuri C, Karger D, Kenyon C, Khanna S, Milis I, Queyranne M, Skutella M, Stein C, Sviridenko M. Approximation schemes for minimizing average weighted completion time with release dates. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science 1999; 32-43.
15. Horn WA. Some simple scheduling algorithms. Naval Research and Logistics Quarterly 1974; 21:177-185.
16. Smith WE. Various optimizers for single-stage production. Naval Research and Logistics Quarterly 1956; 3:59-66.
17. Baker KR. Introduction to Sequencing and Scheduling. Wiley: New York, 1974.
18. Dyer ME, Wolsey LA. Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Applied Mathematics 1990; 26:255-270.
19. Posner ME. A sequencing problem with release dates and clustered jobs. Management Science 1986; 32:731-738.
20. Hoogeveen JA, Vestjens APA. Optimal on-line algorithms for single-machine scheduling. In Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1084, Cunningham WH, McCormick ST, Queyranne M (eds). Springer: Berlin, 1996; 404-414.
21. Vestjens APA. On-line scheduling. Ph.D. Thesis, Eindhoven University of Technology, The Netherlands, 1997.
22. Goemans MX. A supermodular relaxation for scheduling with release dates. In Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1084, Cunningham WH, McCormick ST, Queyranne M (eds). Springer: Berlin, 1996; 288-300.
23. Epstein L, van Stee R. Lower bounds for on-line single-machine scheduling. In Mathematical Foundations of Computer Science 2001, Lecture Notes in Computer Science, vol. 2136, Sgall J, Pultr A, Kolman (eds). Springer: Berlin, 2001; 338-350.
24. Anderson EJ, Potts CN. On-line scheduling of a single machine to minimize total weighted completion time. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms 2002, to appear.