Review of task scheduling algorithms using genetic approach

Abstract

The aim of scheduling problem in multiprocessors is to find the optimal or nearly optimal solution for the assignment of multiple tasks to multiple processors so as the minimum completion time can be achieved. The efficiency of any scheduling approach depends upon the problem formulation and the performance characteristics of the algorithm used for the purpose. The scheduling algorithm studied in this paper is Genetic Algorithm (GA) and various variants of genetic algorithm used for task scheduling proposed by various researchers over the period of time. The introduction and efficiency of various variants using the different performance parameters is compared.