An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
2016, Computers & Operations Research 76, 195-207, 2016Citas: 27
Agregar PDF Importar citas Importar citas SCRAPME Plots Conexiones
Autor(es)
Isabel Méndez-Díaz and Paula Zabala and Juan José Miranda-Bront
Abstract
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.