Three methods used to solve an examination timetable problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1153, Issue , 1996, Pages 328-344

  Boufflet, Jean Paul ^a   Négre, Stéphane ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Graph colouring techniques; Implementation; Interactive vs. batch timetabling; Tabu search

Indexed keywords

COMPUTATION THEORY; COMPUTER AIDED DESIGN; SCHEDULING; TABU SEARCH;

AUTOMATIC TECHNIQUE; COMPUTATIONAL RESULTS; COMPUTER AIDED DESIGN SYSTEMS; CONVENIENT ALTERNATIVES; GRAPH COLOURING; IMPLEMENTATION; TABU SEARCH TECHNIQUE; TIMETABLING;

PROBLEM SOLVING;

EID: 84958773386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61794-9_69     Document Type: Conference Paper

References (16)

1. AUST, RJ.; An Improvement Algorithm for School Timetabling. Computer J. Vol 19, N° 4 pages 339-343, 1976.
2. BOUFFLET, J. P.; Memoire de doctorat “Emplois du temps dans un environnement fortement contraint: exemple de 1’U.T.C”. Thèse de Doctorat en Contrôle des Systèmes de l’Université de Technologie de Compifegne, Génie Infonnatique, 20 fevrier 1992.
3. BOUFFLET, J. P, et TRIGANO P.; “CELAME: Un Outil d’Aide & la Conception des Emplois du Temps de L’Université deTechnologie de Compiègne”. ERGO IA’92, Ergonomie et Informatique Avancfe, Biarritz France, 1992.
4. BRELAZ, D; New Methods to Color the Vertices of a Graph. Communication of the ACM, Vol 22, N°4, pp 251-256, April 1979.
5. 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.
6. CARTER, M W; A Survey of Practical Applications of Examination Timetabling Algorithms. Operations research vol 34, N°2, pages 193-202,1986.
7. 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.
8. FERLAND J & ROY S & TRAN GIA LOC; Quadratic Assignment Models for Examination Timetabling and Game Scheduling; Publication N° 485, Université de Montréal, 1983.
9. FERLAND J & ROY, S & 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.
10. GLOVER, F; TABU Search: a Tutorial. Interface, Vol 20, pp 7494, 1990.
11. HERTZ, A and DE WERRA, D; Using Tabu Search Techniques For Graph Colouring. Computing Vol 39, pp 345-351, 1987.
12. HERTZ, A.; Coloration des Sommets d’un Graphe & son Application à la Confection d’Horaire. Thèse N° 785, Ecole Polytechnique Fédérale de Lausanne, 1989.
13. NEGRE, S.; Algorithmes de Coloration de Graphe: Application k la Conception des Emplois du Temps de la Semaine d’Examen de 1’Université de Technologie de Compiègne. Rapport de DEA de Controle des Systemes, URA 817 Heudiasyc, University de Technologie de Compiègne, 1993.
14. SCHMIDT G and STRÖHLEIN T; Timetable Construction an annoted Bibliography. Comput J Vol 23, N° 4, pages 307-316, 1980.
15. TRIPATHY A; School Timetabling-A case in large binary integer linear programming. Management science Vol 30, pages 1473-1489, 1984.
16. 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 Dycision, Vol 1, N°4, pp 377-399, Editions Hermes, 1992