Sciweavers

STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 5 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein