Off-line admission control for general scheduling problems

Journal of Scheduling

Volumn 3, Issue 6, 2000, Pages 365-381

  Phillips, Cynthia A ^a   Uma, R N ^b   Wein, Joel ^b,c  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c AKAMAI TECHNOLOGIES   (United States)

Author keywords

Admission control; Approximation algorithm; Scheduling

Indexed keywords

EID: 0347699574     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1002/1099-1425(200011/12)3:6<365::AID-JOS56>3.0.CO;2-P     Document Type: Article

References (23)

1. Hall LA. Approximation algorithms for scheduling. In Approximation Algorithms for NP-hard Problems, Hochbaum DS (ed.). PWS Publishing Company, 1997; 1-43.
2. Kellerer H, Tautenhahn T, Woeginger GJ. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, May 1995.
3. Bala Kalyanasundaram, Pruhs K. Speed is equivalent to clairvoyance. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995; 115-124.
4. Phillips C, Stein C, Torng E, Wein J. Optimal time-critical scheduling via resource augmentation. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997; 140-149.
5. Phillips C, Stein C, Wein J. Scheduling jobs that arrive over time. In Proceedings of Fourth Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 955. Springer: Berlin, 1995; 86-97. Mathematical Programming B, to appear.
6. 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; (3):513-544.
7. Chakrabarti S, Phillips C, Schulz AS, Shmoys DB, Stein C, Wein J. Improved approximation algorithms for minsum criteria. In Proceedings of the 1996 International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 1099. Springer: Berlin, 1996; 646-657.
8. Chekuri C, Motwani R, Natarajan B, Stein C. Approximation techniques for average completion time scheduling. In Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, January 1997; 609-618.
9. Goemans M. Improved approximation algorithms for scheduling with release dates. In Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, 1997; 591-598.
10. Schulz AS, Skutella M. Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria. In Algorithms-ESA'97. Burkard R, Woeginger G (eds). Lecture Notes in Computer Science, vol. 1284. Springer: Berlin, 1997; 416-429 (Proceedings of the 5th Annual European Symposium on Algorithms).
11. Schulz AS, Skutella M. Random-based scheduling: new approximations and LP lower bounds. In Randomization and Approximation Techniques in Computer Science, Rolim J (ed.). Lecture Notes in Computer Science, vol. 1269. Springer: Berlin, 1997; 119-133 (Proceedings of the International Workshop RANDOM'97).
12. Goemans M, Queyranne M, Schulz A, Skutella M, Wang Y. Single machine scheduling with release dates. Preprint, 1997.
13. Bar-Noy A, Guha S, Naor J, Schieber B. Approximating the throughput of real-time multiple machine scheduling. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999.
14. Bender MA, Chakrabarti S, Muthukrishnan S. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1998; 270-279.
15. Savelsbergh MWP, Uma RN, Wein J. An experimental study of LP-based approximation algorithms for scheduling problems. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1998; 453-462.
16. Uma RN, Wein J. On the relationship between combinatorial and LP-based approaches to NP-hard scheduling problems. In IPCO: 6th Integer Programming and Combinatorial Optimization Conference, Bixby RE, Boyd EA, Ríos-Mercado RZ (eds). Lecture Notes in Computer Science, vol. 142. Springer: Berlin, 1998; 394-408.
17. Pinedo M. Scheduling: Theory, Algorithms and Systems. Prentice-Hall: Englewood Cliffs, NJ, 1995.
18. Queyranne M, Schulz AS. Polyhedral approaches to machine scheduling. Technical Report 408/1994, Technical University of Berlin, 1994.
19. Hall LA, Shmoys DB, Wein J. Scheduling to minimize average completion time: Off-line and on-line algorithms. In Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, January 1996; 142-151.
20. Phillips C, Stein C, Wein J. Task scheduling in networks. SIAM Journal on Discrete Mathematics 1997; 10(4):573-598.
21. Karger D. 1999. Personal communication.
22. Raghavan P, Thompson CD. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 1987; 7:365-374.
23. Van den Akker M, Hurkens CAJ, Savelsbergh MWP. A time-indexed formulation for single-machine scheduling problems: Column generation. Submitted for publication, 1996.