An ILP based heuristic for a generalization of the post-enrolment course timetabling problem

ISABEL MÉNDEZ-DÍAZ; PAULA ZABALA; JUAN JOSÉ MIRANDA BRONT

Montevideo

Workshop; VIII ALIO/EURO Workshop on Applied Combinatorial Optimization; 2014

Facultad de Ingeniería, Universidad de la República

We consider a new timetabling problem arising from a real-world application in a private university in Buenos Aires, Argentina. In this extended abstract we describe the problem in detail, which generalizes the Post-Enrolment Course Timetabling Problem (PECTP), propose an ILP model and an heuristic approach based on this formulation. The 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.