Abstract
This paper describes the problem of examination timetables at the University of Technology of Compiègne and the solutions we devised. The problem we faced was drawing up a week-long the examination timetable, taking into account a number of different constraints. These constraints are administrative, physical and related to preferences. Three tools were developed to solve this practical problem. The first tool is an exact method based on a tree search, the second is based on the tabu technique, and the third is an interactive computer aided design system. The most effective is the tree search method, but the tabu search technique may be a convenient alternative for several reasons. The computer aided design system can be used if all the automatic techniques fail. In the first part of this paper we describe the problem. In the second part we present a model using a reduction of the problem and relaxed constraints. Next, the three methods are described, and we briefly present the related problem of the assignment of invigilators. The results we present in the fourth part show that there exists no solution which takes into account all the constraints. We have solved the related problem of invigilator assignment using the well known out-of-kilter method. Computational results are presented.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Bibliography
AUST, RJ.; An Improvement Algorithm for School Timetabling. Computer J. Vol. 19, N∘ 4 pages 339–343, 1976.
BOUFFLET, J. P.; Mémoire de doctorat “Emplois du temps dans un environnement fortement contraint: exemple de l'U.T.C”. Thèse de Doctorat en Contrôle des Systèmes de l'Université de Technologie de Compiègne, Génie Informatique, 20 février 1992.
BOUFFLET, J. P. et TRIGANO, P.; “CELAME: Un Outil d'Aide à la Conception des Emplois du Temps de L'Université de Technologie de Compiègne”. ERGO IA'92, Ergonomie et Informatique Avancée, Biarritz France, 1992.
BRELAZ, D.; New Methods to Color the Vertices of a Graph. Communication of the ACM, Vol. 22, N∘4, pp 251–256, April 1979.
CANGALOVIC, M. and SCHREUDER, A. M.; Exact Colouring Algorithm for Weighted Graphs applied to Timetabling Problems with Lectures of different lengths. European Journal of Operational Research, Vol. 51, pp 248–258, 1991.
CARTER, M. W.; A Survey of Practical Applications of Examination Timetabling Algorithms. Operations research vol 34, N∘2, pages 193–202, 1986.
EDMONDS, J. and KARP, R. M.; “Theoretical improvements in algorithmic efficiency for network flow problems”; Journal of the ACM Vol 19, N∘2 pp 248–264.
FERLAND,J et Roy, S et TRAN GIA LOC; Quadratic Assignment Models for Examination Timetabling and Game Scheduling; Publication N∘ 485, Université de Montréal, 1983.
FERLAND,J et Roy, S et TRAN GIA LOC; The Timetabling Problem. Publication N∘ 531, Université de Montréal, 1985.
GLOVER, F.; TABU Search. CAAI Report 88-3, University of Colorado, Boulder, 1988.
GLOVER, F.; TABU Search: a Tutorial. Interface, Vol. 20, pp 74–94, 1990.
HERTZ, A. and DE WERRA, D.; Using Tabu Search Techniques For Graph Colouring. Computing Vol. 39, pp 345–351, 1987.
HERTZ, A.; Coloration des Sommets d'un Graphe et son Application à la Confection d'Horaire. Thèse N∘ 785, Ecole Polytechnique Fédérale de Lausanne, 1989.
NEGRE, S.; Algorithmes de Coloration de Graphe: Application à la Conception des Emplois du Temps de la Semaine d'Examen de l'Université de Technologie de Compiègne. Rapport de DEA de Contrôle des Systèmes, URA 817 Heudiasyc, Université de Technologie de Compiègne, 1993.
SCHMIDT, G. and STRÖHLEIN, T.; Timetable Construction an annoted Bibliography. Comput J Vol. 23, N∘ 4, pages 307–316, 1980.
TRIPATHY, A.; School Timetabling-A case in large binary integer linear programming. Management science Vol. 30, pages 1473–1489, 1984.
VI CAO, N. and Du MERLE, O. and VIAL, J. P.; Un Système de Confection Automatisée d'Horaires d'Examens; Revue des Sytème de Décision, Vol. 1, N∘4, pp 377–399, Editions Hermes, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boufflet, J.P., Nègre, S. (1996). Three methods used to solve an examination timetable problem. In: Burke, E., Ross, P. (eds) Practice and Theory of Automated Timetabling. PATAT 1995. Lecture Notes in Computer Science, vol 1153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61794-9_69
Download citation
DOI: https://doi.org/10.1007/3-540-61794-9_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61794-5
Online ISBN: 978-3-540-70682-3
eBook Packages: Springer Book Archive