Minimizing flow time on a constant number of machines with preemption

We consider offline algorithms for minimizing the total flow time on O(1) machines where jobs can be preempted arbitrarily but migrations are disallowed. Our main result is a quasi-polynomial time approximation scheme for minimizing the total flow time. We also consider more general settings and give some hardness results.

[1]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 1997, STOC '97.

[2]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[3]  Sanjeev Khanna,et al.  Approximation schemes for preemptive weighted flow time , 2002, STOC '02.

[4]  Han Hoogeveen,et al.  Non-Approximability Results for Scheduling Problems with Minsum Criteria , 1998, INFORMS J. Comput..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Evripidis Bampis,et al.  Approximation schemes for minimizing average weighted completion time with release dates , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[7]  Gerhard J. Woeginger,et al.  Approximability and nonapproximability results for minimizing total flow time on a single machine , 1996, STOC '96.

[8]  Joseph Y.-T. Leung,et al.  Minimizing Mean Flow Time with Release Time Constraint , 1990, Theor. Comput. Sci..

[9]  Michael A. Bender,et al.  Flow and stretch metrics for scheduling continuous job streams , 1998, SODA '98.

[10]  Gerhard J. Woeginger,et al.  Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[11]  Klaus Jansen,et al.  Improved approximation schemes for scheduling unrelated parallel machines , 1999, STOC '99.

[12]  Yossi Azar,et al.  Minimizing the flow time without migration , 1999, STOC '99.

[13]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..