Abstract
In 1986, Carter published a survey of papers on practical examination timetabling, in the intervening years, there have been a number of new applications, and several innovative techniques have been attempted. In this paper, we will classify the algorithms, discuss their reported results and try to draw some conclusions on the state of the art. We have not attempted to perform any experimental comparisons on the different methods.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arani, T., Karwan, M., and Lotfi, V., “A Lagrangian Relaxation Approach to Solve the Second Phase of the Exam Scheduling Problem”, European Journal of Operations Research 34, 1988, 372–383.
Arani, T., and Lotfi, V., “A Three Phased Approach to Final Exam Scheduling”, IIE Transactions 21, 1989, 86–96.
Balakrishnan, N., Lucena, A., and Wong, R.T., “Scheduling Examinations to Reduce Second-order Conflicts”, Computers & Operations Research 19, 1992, 353–361.
Balakrishnan, N., “Examination Scheduling: A Computerized Application”, Omega 19, 1991, 37–41.
Barham, A.M. and Westwood, J.B., “A Simple Heuristic to Facilitate Course Timetabling”, Journal of the Operational Research Society 29, 1978, 1055–1060.
Boizumault, P., Delon, Y., and Péridy, L., “Constraint Logic Programming for Examination Timetabling”, Journal of Logic Programming, 1995, 1–17.
Boufflet, J.P., and Negre, S., “Three Methods Used to Solve an Examination Timetabling Problem”, in The Practice and Theory of Automated Timetabling (E.K. Burke and P. Ross eds.), Springer-Verlag Lecture Notes in Computer Science, 1996.
Broder, S., “Final Examination Scheduling”, Communications of the A.C.M. 7, 1964, 494–498.
Broder, S., “A Heuristic Algorithm for Timetable Construction”, Journal of Educational Data Processing 5, 1968, 117–123.
Broder S., On the Problem of Time Table Construction, Communications of the ACM, 9, 1966, 257.
Burke, E.K., Newal, J.P., and Weare, R.F., “A Memetic Algorithm for University Exam Timetabling”, in The Practice and Theory of Automated Timetabling (E.K. Burke and P. Ross eds.), Springer-Verlag Lecture Notes in Computer Science, 1996.
Carter, M.W., “A Survey of Practical Applications of Examination Timetabling Algorithms”, Operations Research 34, 1986, 193–202.
Carter, M.W., Laporte, G., and Chinneck, J.W., “A General Examination Scheduling System”, Interfaces 24, 1994, 109–120.
Carter, M.W., Laporte, G., and Lee, S.Y., “Examination Timetabling: Algorithmic Strategies and Applications”, Journal of the Operational Research Society 47, No. 3, 1996, 373–383.
Carter, M.W., “Examination Room Assignment for EXAMINE”, Working Paper, May 1995.
Cole, A.J., “The Preparation of Examination Timetables Using a Small-Store Computer”, The Computer Journal 7, 1964, 117–121.
Corne, D., Fang, H.L., and Mellish, C., “Solving the Modular Exam Scheduling Problem with Genetic Algorithms”, in Proc of the Sixth International Conf. on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, P.W.H. Chung, G. Lovegrove & M. Ali (eds), 1993, 370–373.
Corne, D., and Ross, P., “Peckish Initialization Strategies For Evolutionary Timetabling” in The Practice and Theory of Automated Timetabling (E.K. Burke and P. Ross eds.), Springer-Verlag Lecture Notes in Computer Science, 1996.
Desroches, S., Laporte, G. and Rousseau, J., “HOREX: A Computer Program for the Construction of Examination Timetables”, INFOR 16, 1978, 294–298.
Ergül, A., “GA-Based Examination Scheduling Experience at Middle East Technical University” in The Practice and Theory of Automated Timetabling (E.K. Burke and P. Ross eds.), Springer-Verlag Lecture Notes in Computer Science, 1996.
Fisher, J.G. and Shier, D.R., “A Heuristic Procedure for Large-Scale Examination Scheduling Problems”, Tech. Report 417, Dept of Mathematical Sciences, Clemson University, March, 1983.
Foxley, E., and Lockyer, K., “The Construction of Examination Timetables by Computer”, The Computer Journal 11, 1968, pp. 264–268.
Hertz, A., “Tabu Search for Large Scale Timetabling Problems”, European Journal of Operations Research 54, 1991, 39–47.
Johnson, D., “Timetabling University Examinations”, Journal of the Operational Research Society 41, 1990, 39–47.
Laporte, G. and Desroches, S., “Examination Timetabling by Computer”, Computers and Operations Research 11, 1984, 351–360.
Leong, T.Y., and Yeong, W.Y., “Examination Scheduling: A Quadratic Assignment Perspective”, Proc. Int'l Conf. on Optimization: Techniques and Applications, Singapore, April 1987, 550–558.
Leong, T.Y., and Yeong, W.Y., “A Hierarchical Decision Support System for University Examination Scheduling”, working paper, National University of Singapore, Sept., 1990.
Leong Y.L., “Right on Schedule: Exam Timetabling at the National University of Singapore Gets an Added Boost with New Tools”, ComputerWorld, May 12–18 1995, 22–23.
Lotfi, V., and Cerveny, R., “A Final-exam-scheduling Package”, Journal of the Operational Research Society 42, 1991, 205–216.
Mehta, N.K., “The Application of a Graph Coloring Method to an Examination Scheduling Problem”, Interfaces 11, 1981, 57–64.
Mehta N.K., Computer-Based Examination Management System, Journal of Educational Technology Systems, 11, 1982, 185–198.
Nuijten, W.P.M., Kunnen, G.M., Aarts, E.H.L. and Dignum, F.P.M., “Examination Time Tabling: A Case Study for Constraint Satisfaction”, Proceedings of the ECAI '94 Workshop on Constraint Satisfaction Issues Raised by Practical Applications, 11–19.
Thompson, J.M., and Dowsland, K.A., “Variants of Simulated Annealing for the Examination Timetabling Problem”, working paper, European Business Management School, Swansea University, Swansea, UK 1995a, to appear in Annals of O.R.
Thompson, J.M., and Dowsland, K.A., “TISSUE Wipes Away Exam Time Tears: A Computerised System Helps Swansea University Improve Examination Timetabling”, O.R. Insight 8, No. 4, 1995, 28–32.
Thompson, J.M., and Dowsland, K.A., “General Cooling Schedules for a Simulated Annealing Based Timetabling System” in The Practice and Theory of Automated Timetabling (E.K. Burke and P. Ross eds.), Springer-Verlag Lecture Notes in Computer Science, 1996.
Tripathy, A., “A Lagrangian Relaxation Approach to Course Timetabling”, Journal of the Operational Research Society 31, 1980, 599–603.
Tripathy, A., “School Timetabling — A Case in Large Binary Integer Programming”, Management Science 30, 1984, 1473–1489.
White, G.M. and Chan, P.W., “Towards the Construction of Optimal Examination Timetables”, INFOR 17, 1979, 219–229.
White, G.M., and Haddad, M., “An Heuristic Method for Optimizing Examination Schedules Which Have Day and Night Courses”, Computers and Education 7, 1983, pp. 235–238.
Wood, D.C., “A System for Computing University Examination Timetables”, Computer Journal 11, 1968, 41–47.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carter, M.W., Laporte, G. (1996). Recent developments in practical examination timetabling. 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_49
Download citation
DOI: https://doi.org/10.1007/3-540-61794-9_49
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