Resumen de Genetic Algorithms for the Resource-Constrained Project Scheduling Problem
Javier Alcaraz Soria, Concepción Maroto Álvarez
Genetic Algorithms have been applied to many dierent optimization problems and they are one of the most promising metaheuristics. In the last years we have focused our work developing e cient genetic algorithms to solve the Resource-Constrained Project Scheduling Problem. We have proposed several algorithms to solve dierent versions of the problem, designing new representations for the solutions, dierent crossover techniques, innovative mutation mechanisms, e cient local search procedures and other features that will be summarized in this work.
