Recent Results for Online Makespan Minimization
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.
- 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
- 7.Graham, R.L.: Bounds for certain multi-processing anomalies. Bell System Technical Journal 45, 1563–1581 (1966)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