Minimizing weighted flow time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 508-516

  Bansal, N ^a   Dhamdhere, K ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; ONLINE SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

QUASIPOLYNOMIAL TIME APPROXIMATION SCHEME; RESOURCE AUGMENTATION MODEL; SHORTEST REMAINING PROCESSING TIME; WEIGHTED FLOW TIME;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 0037739866     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

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, pages 32-43, 1999.
2. L. Becchetti, S. Leonardi, A. M. Spaccamela, and K. Pruhs. Online weighted flow time and deadline scheduling. In RANDOM-APPROX, pages 36-47, 2001.
3. P. Berman and C. Coulston. Speed is more powerful than clairvoyance. Nordic Journal of Computing, 6(2):181-193, 1999.
4. C. Chekuri and S. Khanna. Approximation schemes for preemptive weighted flow time. In ACM Symposium on Theory of Computing (STOC), 2002.
5. C. Chekuri, S. Khanna, and A. Zhu. Algorithms for weighted flow time. In ACM Symposium on Theory of Computing (STOC), 2001.
6. C. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 609-618, 1997.
7. L. A. Hall, A. S. Schulz, D. B. Shmoys, and J. Wein. Scheduling to minimize average completion time: Offline and online algorithms. Math. of Operations Research, 22:513-544, 1997.
8. S. Irani. Randomized weighted caching with two page weights. Algorithmica, 33:384-409, 2002.
9. B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
10. J. Lenstra, A. Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343-362, 1977.
11. R. Motwani, S. Phillips, and E. Torng. Nonclairvoyant scheduling. Theoretical Computer Science, 130(1):17-47, 1994.
12. L.E. Schrage. A proof of the optimality of the shortest processing remaining time discipline. Operations Research, 16:678-690, 1968.
13. W. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59-66, 1956.