Sciweavers

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

10

STACS
2009
Springer

favoriteEmaildiscussreport

101views Theoretical Computer Science» more STACS 2009»

Semi-Online Preemptive Scheduling: One Algorithm for All Variants

13 years 11 months ago

Semi-Online Preemptive Scheduling: One Algorithm for All Variants

Download kam.mff.cuni.cz

We present a uniﬁed optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for all types of semi-online restrictions, including the ones studied before, like sorted (decreasing) jobs, known sum of processing times, known maximal processing time, their combinations, and so on. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation ratios for a small number of machines.

Tomás Ebenlendr, Jiri Sgall

Real-time Traffic

Optimal Semi-online Algorithm | Processing Time | Semi-online Restrictions | STACS 2009 | Theoretical Computer Science |

claim paper

Related Content

» Preemptive Online Scheduling with Reordering

» Preemptive scheduling on a small number of hierarchical machines

» Algorithms for a realistic variant of flowshop scheduling

» On the Scheduling of MixedCriticality RealTime Task Sets

» Scheduling to minimize power consumption using submodular functions

» Minimum Makespan Multivehicle DialaRide

» Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

» Online Algorithms to Minimize Resource Reallocations and Network Communication

» Analysis Methods for Alleged RC4

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	STACS
Authors	Tomás Ebenlendr, Jiri Sgall

Comments (0)