Scheduling tasks in a multi-processor system utilizes a hybrid of genetic algorithms and priorities of the number of offspring

Task scheduling problem on multiprocessor systems because of the use of the processors and also spend less time is particularly important. The problem of a class of hard problems and obtain optimal solutions with high temporal complexity, so to solve this problem is to use heuristic methods. Using genetic algorithms, effective method for multi-processor systems are scheduled. In this paper, a new method for multiprocessor scheduling system is presented the scheduling priority of doing things based on the number of children and grandchildren and check earliest start time and end up enjoying things a genetic algorithm is done. The results show proposed new algorithm optimal timing to acquire common genetic methods