Skip to main content
SpringerLink
Log in

Open Problems in Throughput Scheduling

  • Conference paper
Book cover Algorithms – ESA 2012 (ESA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7501))

Included in the following conference series:

Abstract

In this talk we survey the area of scheduling with the objective to maximize the throughput, i.e., the (weighted) number of completed jobs. We focus on several open problems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Baptiste, P., Brucker, P., Knust, S., Timkovsky, V.: Ten notes on equal-execution-time scheduling. 4OR 2, 111–127 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baptiste, P., Schieber, B.: A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness. J. Sched. 6, 395–404 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baptiste, P.: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. Sched. 2, 245–252 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baruah, S.K., Haritsa, J., Sharma, N.: On-line scheduling to maximize task completions. J. Comb. Math. Comb. Comput. 39, 65–78 (2001)

    MathSciNet  MATH  Google Scholar 

  5. Bieńkowski, M., Chrobak, M., Dürr, C., Hurand, M., Jeż, A., Jeż, Ł., Stachowiak, G.: Collecting weighted items from a dynamic queue. To appear in ACM Trans. Algorithms

    Google Scholar 

  6. Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. Journal of Discrete Algorithms 4, 255–276 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chrobak, M., Dürr, C., Jawor, W., Kowalik, Ł., Kurowski, M.: A note on scheduling equal-length jobs to maximize throughput. J. Sched. 9, 71–73 (2006)

    Article  MATH  Google Scholar 

  8. Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Improved online algorithms for buffer management in QoS switches. ACM Trans. Algorithms 3(4), 19 (2007)

    Article  MathSciNet  Google Scholar 

  9. Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM J. Comput. 36, 1709–1728 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ding, J., Ebenlendr, T., Sgall, J., Zhang, G.: Online Scheduling of Equal-Length Jobs on Parallel Machines. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 427–438. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Ding, J., Zhang, G.: Online Scheduling with Hard Deadlines on Parallel Machines. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 32–42. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Dürr, C., Hurand, M.: Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 315–326. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Ebenlendr, T., Sgall, J.: A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol. 5426, pp. 43–52. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Englert, M., Westerman, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proc. 18th Symp. on Discrete Algorithms (SODA), pp. 209–218. ACM/SIAM (2007)

    Google Scholar 

  15. Epstein, L., Jeż, Ł., Sgall, J., van Stee, R.: Online Scheduling of Jobs with Fixed Start Times on Related Machines. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX 2012 and RANDOM 2012. LNCS, vol. 7408, pp. 134–145. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  16. Goldman, S.A., Parwatikar, J., Suri, S.: Online scheduling with hard deadlines. J. Algorithms 34, 370–389 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Goldwasser, M.H., Pedigo, M.: Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 113–123. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  18. Jeż, Ł.: Randomized algorithm for agreeable deadlines packet scheduling. In: Proc. 27th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 489–500 (2010)

    Google Scholar 

  19. Jeż, Ł.: One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 239–250. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  20. Jeż, Ł., Li, F., Sethuraman, J., Stein, C.: Online scheduling of packets with agreeable deadlines. To appear in ACM Trans. Algorithms

    Google Scholar 

  21. Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proc. 16th Symp. on Discrete Algorithms (SODA), pp. 801–802. ACM/SIAM (2005)

    Google Scholar 

  22. Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoret. Comput. Sci. 130, 5–16 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  23. Ye, D., Zhang, G.: Maximizing the throughput of parallel jobs on hypercubes. Inform. Process. Lett. 102, 259–263 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  24. Zajíček, O.: A note on scheduling parallel unit jobs on hypercubes. Int. J. on Found. Comput. Sci. 20, 341–349 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Physics, Computer Science Institute of Charles University, Malostranské nám. 25, CZ-11800, Praha 1, Czech Republic

    Jiří Sgall

Authors
  1. Jiří Sgall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Haifa, Mount Carmel, 31905, Haifa, Israel

    Leah Epstein

  2. Dipartimento di Informatica, Università di Pisa, Largo B. Pontecorvo 3, 56100, Pisa, Italy

    Paolo Ferragina

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sgall, J. (2012). Open Problems in Throughput Scheduling. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33090-2_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33089-6

  • Online ISBN: 978-3-642-33090-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation