54 search results - page 6 / 11 » A parallel memetic algorithm applied to the total tardiness ... |
157
Voted
IPCO
1998
15 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...
151
Voted
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
160
click to vote
CLUSTER
2005
IEEE
15 years 12 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
142
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
154
click to vote
SIAMDM
2002
15 years 5 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...