Skip to main content
Springer Nature Link
Log in

Online Weighted Flow Time and Deadline Scheduling

  • Conference paper
  • First Online:
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (RANDOM 2001, APPROX 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2129))

Abstract

In this paper we study some aspects of weighted flow time on parallel machines. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|r i, pmtn| ΣwiFi. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for Deadline Scheduling. We finally give an O(1)-competitive algorithm for Deadline Scheduling.

L. Becchetti, S. Leonardi and A. Marchetti-Spaccamela were partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT), IST-2000-14084 (APPOL), IST-1999-10440 (Brahms) and by the MURST Projects “Algorithms for Large Data Sets: Science and Engineering” and “Resource Allocation in Computer Networks”.

K. Pruhs was supported in part by NSF grant CCR-9734927 and by a grant from the US Airforce.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. S. Aacharya, and S. Muthukrishnan, “Scheduling on-demand broadcasts: new metrics and algorithms”, 4th ACM/IEEE International Conference on Mobile Computing and Networking, 43–54, 1998.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  6. Vincenzo Liberatore, “Scheduling jobs before shut-down”, SWAT, 2000.

    Google Scholar 

  7. S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 110–119, El Paso, Texas, 1997.

    Google Scholar 

  8. B. Kalyanasundaram, and K. Pruhs, “Speed is as powerful as clairvoyance”, IEEE Symposium on Foundations of Computation, 214–221, 1995.

    Google Scholar 

  9. B. Kalyanasundaram, and K. Pruhs. Minimizing Flow Time Nonclairvoyantly. In Proc. of IEEE Symposium on Foundations of Computer Science (FOCS’ 97), 1997, pages 345–352.

    Google Scholar 

  10. B. Kalyanasundaram, K. Pruhs, and M. Velauthapillai, “Scheduling broadcasts in wireless networks”, European Symposium on Algorithms (ESA), 2000.

    Google Scholar 

  11. Phillips, Stein, E. Torng, and J. Wein “Optimal time-critical scheduling via resource augmentation”, ACM Symposium on Theory of Computing, 140–149, 1997.

    Google Scholar 

  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.

    Google Scholar 

  13. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann and A. Marchetti-Spaccamela. Complexity and Approximation. Springer eds., 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, University of Rome “La Sapienza”, USA

    Luca Becchetti, Stefano Leonardi & Alberto Marchetti-Spaccamela

  2. Computer Science Department, University of Pittsburgh, USA

    Kirk R. Pruhs

Authors
  1. Luca Becchetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Leonardi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alberto Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kirk R. Pruhs
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, Massachusetts Institute of Technology, MIT, Cambridge, MA, 02139, USA

    Michel Goemans

  2. Institute for Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

  3. Centre Universitaire d’Informatique, Université de Genéve, 24, Rue General Dufour, 1211, Genéve 4, Switzerland

    José D. P. Rolim

  4. Computer Science Division, University of California at Berkeley, 615 Soda Hall, Berkeley, CA, 94720-1776, USA

    Luca Trevisan

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Pruhs, K.R. (2001). Online Weighted Flow Time and Deadline Scheduling. In: Goemans, M., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. RANDOM APPROX 2001 2001. Lecture Notes in Computer Science, vol 2129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44666-4_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-44666-4_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42470-3

  • Online ISBN: 978-3-540-44666-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics