A tabu search algorithm to schedule university examinations.

Alvarez-Valdés, Ramón, Crespo, Enric, and Tamarit, José M.. "A tabu search algorithm to schedule university examinations.." Qüestiió 21.1-2 (1997): 201-215. <http://eudml.org/doc/40188>.

@article{Alvarez1997,
abstract = {Scheduling examinations in a large university is an increasingly complex problem, due to its size, the growing flexibility of students' curricula and the interest in including a wide set of objectives and constraints. In this paper we present a new algorithm for this problem and its application to a university in Spain.A combination of heuristics, based on Tabu Search, first finds a solution in which no student has two exams simultaneously and then improves it by evenly spacing the exams in the examination period. The algorithm has been imbedded into a package to be used by Faculty administrators and proposes solutions to be considered by the parties involved: administration, departments and students. Computational results, comparing our results with the timetables actually used, are presented.},
author = {Alvarez-Valdés, Ramón, Crespo, Enric, Tamarit, José M.},
journal = {Qüestiió},
keywords = {Teoría de búsquedas; Planificación de operaciones; Distribución temporal; Heurística; Ordenación temporal de tareas; timetabling; scheduling; heuristics; tabu search},
language = {eng},
number = {1-2},
pages = {201-215},
title = {A tabu search algorithm to schedule university examinations.},
url = {http://eudml.org/doc/40188},
volume = {21},
year = {1997},
}

TY - JOUR
AU - Alvarez-Valdés, Ramón
AU - Crespo, Enric
AU - Tamarit, José M.
TI - A tabu search algorithm to schedule university examinations.
JO - Qüestiió
PY - 1997
VL - 21
IS - 1-2
SP - 201
EP - 215
AB - Scheduling examinations in a large university is an increasingly complex problem, due to its size, the growing flexibility of students' curricula and the interest in including a wide set of objectives and constraints. In this paper we present a new algorithm for this problem and its application to a university in Spain.A combination of heuristics, based on Tabu Search, first finds a solution in which no student has two exams simultaneously and then improves it by evenly spacing the exams in the examination period. The algorithm has been imbedded into a package to be used by Faculty administrators and proposes solutions to be considered by the parties involved: administration, departments and students. Computational results, comparing our results with the timetables actually used, are presented.
LA - eng
KW - Teoría de búsquedas; Planificación de operaciones; Distribución temporal; Heurística; Ordenación temporal de tareas; timetabling; scheduling; heuristics; tabu search
UR - http://eudml.org/doc/40188
ER -