Implementación de un algoritmo genético para resolver el problema de programación de proyectos con recursos limitados

Abstract

Mainly in industrial production companies and those that provide maintenance services to machinery, daily face a problem of operational nature that must be resolved by the people involved in the shortest time possible. This team has in front a project that consists of a series of activities and processes that have a definite duration. The processes and activities consume scarce resources of the company and obey a set of precedence relationships. The team should develop a sequence according to which we should implement the various activities and processes, respecting all the constraints considered so that the project completion time is minimum. Such problems are usually known as Resource Constrained Project Scheduling (RCPSP). In this paper we will talk a little about the theory behind genetic algorithms, know their strengths and, design and implement one based on sequencing in series to allow us to find optimal solutions to the problem in the shortest time possible.