Login / Signup
Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan.
Jacek Blazewicz
Maciej Machowiak
Jan Weglarz
Mikhail Y. Kovalyov
Denis Trystram
Published in:
Ann. Oper. Res. (2004)
Keyphrases
</>
branch and bound algorithm
precedence constraints
parallel processors
single processor
search problems
scheduling problem
information retrieval
min cost
contract algorithms
special case
simulated annealing
orders of magnitude
parallel version