Task assignment scheduling by simulated annealing

A stochastic, heuristic search algorithm called simulated annealing is considered for the problem of static task assignment scheduling in distributed computing systems. The purpose of task assignment scheduling is to assign modules of programs over a set of interconnected processors in order to reduce the job turnaround time as well as to obtain the best system performance. It is shown that the approach of simulated annealing, with a properly designed annealing schedule and a good move generation strategy can be used to solve this problem in an efficient way