Weighted flow time does not admit O(1)-competitive algorithms

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 1238-1244

  Bansal, Nikhil ^a   Chan, Ho Leung ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

AMPLIFICATION TECHNIQUE; COMPETITIVE ALGORITHMS; COMPETITIVE RATIO; DETERMINISTIC ONLINE ALGORITHMS; NON-TRIVIAL ALGORITHMS; ON-LINE ALGORITHMS; ONLINE SCHEDULING; SINGLE- MACHINES;

SCHEDULING ALGORITHMS;

EID: 70349094443     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.134     Document Type: Conference Paper

References (18)

1. F. Afrati, E. Bampis, C. Chekuri, D. Karger, C. Kenyon, S. Khanna, I. Millis, 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 (FOCS), pages 32-43, 1999. (Pubitemid 129306182)
2. th SPAA, pages 11-18, 2003.
3. B. Awerbuch, Y. Azar, S. Leonardi, and O. Regev. Minimizing the flow time without migration. In ACM Symposium on Theory of Computing (STOC), pages 198-205, 1999.
4. N. Bansal. Minimizing flow time on a constant number of machines with preemption. Oper. Res. Lett., 33:267-273, 2005.
5. N. Bansal and K. Dhamdhere. Minimizing weighted flow time. ACM Transactions on Algorithms, (SODA 2002 and 2003 special issue), 3(4), 2007.
6. p norm: A rising tide lifts all boats. In ACM Symposium on Theory of Computing (STOC), pages 242-250, 2003.
7. L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, and K. Pruhs. Online weighted flow time and deadline scheduling. In Proceedings of RANDOM-APPROX, pages 36-47, 2001.
8. M. Bender, S. Muthukrishnan, and R. Rajaraman. Improved algorithms for stretch scheduling. In 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.
9. C. Chekuri, A. Goel, S. Khanna, and A. Kumar. Multi-processor scheduling to minimize flow time with epsilon resource augmentation. In ACM Symposium on Theory of Computing (STOC), pages 363-372, 2004.
10. C. Chekuri and S. Khanna. Approximation schemes for preemptive weighted flow time. In Proceedings of ACM Symposium on Theory of Computing (STOC), pages 297-305, 2002. (Pubitemid 35009389)
11. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for minimizing weighted flow time. In Proceedings on 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 84-93, 2001.
12. H. Kellerer, T. Tautenhahn, and G. J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In ACM Symposium on Theory of Computing (STOC), pages 418-426, 1996.
13. J. Lenstra, A. Kan, and P. Brucker. Complexity of machine scheduling problems. In Annals of Discrete Mathematics, number 1, pages 343-362, 1977.
14. S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In ACM Symposium on Theory of Computing (STOC), pages 110-119, 1997.
15. R. Motwani, S. Phillips, and E. Torng. Nonclairvoyant scheduling. Theoretical Computer Science, 130(1):17-47, 1994.
16. S. Muthukrishnan, R. Rajaraman, A. Shaheen, and J. Gehrke. Online scheduling to minimize average stretch. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 433-442, 1999.
17. K. Pruhs. Competitive online scheduling for server systems. ACM SIGMETRICS Perform. Eval. Rev., 34(4):52-58, 2007.
18. K. Pruhs, J. Sgall, and E. Torng. Online scheduling. Chapter 35, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, CRC Press, 2004.