Efficient multiprocessor scheduling based on genetic algorithms

An efficient method, based on genetic algorithms, for solving the multiprocessor scheduling problem is proposed. The representation of the search node is based on the schedule of the tasks in each individual processor. The genetic operator is based on the precedence relations between the tasks in the task graph. The genetic algorithm is applied to the problem of scheduling robot inverse dynamics computations.<>