Sciweavers

6 search results - page 2 / 2
» A simpler competitive analysis for scheduling equal-length j...
Sort
View
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 6 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis