On the performance of on-line algorithms for partition problems
Acta Cybernetica
Online load balancing and network flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Allocating bandwidth for bursty connections
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Multiprocessor scheduling with rejection
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A better algorithm for an ancient scheduling problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Ancient and new algorithms for load balancing in the Lp norm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
File Assignment in Parallel I/O Systems with Minimal Variance of Service Time
IEEE Transactions on Computers
An Opportunity Cost Approach for Job Assignment in a Scalable Computing Cluster
IEEE Transactions on Parallel and Distributed Systems
Theoretical Computer Science
Temporary tasks assignment resolved
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Resource Augmentation in Load Balancing
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Minimizing the Maximum Starting Time On-line
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
Experimental analysis of online algorithms for the bicriteria scheduling problem
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Computer Science Review
New lower and upper bounds for on-line scheduling
Operations Research Letters
| Hi-index | 0.01 |
We consider the on-line version of the original m-machine scheduling problem: given m machines and n positive real jobs, schedule the n jobs on the m machines so as to minimize the makespan, the completion time of the last job. In the on-line version, as soon as job j arrrives, it must be assigned immediately to one of the m machines.We present two main results. The first is a (2–&egr;)-competitive deterministic algorithm for all m. The competitive ratio of all previous algorithms approaches 2 as m→ ∞ . Indeed, the problem of improving the competitive ratio for large m had been open since 1966, when the first algorithm for this problem appeared.The second result is an optimal randomized algorithm for the case m = 2. To the best of our knowledge, our 4/3-competitive algorithm is the first specifically randomized algorithm for the original, m-machine, on-line scheduling problem.