1.47-Approximation algorithm for a preemptive single-machine scheduling problem

Operations Research Letters

Volumn 26, Issue 4, 2000, Pages 149-154

  Goemans, Michel X ^a   Wein, Joel M ^b   Williamson, David P ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING; PROCESS CONTROL; RELAXATION PROCESSES; SCHEDULING;

SINGLE-MACHINE DETERMINISTIC SCHEDULING; SUBOPTIMAL ALGORITHMS;

PRODUCTION CONTROL;

EID: 0033733029     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(00)00024-9     Document Type: Article

References (9)

1. S. Chakrabarti, C. Phillips, A.S. Schulz, D. Shmoys, C. Stein, J. Wein, Improved approximation algorithms for minsum criteria, in: Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 1099, F. Meyer auf der Heide, B. Monien (Ed.), Springer, Berlin, 1996, pp. 646-657.
2. Goemans M.X. A supermodular relaxation for scheduling with release dates. Cunningham W.H., McCormick S.T., Queyranne M. Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. Vol. 1084:1996;288-300 Springer, Berlin.
3. M.X. Goemans, Improved approximation algorithms for scheduling with release dates, Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 591-598.
4. Hall L.A., Schulz A.S., Shmoys D.B., Wein J. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res. 22:1997;513-544.
5. Labetoulle J., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Preemptive scheduling of uniform machines subject to release dates. Pulleyblank W.R. Progress in Combinatorial Optimization. 1984;245-261 Academic Press, New York.
6. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. Sequencing and scheduling: algorithms and complexity. Graves S.C., Rinnooy Kan A.H.G., Zipkin P.H. Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory. 1993;445-522 North-Holland, Amsterdam.
7. Phillips C., Stein C., Wein J. Minimizing average completion time in the presence of release dates. Math. Programming B. 82:1998;199.
8. A.S. Schulz, M. Skutella, Scheduling-LPs bear probabilities: randomized approximations for min-sum criteria, Technical Report 533 / 1996, Technische Universität Berlin, Fachbereich Mathematik, 1996.
9. Schulz A.S., Skutella M. Scheduling-LPs bear probabilities: randomized approximations for min-sum criteria. Burkard R., Woeginger G. Algorithms - ESA'97. Lecture Notes in Computer Science. Vol. 1284:1997;416-429 Springer, Berlin.