Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

STACS
2004
Springer

favoriteEmaildiscussreport

113views Theoretical Computer Science» more STACS 2004»

Optimal and Online Preemptive Scheduling on Uniformly Related Machines

13 years 9 months ago

Optimal and Online Preemptive Scheduling on Uniformly Related Machines

Download www.math.cas.cz

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 optimal schedule. Using the standard doubling technique, this yields a 4-competitive deterministic and an e ≈ 2.71-competitive randomized online algorithm. In addition, it matches the performance of the previously known algorithms for the oﬄine case, with a considerably simpler proof. Finally, we study the performance of greedy heuristics for the same problem.

Tomás Ebenlendr, Jiri Sgall

Real-time Traffic

Preemptive Scheduling | STACS 2004 | Standard Doubling Technique | Theoretical Computer Science | Uniformly Related Machines |

claim paper

Related Content

» Optimal OnLine Algorithms to Minimize Makespan on Two Machines with Resource Augmentation

» Preemptive Online Scheduling Optimal Algorithms for All Speeds

» Preemptive scheduling on a small number of hierarchical machines

» SemiOnline Preemptive Scheduling One Algorithm for All Variants

» Preemptive Scheduling with Rejection

» Preemptive Scheduling on Selfish Machines

» Optimal preemptive scheduling on uniform machines with discounted flowtime objectives

» Optimal Preemptive Scheduling for General Target Functions

» Separating online scheduling algorithms with the relative worst order ratio

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	STACS
Authors	Tomás Ebenlendr, Jiri Sgall

Comments (0)