Find in Library

This work describe a method to finding a solution for the construction of timetables. The approach uses the application of genetic algorithms to obtain the solution. The implementation took into account the constraints presents in the preparation of grids college. The software displays plausible combinations of schedules such that satisfies the schedules constraints of undergraduation, teachers and courses registered in the system. Since the problem is a NP-Complete, not always valid combinations are found by the algorithm, in this case the program highlights the course that are in conflict.