99 search results - page 3 / 20 » Online Scheduling with Bounded Migration |
COCOON
2001
Springer
14 years 2 months ago
2001
Springer
d by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus o...
APPROX
2000
Springer
14 years 2 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 ...
IPL
2006
13 years 9 months ago
2006
We consider the online scheduling problem with m - 1, m 2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1 s 2, to minimize the makespa...
IPL
2006
13 years 9 months ago
2006
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
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 ...