A hybrid multiprocessor task scheduling method based on immune genetic algorithm

Multiprocessor task scheduling plays a fundamental role in parallel applications and distributed networks. All of the methods for this kind of scheduling are concerned with achieving optimal running time. In this way parallel execution of tasks on several processors based on precedence graph should be considered. In this study, first a new heuristic method has been introduced which improved the execution time of some precedence graphs. Furthermore, we presented a novel immune genetic approach for multiprocessor task scheduling problem. Finally, combination of the proposed heuristic and the genetic approach makes a new hybrid scheme which is better than other well known and recent methods