Approximating total flow time on parallel machines

Journal of Computer and System Sciences

Volumn 73, Issue 6, 2007, Pages 875-891

  Leonardi, Stefano ^a   Raz, Danny ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; Competitive analysis; Flow time optimization; On line algorithms; Parallel machine scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; ONLINE SYSTEMS; OPTIMIZATION; QUALITY OF SERVICE;

COMPETITIVE ANALYSIS; FLOW TIME OPTIMIZATION; ONLINE ALGORITHMS; PARALLEL MACHINE SCHEDULING;

PARALLEL PROCESSING SYSTEMS;

EID: 34250161300     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2006.10.018     Document Type: Article

References (22)

1. N. Avrahami, Y. Azar, Minimizing total flow time and total completion time with immediate dispatching, in: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms, 2003, pp. 11-18
2. Awerbuch B., Azar Y., Leonardi S., and Regev O. Minimizing the flow time without migration. SIAM J. Comput. 31 5 (2001) 1370-1382
3. Baker K.R. Introduction to Sequencing and Scheduling (1974), Wiley, New York
4. N. Bansal, K. Dhamdhere, Minimizing weighted flow time, in: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 508-516
5. Becchetti L., and Leonardi S. Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. J. ACM 4 51 (2004) 517-539
6. Becchetti L., Leonardi S., and Muthukrishnan S. Scheduling to minimize average stretch without migration. J. Comput. System Sci. 68 (2004) 80-95
7. C. Chekuri, S. Khanna, A. Zhu, Algorithms for minimizing weighted flow time, in: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 84-93
8. Du J., Leung J.Y.T., and Young G.H. Minimizing mean flow time with release time constraint. Theoret. Comput. Sci. 75 (1990) 347-355
9. Sgall J. On-line scheduling. In: Fiat A., and Woeginger G. (Eds). Online Algorithms: The State of the Art (1998), Springer-Verlag
10. Garey M.R., and Johnson D.S. Computers and Intractability (1979), Freeman and Company, San Francisco
11. Hall L. Approximation algorithms for scheduling. In: Hochbaum D. (Ed). Approximation Algorithms for NP-Hard Problems (1997), PWS Publisher, Boston
12. Kalyanasundaram B., and Pruhs K.R. Minimizing flow time nonclairvoyantly. J. ACM 50 4 (2003) 551-567
13. H. Kellerer, T. Tautenhahn, G.J. Woeginger, Approximability and nonapproximability results for minimizing total flow time on a single machine, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, 1996, pp. 418-426
14. Hall L.A., Schulz A.S., Shmoys D.B., and Wein J. Scheduling to minimize average completion time: Off-line and on-line algorithms. Math. Oper. Res. 22 3 (1997) 513-544
15. Leonardi S. A simpler proof of preemptive total flow time approximation on parallel machines. In: Bampis E. (Ed). Efficient Approximation and Online Algorithms, Recent Progress on Classical Combinatorial Optimization Problems and New Applications. Lecture Notes in Comput. Sci. vol. 3484 (2006), Springer-Verlag 203-212
16. S. Leonardi, D. Raz, Approximating total flow time on parallel machines. in: Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 110-119
17. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. Sequencing and scheduling: Algorithms and complexity. Handbooks in Operations Research and Management Science, vol. 4: Logistics of Production and Inventory (1990)
18. Lenstra J.K. Sequencing by Enumerative Methods. Math. Centre Tracts vol. 69 (1977), Mathematisch Centrum, Amsterdam
19. Motwani R., Phillips S., and Torng E. Non-clairvoyant scheduling. Theoret. Comput. Sci. 130 (1994) 17-47
20. S. Muthukrishnan, R. Rajaraman, R. Shaheen, J. Gehrke, Online scheduling to minimize average stretch, in: Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, 1999, pp. 433-442
21. Pruhs K., Torng E., and Sgall J. Online scheduling. In: Leung J.Y.-T. (Ed). Handbook of Scheduling: Algorithms, Models, and Performance Analysis (2004), CRC Press 15-1-15-41 (Chapter 15)
22. Schurman P., and Woeginger G.J. Polynomial time approximation algorithms for machine scheduling. Ten open problems. J. Sched. 2 (1999) 203-213