This work presents the development of a multipopulation genetic algorithm for the task schedulingproblem with communication costs, aiming to compare its performance with the serial genetic algorithm. For thispurpose, a set of instances was developed and different approaches for genetic operations were compared.Experiments were conducted varying the number of populations and the number of processors available forscheduling. Solution quality and execution time were analyzed, and results show that the AGMP with adjustedparameters generally produces better solutions while requiring less execution time.