Login / Signup
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors.
Wieslaw Kubiak
Djamal Rebaine
Chris N. Potts
Published in:
Discret. Optim. (2009)
Keyphrases
</>
parallel processors
single processor
precedence constraints
search problems
scheduling problem
optimal solution
contract algorithms
branch and bound algorithm
min cost
genetic algorithm
search algorithm
computational complexity
np hard
linear programming
search strategies