641 search results - page 8 / 129 » On robust online scheduling algorithms |
SCHEDULING
2008
13 years 7 months ago
2008
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
STACS
2000
Springer
13 years 11 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
ARC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. Few of the benefits of exploiting partially reconfigurable devices are power consumption reduction, cost reduction, and customized performance improvement. To obtain thes...
ETT
2000
13 years 7 months ago
2000
This paper considers all-optical broadcast networks providing a number of slotted WDM channels for packet communications. Each network user is equipped with one tunable transmitter...