Recent Advances for a Classical Scheduling Problem
- Cite this paper as:
- 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
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.
Unable to display preview. Download preview PDF.