20 search results - page 2 / 4 » Approximation Bounds for a General Class of Precedence Const... |
145
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...
159
Voted
ESA
1999
Springer
15 years 7 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
124
Voted
ECCC
2000
15 years 3 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 ...
123
click to vote
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...
124
click to vote
SIAMDM
2002
15 years 2 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...