720 search results - page 66 / 144 » Machine scheduling with resource dependent processing times |
128
Voted
IPCO
1998
15 years 5 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...
136
Voted
APPROX
2008
Springer
15 years 5 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...
181
Voted
HIPEAC
2009
Springer
15 years 10 months ago
2009
Springer
Heterogeneous architectures are currently widespread. With the advent of easy-to-program general purpose GPUs, virtually every recent desktop computer is a heterogeneous system. Co...
158
Voted
LCN
2005
IEEE
15 years 9 months ago
2005
IEEE
— The problem of achieving fairness in the allocation of the bandwidth resource on a link shared by multiple flows of traffic has been extensively researched over the last deca...
158
Voted
EMSOFT
2008
Springer
15 years 5 months ago
2008
Springer
Real-time Garbage Collection (RTGC) has recently advanced to the point where it is being used in production for financial trading, military command-and-control, and telecommunicat...