Skip to main content
SpringerLink
Log in

Recent Results for Online Makespan Minimization

(Extended Abstract)

  • Conference paper
Computing and Combinatorics (COCOON 2013)

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

Included in the following conference series:

  • 1915 Accesses

Abstract

Overview: We study a classical scheduling problem that has been investigated for more than forty years. Consider a sequence of jobs σ = J 1, …, J n that has to be scheduled on m identical parallel machines. Each job J t has an individual processing time p t , 1 ≤ t ≤ n. Preemption of jobs is not allowed. The goal is to minimize the makespan, i.e. the maximum completion time of any job in the constructed schedule. In the offline variant of the problem all jobs of σ are known in advance. In the online variant the jobs arrive one by one. Each incoming job J t has to be assigned immediately to one of the machines without knowledge of any future jobs J t′, t′ > t.

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

References

  1. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. 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 

  5. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  8. 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 

  9. 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 

  10. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  12. 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 Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Ding-Zhu Du

  2. College of Computer Science and Technology, Zhejiang University, 310027, Hangzhou, China

    Guochuan Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Albers, S. (2013). Recent Results for Online Makespan Minimization. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38768-5_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38767-8

  • Online ISBN: 978-3-642-38768-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation