National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Optimal and online preemptive scheduling on uniformly related machines. ITI Series 2003-171
Ebenlendr, T. ; Sgall, Jiří
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 2.71 competitive randomized online algorithms. In addition, it matches the performance of the previously......

Interested in being notified about new results for this query?
Subscribe to the RSS feed.