An Approximation Algorithm for Multiprocessor Scheduling of Trees with Communication Delays.

Satoshi Tayu Motoyasu Katsura Mineo Kaneko

Published in: ISPAN (2000)

Keyphrases

dynamic programming
objective function
optimal solution
computational complexity
np hard
worst case
simulated annealing
optimization algorithm
mathematical model
benchmark problems
multiprocessor systems
special case
mobile robot
simulated annealing algorithm
execution times