Recent Results for Online Makespan Minimization

(Extended Abstract)
  • Susanne Albers
Conference paper

DOI: 10.1007/978-3-642-38768-5_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7936)
Cite this paper as:
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


Overview: We study a classical scheduling problem that has been investigated for more than forty years. Consider a sequence of jobs σ = J1, …, Jn that has to be scheduled on m identical parallel machines. Each job Jt has an individual processing time pt, 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 Jt has to be assigned immediately to one of the machines without knowledge of any future jobs Jt, t′ > t.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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