17 search results - page 1 / 4 » Experimental Comparison of Approximation Algorithms for Sche... |
INFORMS
2002
15 years 3 days ago
2002
72
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
103
click to vote
ECCC
2000
15 years 7 days 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 ...
107
click to vote
STOC
2005
ACM
16 years 22 days 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
15 years 2 days 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...