A simpler proof of preemptive total flow time approximation on parallel machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3484 LNCS, Issue , 2006, Pages 203-212

  Leonardi, Stefano ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; JOB ANALYSIS; PROBLEM SOLVING;

FLOW TIME APPROXIMATION; PARALLEL MACHINES; SCHEDULING JOBS;

PARALLEL PROCESSING SYSTEMS;

EID: 34250216875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671541_7     Document Type: Article

References (9)

1. F. N. Afrati, E. Bampis, C. Chekuri, D. R. Karger, C. Kenyon, S. Khanna, I. Milis, M. Queyranne, M. Skutella, C. Stein and M. Sviridenko. Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 1999), pp. 32-44, 1999.
2. B. Awerbuch, Y. Azar, S. Leonardi and O. Regev. Minimizing the flow time without migration. Proc. of the 31st annual ACM Symposim on Theory of Computing, pp. 198-205, 1999.
3. L. Becchetti and S. Leonardi. Non-Clairvoyant scheduling to minimize the average flow time on single and parallel machines. Proc. of the 33rd annual ACM Symposim on Theory of Computing, pp. 94-103, 2001.
4. K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.
5. J. Du, J. Y. T. Leung, and G. H. Young. Minimizing mean flow time with release time constraint. Theoretical Computer Science, 75(3):347-355, 1990.
6. L. Hall, Andreas S. Schulz, D. Shmoys and J. Wein. Scheduling to minimize average completion time: off-line and on-line approximation algorithms. In Mathematics of Operations Research 22, pp. 513-544, 1997.
7. H. Kellerer, T. Tautenhahn and G.J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. SIAM Journal on Computing, Vol. 28, Number 4, pp. 1155-1166, 1999.
8. S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 110-119, El Paso, Texas, 1997.
9. To appear in Journal of Computer and System Sciences - special issue for STOC '97.