Sciweavers

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

46

ACID
2006

favoriteEmaildiscussreport

249views Algorithms» more ACID 2006»

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times

14 years 12 days ago

Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times

Download www.pims.math.ca

Daya Ram Gaur, Ramesh Krishnamurti, Ján Man

Real-time Traffic

ACID 2006 | Algorithms |

claim paper

Related Content

» Optimal task placement to improve cache performance

» A ConstantApproximate Feasibility Test for Multiprocessor RealTime Scheduling

» PushPull Guided Search DAG Scheduling for Heterogeneous Clusters

» Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines

» RealTime Task Replication for Fault Tolerance in Identical Multiprocessor Systems

» Job Shop Scheduling with Unit Length Tasks Bounds and Algorithms

» EnergyEfficient RealTime Task Scheduling in Multiprocessor DVS Systems

» Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Schedu...

» Tardiness Bounds for Global EDF with Deadlines Different from Periods

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	ACID
Authors	Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch

Comments (0)