Recent advances for a classical scheduling problem

Authors:
Susanne Albers
Affiliations:
Department of Computer Science, Humboldt-Universität zu Berlin, Germany
Venue:
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Year:
2013

Citing 27
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
On the performance of on-line algorithms for partition problems

Acta Cybernetica
An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling

SIAM Journal on Computing
A better lower bound for on-line scheduling

Information Processing Letters
A lower bound for randomized on-line scheduling algorithms

Information Processing Letters
New algorithms for an ancient scheduling problem

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
A better algorithm for an ancient scheduling problem

Journal of Algorithms
A simple semi on-line algorithm for P2//Cmax with a buffer

Information Processing Letters
A lower bound for randomized on-line multiprocessor scheduling

Information Processing Letters
Better Bounds for Online Scheduling

SIAM Journal on Computing
Generating adversaries for request-answer games

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
On-line bin-stretching

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Bounds for the Online Scheduling Problem

SIAM Journal on Computing
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks

Journal of Scheduling
Semi-on-line multiprocessor scheduling with given total processing time

Theoretical Computer Science
The load rebalancing problem

Journal of Algorithms
Semi-online scheduling on two uniform processors

Theoretical Computer Science
The Power of Reordering for Online Minimum Makespan Scheduling

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Online Scheduling with Bounded Migration

Mathematics of Operations Research
Resource augmentation for weighted flow-time explained by dual fitting

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Semi-online scheduling revisited

Theoretical Computer Science
Semi on-line algorithms for the partition problem

Operations Research Letters
An optimal algorithm for preemptive on-line scheduling

Operations Research Letters
On the value of job migration in online makespan minimization

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.