Sciweavers

641 search results - page 16 / 129
» On robust online scheduling algorithms
Sort
View
ICALP
2004
Springer
14 years 1 months ago
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help
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 ...
Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tom&aac...
RTSS
2002
IEEE
14 years 23 days ago
Dynamic Scan Scheduling
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitt...
Bruno Dutertre
WAOA
2010
Springer
246views Algorithms» more  WAOA 2010»
13 years 5 months ago
Tradeoff between Energy and Throughput for Online Deadline Scheduling
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
Ho-Leung Chan, Tak Wah Lam, Rongbin Li
AAAI
1994
13 years 9 months ago
Just-In-Case Scheduling
This paper presents an algorithm, called JustIn-Case Scheduling, for building robust schedules that tend not to break. The algorithm implements the common sense idea of being prep...
Mark Drummond, John L. Bresina, Keith Swanson
AAAI
2007
13 years 10 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...