SciELO - Scientific Electronic Library Online

 
vol.15 número3DIGITALIZACIÓN 3D DEL RODETE DE UN COMPRESOR CENTRÍFUGO: UN PROCEDIMIENTO ALTERNATIVOUSO DEL ENFOQUE POR PROCESOS EN LA ACTIVIDAD INVESTIGATIVA índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Revista

Articulo

Indicadores

Links relacionados

Compartir


Ingeniare. Revista chilena de ingeniería

versión On-line ISSN 0718-3305

Resumen

SALDANA CROVO, Andrés; OLIVA SAN MARTIN, Cristian  y  PRADENAS ROJAS, Lorena. MODELS OF INTEGER PROGRAMMING FOR AN UNIVERSITY TIMETABLING PROBLEM. Ingeniare. Rev. chil. ing. [online]. 2007, vol.15, n.3, pp.245-259. ISSN 0718-3305.  http://dx.doi.org/10.4067/S0718-33052007000300005.

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 ingeniería of the Universidad de Concepción, Chile. The models used in this research can be used in more general University Timetabling Problems, providing a great flexibility of resolution.

Palabras clave : University timetabling problems; integer programming; combinatorial optimization.

        · resumen en Español     · texto en Español     · Español ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons