Skip to main content
SpringerLink
Log in

Recent Advances for a Classical Scheduling Problem

  • Conference paper
Automata, Languages, and Programming (ICALP 2013)

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

Included in the following conference series:

Abstract

We revisit classical online makespan minimization which has been studied since the 1960s. In this problem a sequence of jobs has to be scheduled on m identical machines so as to minimize the makespan of the constructed schedule. Recent research has focused on settings in which an online algorithm is given extra information or power while processing a job sequence. In this paper we review the various models of resource augmentation and survey important results.

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. Aggarwal, G., Motwani, R., Zhu, A.: The load rebalancing problem. Journal of Algorithms 60(1), 42–59 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Albers, S.: Better bounds for online scheduling. SIAM Journal on Computing 29, 459–473 (1999)

    Article  MathSciNet  Google Scholar 

  3. Albers, S., Hellwig, M.: On the value of job migration in online makespan minimization. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 84–95. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Albers, S., Hellwig, M.: Online makespan minimization with parallel schedules, arXiv:1304.5625 (2013)

    Google Scholar 

  5. Albers, S., Hellwig, M.: Semi-online scheduling revisited. Theoretical Computer Science 443, 1–9 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  6. Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: Proc. 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1228–1241 (2012)

    Google Scholar 

  7. Angelelli, E., Speranza, M.G., Tuza, Z.: Semi-on-line scheduling on two parallel processors with an upper bound on the items. Algorithmica 37, 243–262 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Angelelli, E., Speranza, M.G., Tuza, Z.: New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete Mathematics & Theoretical Computer Science 8, 1–16 (2006)

    MathSciNet  MATH  Google Scholar 

  9. Angelelli, E., Speranza, M.G., Tuza, Z.: Semi-online scheduling on two uniform processors. Theoretical Computer Science 393, 211–219 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  10. Angelelli, E., Nagy, A.B., Speranza, M.G., Tuza, Z.: The on-line multiprocessor scheduling problem with known sum of the tasks. Journal of Scheduling 7, 421–428 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Azar, Y., Regev, O.: On-line bin-stretching. Theoretical Computer Science 268, 17–41 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences 51, 359–366 (1995)

    Article  MathSciNet  Google Scholar 

  13. Bartal, Y., Karloff, H., Rabani, Y.: A better lower bound for on-line scheduling. Infomation Processing Letters 50, 113–116 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Chen, B., van Vliet, A., Woeginger, G.J.: A lower bound for randomized on-line scheduling algorithms. Information Processing Letters 51, 219–222 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  15. Chen, B., van Vliet, A., Woeginger, G.J.: A optimal algorithm for preemptive online scheduling. Operations Research Letters 18, 127–131 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  16. Cheng, T.C.E., Kellerer, H., Kotov, V.: Semi-on-line multiprocessor scheduling with given total processing time. Theoretical Computer Science 337, 134–146 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  17. Dósa, G., Epstein, L.: Preemptive online scheduling with reordering. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 456–467. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Englert, M., Özmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. In: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 603–612 (2008)

    Google Scholar 

  19. Epstein, L.: Bin stretching revisited. Acta Informatica 39(2), 7–117 (2003)

    Article  Google Scholar 

  20. Faigle, U., Kern, W., Turan, G.: On the performance of on-line algorithms for partition problems. Acta Cybernetica 9, 107–119 (1989)

    MathSciNet  MATH  Google Scholar 

  21. Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling 3, 343–353 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  22. Galambos, G., Woeginger, G.: An on-line scheduling heuristic with better worst case ratio than Graham’s list scheduling. SIAM Journal on Computing 22, 349–355 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  23. Garay, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)

    Google Scholar 

  24. Gormley, T., Reingold, N., Torng, E., Westbrook, J.: Generating adversaries for request-answer games. In: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 564–565 (2000)

    Google Scholar 

  25. Graham, R.L.: Bounds for certain multi-processing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)

    Google Scholar 

  26. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM 34, 144–162 (1987)

    Article  MathSciNet  Google Scholar 

  27. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47, 617–643 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  28. Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. Journal of Algorithms 20, 400–430 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  29. Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Operations Research Letters 21, 235–242 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  30. Pruhs, K., Sgall, J., Torng, E.: Online scheduling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 15. CRC Press (2004)

    Google Scholar 

  31. Rudin III, J.F.: Improved bounds for the on-line scheduling problem. Ph.D. Thesis. The University of Texas at Dallas (May 2001)

    Google Scholar 

  32. Rudin III, J.F., Chandrasekaran, R.: Improved bounds for the online scheduling problem. SIAM Journal on Computing 32, 717–735 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  33. Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Mathematics of Operations Reseach 34(2), 481–498 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  34. Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Information Processing Letters 63, 51–55 (1997)

    Article  MathSciNet  Google Scholar 

  35. Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)

    Article  MathSciNet  Google Scholar 

  36. Zhang, G.: A simple semi on-line algorithm for P2/ / C max with a buffer. Information Processing Letters 61, 145–148 (1997)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Humboldt-Universität zu Berlin, Germany

    Susanne Albers

Authors
  1. Susanne Albers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Bergen, Postboks 7803, 5020, Bergen, Norway

    Fedor V. Fomin

  2. Faculty of Computing, University of Latvia, Raina bulv. 19, 1586, Riga, Latvia

    Rūsiņš Freivalds

  3. Department of Computer Science, Wolfson Building, Parks Road, University of Oxford, OX1 3QD, Oxford, UK

    Marta Kwiatkowska

  4. Faculty of Mathematics and Computer Science, Weizmann Institute of Science, POB 26, 76100, Rehovot, Israel

    David Peleg

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Albers, S. (2013). Recent Advances for a Classical Scheduling Problem. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39212-2_2

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-39211-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation