Online scheduling of splittable tasks
ACM Transactions on Algorithms (TALG)
A new algorithm for online uniform-machine scheduling to minimize the makespan
Information Processing Letters
The Price of Anarchy on Uniformly Related Machines Revisited
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Tighter approximation bounds for LPT scheduling in two special cases
Journal of Discrete Algorithms
Enabling rich mobile applications: joint computation and communication scheduling
ACM SIGMOBILE Mobile Computing and Communications Review
Competitive ratio of List Scheduling on uniform machines and randomized heuristics
Journal of Scheduling
Online scheduling on three uniform machines
Discrete Applied Mathematics
Tighter approximation bounds for LPT scheduling in two special cases
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The price of anarchy on uniformly related machines revisited
Information and Computation
Online scheduling on uniform machines with two hierarchies
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
This paper considers the problem of on-line scheduling a set of independent jobs on m uniform machines (M1, M2,..., Mm) in which machine Mi's processing speed is si=1 (i=1,..., m-1) and sm=s 1. List scheduling [Y. Cho and S. Sahni, SIAM J. Comput., 9 (1980), pp. 91--103] guarantees a worst-case performance of $\frac{3m-1}{m+1} (m\ge 3)$ and $\frac{1+\sqrt 5}2 (m=2)$ for this problem. We prove that this worst-case bound cannot be improved for m=2 and m=3 and for every $m\ge 4,$ an algorithm with worst-case performance at most $\frac{3m-1}{m+1}-\e$ is presented when sm=2,$ where e is a fixed positive number, and then we improve the bound for general sm=s 1.