68 search results - page 1 / 14 » Online scheduling of parallel jobs on two machines is 2-comp... |
ORL
2008
13 years 4 months ago
2008
JDA
2008
13 years 4 months ago
2008
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
ESA
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
COR
2011
12 years 11 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
ESA
2007
Springer
13 years 11 months ago
2007
Springer
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio de