engleski

Scheduling Tasks with Non-negligible Intertask Communication onto Multiprocessors by using Genetic Algorithm

The paper deals with genetic algorithms for scheduling tasks with non-negligible intertask communication. Three genetic algorithms for scheduling with the primary goal to minimise finishing time are reported. The basic genetic algorithm includes reproduction, crossover and mutation operators, the improved version has additional cloning operator that allows duplicated scheduling and the third algorithm is the adaptive one. Experiments describing influence of genetic operators' probabilities, population size and number of generations on resulting schedules, comparison of algorithms and results obtained for different task granulation are discussed.

Genetic Algorithms; Intertask Communication; Cloning Operator

nije evidentirano