An examination scheduling model to maximize students’ study time
In this paper we develop a model for small scale examination scheduling. We formulate a quadratic assignment problem and then transform it into a quadratic semi assignment problem. The objective of our model is to maximize student’s study time as opposed to minimizing some cost function as suggested in other QAP approaches. We use simulated annealing to demonstrate the model’s ability to generate schedules that satisfy student as well as university expectations. Furthermore the application of the model to a real world situation is presented.
Unable to display preview. Download preview PDF.
- 2.Arani, T. and V. Lofti (1989): A Three Phased Approach to Final Exam Scheduling, IIE Transactions 21, 86–96.Google Scholar
- 4.Boufflet, J.P. and S. Negre (1996): Three Methods Used to Solve an Examination Timetable Problem, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetabling, Springer, Berlin, 327–344.Google Scholar
- 5.Burke, E.K., J.P. Newall and R.F. Weare (1996): A Memetic Algorithm for University Exam Timetabling, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetabling, Springer, Berlin, 241–250.Google Scholar
- 7.Carter, M.W. and G. Laporte (1996): Recent Developments in Practical Examination Timetabling, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetabling, Springer, Berlin, 3–21.Google Scholar
- 9.Desroches, S., G. Laporte and J.-M. Rousseau (1978): HOREX: a computer program for the construction of examination schedules, INFOR 16, 294–298.Google Scholar
- 12.Ergül, A. (1995): GA-Based Examination Scheduling Experience at Middle East Technical University, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetabling, Springer, Berlin, 212–226.Google Scholar
- 14.Hansen, M.P., V. Lauersen and R.V.V. Vidal (1995): Nationwide Scheduling of Examinations: Lessons from Experience, paper presented at: First International Conference on the Practice and Theory of Automated Timetabling, Edinburgh, 30th Aug.–1st Sept. 1995.Google Scholar
- 16.Karp, R.M. (1972): Reducibility among Combinatorial Problems, in: Miller, R.E. and J.W. Thatcher (eds.): Complexity of Computer Computations, Plenum Press, New York, 85–103.Google Scholar
- 18.Laarhoven, P.J.M. van and E.H.L. Aarts (1988): Simulated Annealing: Theory and Applications, Kluwer, Dordrecht.Google Scholar
- 20.Leong, T.Y. and W.Y. Yeong (1987): Examination Scheduling: A Quadratic Assignment Perspective, Proc. Int. Conf. on Optimization: Techniques and Applications, Singapore, April 1987, 550–558.Google Scholar
- 21.Mehta, N.K. (1981): The application of a graph coloring method to an examination scheduling problem, Interfaces 11, 57–64.Google Scholar
- 22.Thompson, J. and K.A. Dowsland (1996): General Cooling Schedules for a Simulated Annealing Based Timetabling System, in: Burke, E. and P. Ross (eds.): Practice and Theory of Automated Timetabling, Springer, Berlin, 345–363.Google Scholar
- 24.White, G.M. and P.W. Chan (1979): Towards the construction of optimal examination schedules, INFOR 17, 219–229.Google Scholar