19 search results - page 1 / 4 » Online scheduling with a buffer on related machines |
JCO
2010
13 years 3 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
MST
2008
13 years 4 months ago
2008
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...
STACS
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
ESA
2009
Springer
13 years 9 months ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...