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 lower bound for randomized on-line multiprocessor scheduling
Information Processing Letters
A Level Algorithm for Preemptive Scheduling
Journal of the ACM (JACM)
Preemptive Scheduling of Uniform Processor Systems
Journal of the ACM (JACM)
On-line Load Balancing for Related Machines
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters
Preemptive on-line scheduling for two uniform processors
Operations Research Letters
An optimal algorithm for preemptive on-line scheduling
Operations Research Letters
Preemptive semi-online scheduling with tightly-grouped processing times
Journal of Computer Science and Technology
Preemptive online scheduling: optimal algorithms for all speeds
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Preemptive scheduling on a small number of hierarchical machines
Information and Computation
Optimal and online preemptive scheduling on uniformly related machines
Journal of Scheduling
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Preemptive Online Scheduling with Reordering
SIAM Journal on Discrete Mathematics
Preemptive semi-online scheduling on parallel machines with inexact partial information
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Operations Research Letters
| Hi-index | 0.00 |
We study preemptive scheduling on uniformly related processors, where jobs are arriving one by one in an on-line fashion. We consider the class of machine sets where the speed ratios are non-decreasing as speed increases. For each set of machines in this class, we design an algorithm of optimal competitive ratio. This generalizes the known result for identical machines, and solves other interesting cases.