Approximability and nonapproximability results for minimizing total flow time on a single machine

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 418-426

  Kellerer, Hans ^a   Tautenhahn, Thomas ^b   Woeginger, Gerhard J ^c  

^a UNIVERSITY OF GRAZ   (Austria)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Approximation algorithm; Release time; Scheduling; Single machine; Total flow time; Worst case analysis

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SCHEDULING; SCHEDULING ALGORITHMS; ALGORITHMS; OPTIMIZATION; PERFORMANCE; PROBABILITY; PROBLEM SOLVING;

PERFORMANCE GUARANTEES; POLYNOMIAL TIME APPROXIMATION; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RELEASE TIME; SINGLE- MACHINES; TOTAL FLOWTIME; WORST-CASE ANALYSIS; WORST-CASE PERFORMANCE; SINGLE MACHINE; TOTAL FLOW TIME PROBLEM; WORST CASE ANALYSIS;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY;

EID: 0029723165     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237989     Document Type: Conference Paper

References (18)

1. R. H. Ahmadi and U. Bagchi, "Lower bounds for singlemachine scheduling problems", Naval Res. Logist. 37, 967-979 (1990).
2. K. R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.
3. L. Bianco and S. Ricciardelli, "Scheduling of a single machine to minimize total weighted completion time subject to release dates", Navai Res. Logist. 29, 151-167 (1982).
4. R. Chandra, "On n|l|F dynamic deterministic problems", Naval Res. Logist. 26, 537-544 (1979).
5. C. Chu, "Efficient heuristics to minimize total flow time with release dates", Oper. Res. Lett. 12, 321-330 (1992).
6. C. Chu, "A branch-and-bound algorithm to minimize total flow time with unequal release dates", Naval Res. Logist. 39, 859-875 (1992).
7. J. S. Deogun, "On scheduling with ready times to minimize mean flow time", Comput. J. 26, 320-328 (1983).
8. M. I. Dessouky and J. S. Deogun, "Sequencing jobs with unequal ready times to minimize mean flow time", SIAM J. Comput. 10, 192-202 (1981).
9. J. Du, J. Y. T. Leung and G. H. Young, "Minimizing mean flow time with release time constraint", Theoretical Computer Science 75, 347-355 (1990).
10. M. E. Dyer and L. A. Wolsey, "Formulating the single machine sequencing problem with release dates as a mixed integer program", Discr. Appl. Math. 26, 255-270 (1990).
11. M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman and Company, San Francisco, 1979.
12. P. G. Gazmuri, "Probabilistic analysis of a machine scheduling problem", Math. Oper. Res. 10, 328-339 (1985).
13. A. M. A. Hariri and C. N. Potts, "An algorithm for single machine sequencing with release times to minimize total weighted completion time", Discr. Appl. Math. 5, 99-109 (1983).
14. J. Labetoulle, E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, "Preemptive scheduling of uniform machines subject to release dates", Progress in Combinatorial Optimization, Academic Press, New York, 245-261 (1984).
15. J. K. Lenstra, A. H. G. Rinnooy Kan and P. Brucker, "Complexity of machine scheduling problems", Ann. Discrete Math. 1, 343-362 (1977).
16. Cj", unpublished manuscript.
17. M. E. Posner, "Minimizing weighted completion times with deadlines", Oper. Research 33, 562-574 (1985).
18. W. E. Smith, "Various optimizers for single-state production", Naval Res. Logist. Quart. 3, 56-66 (1956).