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

SIAM Journal on Computing

Volumn 28, Issue 4, 1999, Pages 1155-1166

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

^a UNIVERSITY OF GRAZ   (Austria)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; JUST IN TIME PRODUCTION; OPTIMIZATION; POLYNOMIALS; SCHEDULING;

RELEASE TIME; TOTAL FLOW TIME; WORST CASE ANALYSIS;

COMPUTATIONAL COMPLEXITY;

EID: 0032678645     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796305778     Document Type: Article

References (19)

1. R.H. AHMADI AND U. BAGCHI, Lower bounds for single-machine scheduling problems, Naval Res. Logist., 37 (1990), pp. 967-979.
2. K.R. BAKER, Introduction to Sequencing and Scheduling, John 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, Naval Res. Logist., 29 (1982). pp. 151-167.
4. R. CHANDRA, On n\1\F̄ dynamic deterministic problems, Naval Res. Logist., 26 (1979), pp. 537-544.
5. C. CHU, Efficient heuristics to minimize total flow time with release dates, Oper. Res. Lett., 12 (1992), pp. 321-330.
6. C. CHU, A branch-and-bound algorithm to minimize total flow time with unequal release dates, Naval Res. Logist., 39 (1992), pp. 859-875.
7. J.S. DEOGUN, On scheduling with ready times to minimize mean flow time, Comput. J., 26 (1983), pp. 320-328.
8. M.I. DESSOUKY AND J.S. DEOGUN, Sequencing jobs with unequal ready times to minimize mean flow time, SIAM J. Comput., 10 (1981), pp. 192-202.
9. J. DU, J.Y.T. LEUNG, AND G.H. YOUNG, Minimizing mean flow time with release time constraint, Theoret. Comput. Sci., 75 (1990), pp. 347-355.
10. M.E. DYER AND L.A. WOLSEY, Formulating the single machine sequencing problem with release dates as a mixed integer program, Discrete Appl. Math., 26 (1990), pp. 255-270.
11. M.R. GAREY AND D.S. JOHNSON, Computers and Intractability, W. H. Freeman, San Francisco, 1979.
12. P.G. GAZMURI, Probabilistic analysis of a machine scheduling problem, Math. Oper. Res., 10 (1985), pp. 328-339.
13. A.M.A. HARIRI AND C.N. POTTS, An algorithm for single machine sequencing with release times to minimize total weighted completion time, Discrete Appl. Math., 5 (1983), pp. 99-109.
14. J. LABETOULLE, E.L. LAWLER, J.K. LENSTRA, AND A.H.G. RINNOOY KAN, Preemptive scheduling of uniform machines subject to release dates, in Progress in Combinatorial Optimization, Academic Press, New York, 1984, pp. 245-261.
15. J.K. LENSTRA, A.H.G. RINNOOY KAN, AND P. BRUCKER, Complexity of machine scheduling problems, Ann. Discrete Math., 1 (1977), pp. 343-362.
16. S. LEONARDI AND D. RAZ, Approximating total flow time on parallel machines, in Proc. 29th Annual ACM Symposium on the Theory of Computing, El Paso, TX, 1997.
17. W. MAO AND A. RIFKIN, On-line algorithms for a single machine scheduling problem, in The Impact of Emerging Technologies on Computer Science and Operations Research, S. Nash and A. Sofer, eds., Kluwer Academic Publishers, Norwell, MA, 1995, pp. 157-173.
18. M.E. POSNER, Minimizing weighted completion times with deadlines, Oper. Res., 33 (1985), pp. 562-574.
19. W.E. SMITH, Various optimizers for single-state production, Naval Res. Logist. Quart., 3 (1956), pp. 56-66.