Scheduling independent tasks on uniform processors
SIAM Journal on Computing
Tighter bounds for LPT scheduling on uniform processors
SIAM Journal on Computing
Scheduling Parallel Machines On-line
SIAM Journal on Computing
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
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
Journal of Algorithms
Introduction to Algorithms
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters
A comment on scheduling on uniform machines under chain-type precedence constraints
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
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Operations Research Letters
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Operations Research Letters
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Algorithms with limited number of preemptions for scheduling on parallel machines
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4-competitive deterministic and an e驴2.71-competitive randomized online algorithm. In addition, it matches the performance of the previously known algorithms for the offline case, with a considerably simpler proof. Finally, we study the performance of greedy heuristics for the same problem.