Sciweavers

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

79

Voted

INFORMS
2002

60views more INFORMS 2002»

Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines

15 years 2 months ago

Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines

Download www.zib.de

Tjark Vredeveld, Cor A. J. Hurkens

Real-time Traffic

INFORMS 2002 |

claim paper

Related Content

» A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines

» Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines

» Convex programming for scheduling unrelated parallel machines

» Scheduling Unrelated Machines by Randomized Rounding

» The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

» Preemptive Scheduling with Rejection

» Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines

» Grouping Techniques for Scheduling Problems Simpler and Faster

» Machine scheduling with resource dependent processing times

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	INFORMS
Authors	Tjark Vredeveld, Cor A. J. Hurkens

Comments (0)