Abstract
Abstract The current paper tackles the combination of the genetic Algorithm with scheduling the multiprocessor by browsing the two algorithms for dependent tasks and non preemptive. The first algorithm is the highest level first estimated time (HLFET), and the second algorithm is smallest co -level first with estimated time (SCFET). The genetic algorithm proved to be powerful, efficient and appeared the feasible solution among many solutions; that minimize the schedule length (execution time) to find the optimal scheduling. In this research, it is proposed a genetic algorithm that finds a good combination of two list algorithms to produce a schedule with shortest schedule length. The results of the experiments showed that scheduling found with the proposed two list scheduling genetic algorithms outperform those found with each one of the two lists scheduling alone. .
