Better algorithms for minimizing average flow-time on related machines

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

Volumn 4051 LNCS, Issue , 2006, Pages 181-190

  Garg, Naveen ^a   Kumar, Amit ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; ONLINE SYSTEMS;

FLOW-TIME; OFFLINE; RELATED MACHINES;

COMPUTER PROGRAMMING;

EID: 33746338274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_17     Document Type: Conference Paper

References (8)

1. Nir Avrahami and Yossi Azar. Minimizing total flow time and total completion time with immediate dispatching. In SPAA, pages 11-18, 2003.
2. Awerbuch, Azar, Leonardi, and Regev. Minimizing the flow time without migration. In STOC: ACM Symposium on Theory of Computing (STOC), 1999.
3. Chekuri, Khanna, and Zhu. Algorithms for minimizing weighted flow time. In STOC: ACM Symposium on Theory of Computing (STOC), 2001.
4. Garg and Kumar. Minimizing average flow time on related machines. In STOC: ACM Symposium on Theory of Computing (STOC), 2006.
5. Goel. B.tech thesis. In Computer Science and Engineering, IIT Delhi, 2004.
6. Michel X. Goemans. Improved approximation algorthims for scheduling with release dates. In SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, pages 591-598, Philadelphia, PA, USA, 1997. Society for Industrial and Applied Mathematics.
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 Mathematics, 5:287-326, 1979.
8. Stefano Leonardi and Danny Raz. Approximating total flow time on parallel machines. In STOC, pages 110-119, 1997.