Minimizing average flow time on related machines

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 730-738

  Garg, Naveen ^a   Kumar, Amit ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

Approximation algorithms; Competitive ratio; Flow time; Scheduling

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SCHEDULING; TIME SERIES ANALYSIS;

APPROXIMATION ALGORITHMS; COMPETITIVE RATIO; FLOW TIME;

POLYNOMIAL APPROXIMATION;

EID: 33748096742     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132618     Document Type: Conference Paper

References (11)

1. N. Avrahami and Y. Azar. Minimizing total flow time and total completion time with immediate dispatching. In Proc. 15th Symp. on Parallel Algorithms and Architectures (SPAA), pages 11-18. ACM, 2003.
2. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, and Oded Regev. Minimizing the flow time without migration. In ACM Symposium on Theory of Computing, pages 198-205, 1999.
3. N. Bansal and K. Pruhs. Server scheduling in the 1 p norm: A rising tide lifts all boats. In ACM Symposium on Theory of Computing, pages 242-250, 2003.
4. Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Kirk R. Pruhs. Online weighted flow time and deadline scheduling. Lecture Notes in Computer Science, 2129:36-47, 2001.
5. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for weighted flow time. In ACM Symposium on Theory of Computing, pages 84-93. ACM, 2001.
6. Chandra Chekuri, Ashish Goel, Sanjeev Khanna, and Amit Kumar. Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In ACM Symposium on Theory of Computing, pages 363-372, 2004.
7. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling : a survey. Ann. Discrete Math., 5:287-326, 1979.
8. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. In IEEE Symposium on Foundations of Computer Science, pages 214-221, 1995.
9. Hans Kellerer, Thomas Tautenhahn, and Gerhard J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In ACM Symposium on Theory of Cmputing, pages 418-426, 1996.
10. Stefano Leonardi and Danny Raz. Approximating total flow time on parallel machines. In ACM Symposium on Theory of Computing, pages 110-119, 1997.
11. C. A. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation. In ACM Symposium on Theory of Computing, pages 140-149, 1997.