MODELOS DE PROGRAMACIÓN ENTERA PARA UN PROBLEMA DE PROGRAMACIÓN DE HORARIOS PARA UNIVERSIDADES MODELS OF INTEGER PROGRAMMING FOR AN UNIVERSITY TIMETABLING PROBLEM

In this research, two models of Integer Programming for a University Timetabling Problem are formulated and two solution strategies for each model are presented. The problem consists of programming the courses to be taught, considering teaching faculty, days, periods, classrooms and requirements for courses that are taught in consecutive periods. The objective is to minimize the allocation of undesired time slots as well as balancing the daily workload for each group of students. The solution strategies are based on either combining models of direct allocation to classrooms or types of classrooms. The solution strategies that include reducing constraints, allow solving big problems with reasonable levels of efficiency, using the computer system for a short time. The approaches were used with real data obtained from the Facultad de Ingenieria of the Universidad de Concepcion, Chile. The models used in this research can be used in more general University Timetabling Problems, providing a great flexibility of resolution.