Artículo

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

Méndez-Díaz, Isabel; Zabala, Paula LorenaIcon ; Miranda Bront, Juan JoseIcon
Fecha de publicación: 12/2016
Editorial: Pergamon-Elsevier Science Ltd
Revista: Computers & Operations Research
ISSN: 0305-0548
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:

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.
Palabras clave: Integer Programming , Matheuristic , University Timetabling
 
Archivos asociados
Thumbnail
 
Tamaño: 774.3Kb
Formato: PDF
.
Licencia
info:eu-repo/semantics/openAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Atribución-NoComercial-SinDerivadas 2.5 Argentina (CC BY-NC-ND 2.5 AR)
Identificadores
URI: http://hdl.handle.net/11336/59706
DOI: http://dx.doi.org/10.1016/j.cor.2016.06.018
URL: https://www.sciencedirect.com/science/article/pii/S0305054816301502
Colecciones
Articulos(ICC)
Articulos de INSTITUTO DE INVESTIGACION EN CIENCIAS DE LA COMPUTACION
Articulos(OCA CIUDAD UNIVERSITARIA)
Articulos de OFICINA DE COORDINACION ADMINISTRATIVA CIUDAD UNIVERSITARIA
Citación
Méndez-Díaz, Isabel; Zabala, Paula Lorena; Miranda Bront, Juan Jose; An ILP based heuristic for a generalization of the post-enrollment course timetabling problem; Pergamon-Elsevier Science Ltd; Computers & Operations Research; 76; 12-2016; 195-207
Compartir
Altmétricas