Online weighted flow time and deadline scheduling

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

Volumn 2129, Issue , 2015, Pages 36-47

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

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b University of Pittsburgh   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; RANDOM PROCESSES; SCHEDULING; SCHEDULING ALGORITHMS; SOCIAL NETWORKING (ONLINE);

COMPETITIVE ALGORITHMS; DEADLINE SCHEDULING; FLOW-TIME; ON-LINE ALGORITHMS; PARALLEL MACHINE; UNIPROCESSORS;

APPROXIMATION ALGORITHMS;

EID: 84923069447     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. S. Aacharya, and S. Muthukrishnan, “Scheduling on-demand broadcasts: newmetricsand algorithms”, 4th ACM/IEEE International Conference on Mobile Computing and Networking, 43–54, 1998.
2. Y. Bartal, and S. Muthukrishnan, “Minimizing Maximum Response Time in Scheduling Broadcasts”, 558-559, Proceedings of the Eleventh Annual ACM/SIAM Symposium on Discrete Algorithms, pages 558-559, 2000.
3. M. Goemans, “A Supermodular Relaxation for Scheduling with Release Dates”. In Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization (IPCO 96), LNCS 1084, Springer, pp. 288-300, 1996.
4. J. Labetoulle, E. Lawler, J.K. Lenstra, A. Rinnooy Kan, “Preemptive scheduling of uniform machines subject to release dates”, in W.R. Pulleyblank (eds.), Progress in Combinatorial Optimization, 245–261, Academic Press, 1984.
5. E. Lawler, J.K. Lenstra, A. Rinnooy Kan, and D. Shmoys, “Sequencing and Scheduling: Algorithms and Complexity”, Logistics of Production and Inventory, Handbooks in OR & MS 4, Elsevier Science, Chapter 9, 445–522, 1993.
6. Vincenzo Liberatore, “Scheduling jobs before shut-down”, SWAT, 2000.
7. S. Leonardi and D. Raz. Approximating total flowtime on parallel machines. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 110–119, El Paso, Texas, 1997.
8. B. Kalyanasundaram, and K. Pruhs, “Speed is as powerful as clairvoyance”, IEEE Symposium on Foundations of Computation, 214-221, 1995.
9. B. Kalyanasundaram, and K. Pruhs. Minimizing FlowTime Nonclairvoyantly. In Proc. of IEEE Symposium on Foundations of Computer Science (FOCS’97), 1997, pages 345-352.
10. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai, “Scheduling broadcasts in wireless networks”, European Symposium on Algorithms (ESA), 2000.
11. C. Phillips, C. Stein, E. Torng, and J. Wein “Optimal time-critical scheduling via resource augmentation”, ACM Symposium on Theory of Computing, 140 – 149, 1997.
12. J. Shanmugasundaram, A. Nithrakashyap, R. Sivasankaran, and K. Ramamritham, “Efficient concurrency control for broadcast environments”, Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data (SIGMOD 99), pages 85–96, 1999.
13. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann and A. Marchetti-Spaccamela. Complexity and Approximation. Springer eds., 1999.