Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Temporary tasks assignment resolved
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-line load balancing of temporary tasks revisited
Theoretical Computer Science
A manifesto for the computational method
Theoretical Computer Science
On-Line Load Balancing of Temporary Tasks Revisited
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On-Line Load Banancing in a Hierarchical Server Topology
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Online scheduling with general machine cost functions
Discrete Applied Mathematics
Deterministic monotone algorithms for scheduling on related machines
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A lower bound for on-line scheduling on uniformly related machines
Operations Research Letters
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Operations Research Letters
| Hi-index | 0.02 |