155 search results - page 24 / 31 » Online Scheduling of Equal-Length Jobs on Parallel Machines |
IPCO
1998
15 years 1 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...
120
click to vote
ESWA
2008
14 years 11 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
131
click to vote
CISIS
2011
IEEE
13 years 11 months ago
2011
IEEE
—Computational performance increasingly depends on parallelism, and many systems rely on heterogeneous resources such as GPUs and FPGAs to accelerate computationally intensive ap...
IEEEPACT
1998
IEEE
15 years 4 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
EUROPAR
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. With the increasing popularity of large-scale distributed computing networks, a new aspect has to be considered for scheduling problems: machines may not be available per...