17 search results - page 3 / 4 » Experimental Comparison of Approximation Algorithms for Sche... |
ALGORITHMICA
2002
13 years 5 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...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
IPCO
1998
13 years 7 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...
BIRTHDAY
2009
Springer
13 years 9 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...
FOCS
2007
IEEE
13 years 9 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...