Sciweavers

2 search results - page 1 / 1
» Online Scheduling of Equal-Length Jobs: Randomization and Re...
Sort
View
ICALP
2004
Springer
13 years 9 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 5 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