Minimizing total flow time and total completion time with immediate dispatching

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 11-18

  Avrahami, Nir ^a   Azar, Yossi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Competitive; Completion time; Flow time; On line

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; PROBLEM SOLVING; WORLD WIDE WEB;

COMPLETION TIME;

SCHEDULING;

EID: 0037703400     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777412.777415     Document Type: Conference Paper

References (15)

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. In IEEE Symposium on Foundations of Computer Science, pages 32-44, 1999.
2. B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In Proc. 31st ACM Symp. on Theory of Computing, pages 198-205, 1999.
3. K.R. Baker. Introduction to Sequencing and Scheduling. Wiley, 1974.
4. S. Chakrabarti, C. A. Phillips, A. S. Schulz, D. B. Shmoys, C. Stein, and J. Wein. Improved scheduling algorithms for minsum criteria. In Proc. 23rd International Colloquium on Automata, Languages and Programming, pages 646-657, 1996.
5. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for minimizing weighted flow time. In Proc. 33rd ACM Symp. on Theory of Computing, pages 84-93, 2001.
6. C. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, pages 609-618, 1997.
7. 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.
8. L. Hall, D. Shmoys, and J. Wein. Scheduling to minimize average completion time: Off-line and on-line algorithms. In Proc. of 7th ACM-SIAM Symposium on Discrete Algorithms, pages 142-151, 1996.
9. L.A. Hall. Approximation algorithms for scheduling. In D.S. Hochbaum, editor, Approximation algorithms for NP-hard problems, pages 1-45. PWS publishing company, 1997.
10. J. A. Hoogeveen and Arjen P. A. Vestjens. Optimal on-line algorithms for single-machine scheduling. In Proc. 5th Conf. Integer Programming and Combinatorial Optimization, pages 404-414, 1996.
11. H. Kellerer, T. Tautenhahn, and G. J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 418-426, Philadelphia, Pennsylvania, 1996.
12. E.L. Lawler, J.K Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. Sequencing and scheduling: algorithms and complexity. In Handbooks in operations research and management science, volume 4, pages 445-522. North Holland, 1993.
13. 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.
14. C. Phillips, C. Stein, and J. Wein. Minimizing average completion time in the presence of release dates. In Proc. 4th Workshop on Algorithms and Data Structures, pages 86-97, 1995.
15. L. Stougie and A. Vestjens. Randomized on-line scheduling: How low can't you go, 1997.