17 search results - page 1 / 4 » Experimental Comparison of Approximation Algorithms for Sche... |
INFORMS
2002
13 years 4 months ago
2002
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
ECCC
2000
13 years 4 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
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 . ...
SIAMDM
2002
13 years 4 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...