An application of genetic algorithm and the Serial Schedule Generation Scheme for solving the Resource-Constrained Project Scheduling Problem

This article presents a way to solve Resource-Constrained Project Scheduling Problem with genetic algorithm and demonstrates the high relevance of metaheuristics for solution this type problem. Also shows various benchmarks with others heuristics. The benchmark performed compares directly to a relatively new heuristic and to several other works performed. The genetic algorithm together with the approach and the form of resolution applied to solve the Resource-Constrained Project Scheduling Problem obtained better results than other approaches. This work reinforced that, even with new metaheuristics, the genetic algorithm remains in the lead to solve this problem.