20 search results - page 1 / 4 » A Faster Combinatorial Approximation Algorithm for Schedulin... |
124
Voted
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
146
click to vote
ECCC
2000
15 years 5 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 ...
171
Voted
ESA
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
107
Voted
INFORMS
2002
15 years 5 months ago
2002
160
click to vote
STOC
2005
ACM
16 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 . ...