On the performance of on-line algorithms for partition problems
Acta Cybernetica
New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
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
A lower bound for randomized on-line scheduling algorithms
Information Processing Letters
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
SIAM Journal on Computing
Better bounds for online scheduling
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A lower bound for randomized on-line multiprocessor scheduling
Information Processing Letters
Online computation and competitive analysis
Online computation and competitive analysis
A better algorithm for an ancient scheduling problem
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Generating adversaries for request-answer games
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Randomized Algorithms for that Ancient Scheduling Problem
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
An Optimal Algorithm for Preemptive On-line Scheduling
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
D-factor: a quantitative model of application slow-down in multi-resource shared systems
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
| Hi-index | 0.00 |
We present a newon line algorithm, MR, for nonpreemptive scheduling of jobs with known processing times on m identical machines which beats the best previous algorithm for m ≥ 64. For m → ∞ its competitive ratio approaches 1 + √1+ln2/2