Implementation of a PTAS for scheduling with release dates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2153, Issue , 2001, Pages 202-215

  Hepner, Clint ^a   Stein, Cliff ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; SCHEDULING;

NP COMPLETE; PERFORMANCE GUARANTEES; POLYNOMIAL TIME APPROXIMATION SCHEMES; RELEASE DATE; SCHEDULING JOBS; SINGLE- MACHINES; TOTAL COMPLETION TIME;

SCHEDULING ALGORITHMS;

EID: 79959768354     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44808-x_17     Document Type: Conference Paper

References (16)

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. 40th Annual Symposium on Foundations of Computer Science,pages 32–43,1999.
2. Ramesh Chandra. On n/1/(Formula Presented) dynamic deterministic systems. Naval Research Logistics Quarterly,26:537–544,1979.
3. Chekuri C., Mot wani R., Natarajan B., and Stein C. Approximation techniques for average completion time scheduling. Proceedings of Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,pages 609–18,1997.
4. Chengbin Chu. One-machine scheduling for minimizing total flow time with release dates. In Proceedings of Rensselaer’s Second Conference on C.I.M, pages 570–576, 1990.
5. Chengbin Chu. A branch-and-bound algorithm to minimize total flow time with unequal release dates. Naval Research Logistics,39:859–875,1992.
6. Pedro G. Gazmuri. Probabilistic analysis of a machine scheduling problem. Mathematics of Operations Research,10(2):328–339,1985.
7. Michel X. Goemans. Improved approximation algorithms for scheduling with release dates. In Proceedings of Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,1997.
8. A.M.A Hariri and C.N. Potts. An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics, 5:99–109,1983.
9. 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,pages 404–414,1996.
10. O.H. Ibarra and C.E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the Association for Computing Machinery, 22:463–468,1975.
11. Hans Kellerer, Thomas Tautenhahn, and Gerhard J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. SIAMJournal of Computing,28(4):1155–1166,1999.
12. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics,1:343–362,1977.
13. C. Phillips, C. Stein, and J. Wein. Minimizing average completion time in the presence of release dates. Mathematical Programming,82:199–223,1998.
14. Andreas S. Schulz and Martin Skutella. Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria. Technical Report 533/1996,T echnische Universität Berlin,Fachbereich Mathematik,1996.
15. W.E. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly,3:59–66,1956.
16. E. Torng and P. Uthaisombut. Lower bounds for srpt-subsequence algorithms for nonpreemptive scheduling. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms,pages 973–974,1999.