Minimizing flow time on a constant number of machines with preemption

Operations Research Letters

Volumn 33, Issue 3, 2005, Pages 267-273

  Bansal, Nikhil ^a  

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

Author keywords

Approximation schemes; Flow time; Multiple machines; Preemption; Scheduling

Indexed keywords

DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING;

FIRST IN FIRST OUT (FIFO); QUASI-POLYNOMIAL TIME APPROXIMATION SCHEME (QPTAS); SHORTEST REMAINING PROCESSING TIME (SRPT) ALGORITHM;

ALGORITHMS;

EID: 10044266293     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.07.008     Document Type: Article

References (13)

1. F.N. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Millis, M. Queyranne, M. Skutella, C. Stein, M. Sviridenko, Approximation schemes for minimizing average weighted completion time with release dates, in: IEEE Symposium on Foundations of Computer Science, 1999, pp. 32-43.
2. B. Awerbuch, Y. Azar, S. Leonardi, O. Regev, Minimizing the flow time without migration, in: ACM Symposium on Theory of Computing, 1999, pp. 198-205.
3. M.A. Bender, S. Chakrabarti, S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, in: ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998, pp. 270-279.
4. C. Chekuri, S. Khanna, Approximation schemes for preemptive weighted flow time, in: ACM Symposium on Theory of Computing (STOC), 2002.
5. J. Du, J.Y.T. Leung, G.H. Young, Minimizing mean flow time with release time constraint, Theor. Comput. Sci. 75 (1990) 347-355.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP Completeness, W.H. Freeman and Company, New York, 1979.
7. J.A. Hoogeveen, P. Schuurman, G.J. Woeginger, Non-approximability results for scheduling problems with minsum criteria, in: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1412, Springer, Berlin, 1998, pp. 353-366.
8. K. Jansen, L. Porkolab, Improved approximation schemes for scheduling unrelated parallel machines, in: ACM Symposium on Theory of Computing, 1999, pp. 408-417.
9. H. Kellerer, T. Tautenhahn, G.J. Woeginger, Approximability and nonapproximability results for minimizing total flow time on a single machine, in: ACM Symposium on Theory of Computing (STOC), 1996, pp. 418-426.
10. J.K. Lenstra, D.B. Shmoys, E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Math. Program. 46 (1990) 259-271.
11. S. Leonardi, D. Raz, Approximating total flow time on parallel machines, in: ACM Symposium on Theory of Computing (STOC), 1997, pp. 110-119.
12. L. Schrage, A proof of the optimality of the shortest processing remaining time discipline, Oper. Res. 16 (1968) 678-690.
13. P. Schuurman, G.J. Woeginger, Polynomial time approximation algorithms for machine scheduling: ten open problems, J. Sched. 2 (1999) 203-213.