20 search results - page 4 / 4 » A Faster Combinatorial Approximation Algorithm for Schedulin... |
125
Voted
IPCO
1998
15 years 4 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
147
Voted
BIRTHDAY
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
170
Voted
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
155
Voted
ALGORITHMICA
2002
15 years 3 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
110
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...