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

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 bas...

Descripción completa

Detalles Bibliográficos
Autores principales: Méndez-Díaz, I., Zabala, P., Miranda-Bront, J.J.
Formato: JOUR
Materias:
Integer programming
Matheuristic
University timetabling
Heuristic methods
Buenos Aires , Argentina
Course timetabling
Heuristic approach
ILP modeling
Real-world
Timetabling problem
Scheduling
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03050548_v76_n_p195_MendezDiaz
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id todo:paper_03050548_v76_n_p195_MendezDiaz
record_format dspace
spelling todo:paper_03050548_v76_n_p195_MendezDiaz2023-10-03T15:21:24Z An ILP based heuristic for a generalization of the post-enrollment course timetabling problem Méndez-Díaz, I. Zabala, P. Miranda-Bront, J.J. Integer programming Matheuristic University timetabling Heuristic methods Integer programming Buenos Aires , Argentina Course timetabling Heuristic approach ILP modeling Matheuristic Real-world Timetabling problem University timetabling Scheduling 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. © 2016 Elsevier Ltd Fil:Méndez-Díaz, I. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Zabala, P. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Miranda-Bront, J.J. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_03050548_v76_n_p195_MendezDiaz
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic Integer programming
Matheuristic
University timetabling
Heuristic methods
Integer programming
Buenos Aires , Argentina
Course timetabling
Heuristic approach
ILP modeling
Matheuristic
Real-world
Timetabling problem
University timetabling
Scheduling
spellingShingle Integer programming
Matheuristic
University timetabling
Heuristic methods
Integer programming
Buenos Aires , Argentina
Course timetabling
Heuristic approach
ILP modeling
Matheuristic
Real-world
Timetabling problem
University timetabling
Scheduling
Méndez-Díaz, I.
Zabala, P.
Miranda-Bront, J.J.
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
topic_facet Integer programming
Matheuristic
University timetabling
Heuristic methods
Integer programming
Buenos Aires , Argentina
Course timetabling
Heuristic approach
ILP modeling
Matheuristic
Real-world
Timetabling problem
University timetabling
Scheduling
description 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. © 2016 Elsevier Ltd
format JOUR
author Méndez-Díaz, I.
Zabala, P.
Miranda-Bront, J.J.
author_facet Méndez-Díaz, I.
Zabala, P.
Miranda-Bront, J.J.
author_sort Méndez-Díaz, I.
title An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
title_short An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
title_full An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
title_fullStr An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
title_full_unstemmed An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
title_sort ilp based heuristic for a generalization of the post-enrollment course timetabling problem
url http://hdl.handle.net/20.500.12110/paper_03050548_v76_n_p195_MendezDiaz
work_keys_str_mv AT mendezdiazi anilpbasedheuristicforageneralizationofthepostenrollmentcoursetimetablingproblem
AT zabalap anilpbasedheuristicforageneralizationofthepostenrollmentcoursetimetablingproblem
AT mirandabrontjj anilpbasedheuristicforageneralizationofthepostenrollmentcoursetimetablingproblem
AT mendezdiazi ilpbasedheuristicforageneralizationofthepostenrollmentcoursetimetablingproblem
AT zabalap ilpbasedheuristicforageneralizationofthepostenrollmentcoursetimetablingproblem
AT mirandabrontjj ilpbasedheuristicforageneralizationofthepostenrollmentcoursetimetablingproblem
_version_ 1807320591100805120

Ejemplares similares