ICC 25427
INSTITUTO DE INVESTIGACION EN CIENCIAS DE LA COMPUTACION
Unidad Ejecutora - UE
artículos
Título:
An ILPbased heuristic for a generalization of the post-enrollment course timetabling problem
Autor/es:
PAULA ZABALA; ISABEL MÉNDEZ-DÍAZ; JUAN MIRANDA-BRONT
Revista:
COMPUTERS & OPERATIONS RESEARCH
Editorial:
PERGAMON-ELSEVIER SCIENCE LTD
Referencias:
Lugar: Amsterdam; Año: 2016 vol. 76 p. 195 - 207
ISSN:
0305-0548
Resumen:
We consider a new timetabling problem arising from a real-world application in a private university in Buenos Aires, Argentina. In this paper we describe the problem in detail, which generalizes the Post-Enrollment Course Timetabling Problem (PECTP), propose an ILP model and a heuristic approach based on this formulation. This algorithm has been implemented and tested on instances obtained from real data, showing that the approach is feasible in practice and produces good quality solutions.
