Minimizing weighted flow time

ACM Transactions on Algorithms

Volumn 3, Issue 4, 2007, Pages

  Bansal, Nikhil ^a   Dhamdhere, Kedar ^b  

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

^b GOOGLE INC   (United States)

Author keywords

Nonclairvoyant scheduling; Online algorithms; Response time; Scheduling

Indexed keywords

NONCLAIRVOYANT SCHEDULING; ONLINE ALGORITHMS; RESPONSE TIME;

ALGORITHMS; APPROXIMATION THEORY; JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING;

OPTIMIZATION;

EID: 36448942971     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1290672.1290676     Document Type: Conference Paper

References (28)

1. AFRATI, F., BAMPIS, E., CHEKURI, C., KARGER, D., KENYON, C., KHANNA, S., MILLIS, I., QUEYRANNE, M., SKUTELLA, M., STEIN, C., AND SVIRIDENKO, M. 1999. Approximation schemes for minimizing average weighted completion time with release dates. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), 32-43.
2. AVRAHAMI, N., AND AZAR, Y. 2003. Minimizing total flow time and completion time with immediate dispacthing. In Proceedings of 15th ACM Annual Symposium on Paralllelism Alogrithms and Architectures (SPAA), 11-18.
3. AWERBUCH, B., AZAR, Y., LEONARDI, S., AND REGEV, O. 1999. Minimizing the flow time without migration. In Proceedings of the ACM Symposium on Theory of Computing, 198-205.
4. BANSAL, N. 2005. Minimizing flow time on a constant number of machines with preemption. Oper. Res. Lett. 33, 267-273.
5. BANSAL, N., DHAMDHERE, K., KONEMANN, J., AND SINHA, A. 2003. Non-Clairvoyant scheduling for minimizing mean slowdown. In Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS), 260-270.
6. p norm: A rising tide lifts all boats. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 242-250.
7. p norm. In Proceedings of the Latin American Symposium on Theoretical Informatics (LATIN), 434-443.
8. BECCHETTI, L., AND LEONARDI, S. 2004. Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM 51, 517-539.
9. BECCHETTI, L., LEONARDI, S., AND MUTHUKRISHNAN, S. 2000. Scheduling to minimize average stretch without migration. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 548-557.
10. BECCHETTI, L., LEONARDI, S., SPACCAMELA, A. M., AND PRUHS, K. 2001. Online weighted flow time and deadline scheduling. In Proceedings of the International Workshop on Randomination and Approximation Techniques (RANDOM-APPROX), 36-47.
11. BENDER, M., CHAKRABARTI, S., AND MUTHUKRISHNAN, S. 1998. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 270-279.
12. BENDER, M., MUTHUKRISHNAN, S., AND RAJARAMAN, R. 2002. Improved algorithms for stretch scheduling. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).
13. CHEKURI, C., GOEL, A., KHANNA, S., AND KUMAR, A. 2004. Multi-Processor scheduling to minimize flow time with epsilon resource augmentation. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 363-372.
14. CHEKURI, C., AND KHANNA, S. 2002. Approximation schemes for preemptive weighted flow time. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 297-305.
15. CHEKURI, C., KHANNA, S., AND ZHU, A. 2001. Algorithms for weighted flow time. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 84-93.
16. CHEKURI, C., MOTWANI, R., NATARAJAN, B., AND STEIN, C. 1997. Approximation techniques for average completion time scheduling. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 609-618.
17. HALL, L. A., SCHULZ, A. S., SHMOYS, D. B., AND WEIN, J. 1997. Scheduling to minimize average completion time: Offline and online algorithms. Math. Oper. Res. 22, 513-544.
18. KALYANASUNDARAM, B., AND PRUHS, K. 2000. Speed is as powerful as clairvoyance. J. ACM 47, 4, 617-643.
19. KALYANASUNDARAM, B., AND PRUHS, K. 2003. Minimizing flow time nonclairvoyantly. J. ACM 50, 551-567.
20. KELLERER, H., TAUTENHAHN, T., AND WOEGINGER, G. J. 1996. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 418-426.
21. LENSTRA, J., KAN, A., AND BRUCKER, P. 1977. Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343-362.
22. LEONARDI, S., AND RAZ, D. 1997. Approximating total flow time on parallel machines. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 110-119.
23. MOTWANI, R., PHILLIPS, S., AND TORNG, E. 1994. Nonclairvoyant scheduling. Theor. Comput. Sci. 130, 1, 17-47.
24. MUTHUKRISHNAN, S., RAJARAMAN, R., SHAHEEN, A., AND GEHRKE, J. 1999. Online scheduling to minimize average stretch. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), 433-442.
25. PHILLIPS, C. A., STEIN, C., TORNG, E., AND WEIN, J. 1997. Optimal time-critical scheduling via resource augmentation. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 140-149.
26. PRUHS, K., SGALL, J., AND TORNG, E. 2004. Online scheduling. In Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Ratan, FL, Chap. 35 CRC Press.
27. SCHRAGE, L. 1968. A proof of the optimality of the shortest processing remaining time discipline. Oper. Res. 16, 678-690.
28. SMITH, W. 1956. Various optimizers for single-stage production. Naval Res. Logistics Quart. 3, 59-66.