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
Dynamic scheduling on parallel machines
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
A better algorithm for an ancient scheduling problem
Journal of Algorithms
A lower bound for randomized on-line multiprocessor scheduling
Information Processing Letters
An On-Line Algorithm for Some Uniform Processor Scheduling
SIAM Journal on Computing
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
On an on-line scheduling problem for parallel jobs
Information Processing Letters
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Bounds for the Online Scheduling Problem
SIAM Journal on Computing
Reasoning intra-dependency in commitments for robust scheduling
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
| Hi-index | 0.00 |
We consider online scheduling of splittable tasks on parallel machines, where the goal is to minimize the last completion time (the makespan). In our model, each task can be split into a limited number of parts, that can then be scheduled independently and in parallel. We consider both the case where the machines are identical and the case where some subset of the machines have a (fixed) higher speed than the others. We design a class of algorithms that allows us to give tight bounds for a large class of cases where tasks may be split into relatively many parts. For identical machines, we also improve upon the natural greedy algorithm in other classes of cases.