Sciweavers

3 search results - page 1 / 1
» Optimal preemptive scheduling on uniform machines with disco...
Sort
View
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
13 years 8 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
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...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
STACS
2009
Springer
13 years 11 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
Tomás Ebenlendr, Jiri Sgall