Recent Results for Online Makespan Minimization

(Extended Abstract)
  • Susanne Albers
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7936)


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.


Competitive Ratio Online Algorithm Online Schedule Identical Parallel Machine Maximum Completion Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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)CrossRefGoogle Scholar
  2. 2.
    Albers, S., Hellwig, M.: Semi-online scheduling revisited. Theoretical Computer Science 443, 1–9 (2012)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Azar, Y., Regev, O.: On-line bin-stretching. Theoretical Computer Science 268, 17–41 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 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)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 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. 6.
    Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling 3, 343–353 (2000)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Graham, R.L.: Bounds for certain multi-processing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)Google Scholar
  8. 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)MathSciNetCrossRefGoogle Scholar
  9. 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)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 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. 11.
    Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Mathematics of Operations Research 34(2), 481–498 (2009)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Zhang, G.: A simple semi on-line algorithm for P2/ / C max with a buffer. Information Processing Letters 61, 145–148 (1997)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Susanne Albers
    • 1
  1. 1.Department of Computer ScienceHumboldt-Universität zu BerlinGermany

Personalised recommendations