Neural network applied to the coevolution of the memetic algorithm for solving the makespan minimization problem in parallel machine scheduling

摘要

A scheduling problem treats the allocation of resources, taking into account the execution of a set of operations, and with an objective, subject to a set of restrictions. The problem discussed here is one of scheduling the tasks in identical parallel machines. In this problem, we worked with a set of n tasks and m identical parallel machines, with the objective of minimizing the makespan. The makespan is the total processing time of the most busy machine. We considered that the tasks should be assigned without preemption, each machine can process one or more tasks, one at each time, and each task should be processed by just one machine.