28 search results - page 1 / 6 » Preemptive Online Scheduling with Reordering |
90
Voted
ESA
2009
Springer
15 years 2 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...
MST
2008
14 years 9 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 ...
ORL
1998
14 years 9 months ago
1998
This paper considers the problem of preemptive on-line scheduling for two uniform processors in which one of the
APPROX
2000
Springer
15 years 1 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
STACS
2004
Springer
15 years 2 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 ...