Sciweavers

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

32

ALGORITHMICA
2005

favoriteEmaildiscussreport

63views more ALGORITHMICA 2005»

Minimizing Makespan and Preemption Costs on a System of Uniform Machines

13 years 10 months ago

Minimizing Makespan and Preemption Costs on a System of Uniform Machines

Download www.cs.technion.ac.il

Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger

Real-time Traffic

ALGORITHMICA 2005 |

claim paper

Related Content

» Preemptive Scheduling on Selfish Machines

» Optimal Preemptive Scheduling for General Target Functions

» Nonclairvoyant Scheduling Games

» Equilibria for two parallel links The strong price of anarchy versus the price of anarchy

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2005
Where	ALGORITHMICA
Authors	Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger

Comments (0)