Static task graph scheduling using learner Genetic Algorithm

Abstract

Task graph scheduling is one of the NP-Hard problems. So many classic and non-classic methods are proposed for solution of this problem. One of the crucial methods that, applied for solving this problem is Genetic Algorithm. In this paper we propose a new algorithm that named Learner Genetic Algorithm (LGA). Our proposed algorithm based on Genetic Algorithm, but in new proposed algorithm the Learning Process is attached for Genetic Algorithm. The scheduling resulted from applying our proposed algorithm to some benchmark task graphs are compared with the existing ones.