Online weighted flow time and deadline scheduling

Journal of Discrete Algorithms

Volumn 4, Issue 3, 2006, Pages 339-352

  Becchetti, Luca ^a   Leonardi, Stefano ^a   Marchetti Spaccamela, Alberto ^a   Pruhs, Kirk ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

On line; Scheduling; Weighted flow time

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FINITE DIFFERENCE METHOD; SCHEDULING;

APPROXIMATION ALGORITHM; DEADLINE SCHEDULING; WEIGHTED FLOW TIME;

ONLINE SYSTEMS;

EID: 33747828437     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.12.001     Document Type: Article

References (12)

1. S. Aacharya, S. Muthukrishnan, Scheduling on-demand broadcasts: New metrics and algorithms, in: 4th ACM/IEEE International Conference on Mobile Computing and Networking, 1998, pp. 43-54
2. N. Bansal, K. Dhamdhere, Minimizing weighted response time, in: ACM/SIAM Symposium on Discrete Algorithms, 2003, pp. 508-516
3. p norm, in: Latin American Theoretical INformatics, 2004, pp. 434-443
4. C. Chekuri, S. Khanna, Approximation schemes for preemptive weighted flow time, in: ACM Symposium on Theory of Computing, 2001
5. C. Chekuri, S. Khanna, A. Zhu, Algorithms for minimizing weighted flow time, in: ACM/SIAM Symposium on Theory of Computing, 2001
6. Labetoulle J., Lawler E., Lenstra J.K., and Rinnooy Kan A. Preemptive scheduling of uniform machines subject to release dates. In: Pulleyblank W.R. (Ed). Progress in Combinatorial Optimization (1984), Academic Press, New York 245-261
7. Liberatore V. Scheduling jobs before shut-down. Nordic J. Comput. 7 3 (2000) 204-226
8. S. Leonardi, D. Raz, Approximating total flow time on parallel machines, in: ACM Symposium on Theory of Computing, 1997, pp. 110-119
9. Kalyanasundaram B., and Pruhs K. Speed is as powerful as clairvoyance. J. ACM 47 4 (2000) 617-643
10. B. Kalyanasundaram, K. Pruhs, Minimizing flow time nonclairvoyantly, in: IEEE Symposium on Foundations of Computer Science, 1997, pp. 345-352
11. C. Phillips, C. Stein, E. Torng, J. Wein, Optimal time-critical scheduling via resource augmentation, in: ACM Symposium on Theory of Computing, 1997, pp. 140-149
12. Ausiello G., Crescenzi P., Gambosi G., Kann V., and Marchetti-Spaccamela A. Complexity and Approximation (1999), Springer, Berlin