An examination scheduling model to maximize students’ study time

  • Bernd Bullnheimer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1408)


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.

Unable to display preview. Download preview PDF.


  1. 1.
    Arani, T., M. Karwan and V. Lofti (1988): A Langrangian relaxation approach to solve the second phase of the exam scheduling problem, European Journal of Operational Research 34, 372–383.MathSciNetCrossRefGoogle Scholar
  2. 2.
    Arani, T. and V. Lofti (1989): A Three Phased Approach to Final Exam Scheduling, IIE Transactions 21, 86–96.Google Scholar
  3. 3.
    Balakrishnan, N., A. Lucena and R.T. Wong (1992): Scheduling examinations to reduce second-order conflicts, Computers and Operations Research 19, 353–361.MATHCrossRefGoogle Scholar
  4. 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. 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
  6. 6.
    Carter, M.W. (1986): A survey of practical applications of examination timetabling algorithms, Operations Research 34, 193–202.MathSciNetGoogle Scholar
  7. 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
  8. 8.
    Carter, M.W., G. Laporte and J.W. Chinneck (1994): A General Examination Scheduling System, Interfaces 24, 109–120.CrossRefGoogle Scholar
  9. 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
  10. 10.
    Dorigo, M., Maniezzo, V. and A. Colorni (1996): Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics 26 (1), 29–41.CrossRefGoogle Scholar
  11. 11.
    Eglese, R.W. and G.K. Rand (1987): Conference Seminar Timetabling, Journal of the Operational Research Society 38 (7), 591–598.CrossRefGoogle Scholar
  12. 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
  13. 13.
    Garey, M.R. and D.S. Johnson (1979): Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H.Freeman, New York.MATHGoogle Scholar
  14. 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
  15. 15.
    Johnson, D. (1990): Timetabling university examinations, Journal of the Operational Research Society 41, 39–47.CrossRefGoogle Scholar
  16. 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
  17. 17.
    Kirkpatrick, S., C.D. Gelatt and M.P. Vecchi (1983): Optimization by Simulated Annealing, Science 220, 671–680.MathSciNetGoogle Scholar
  18. 18.
    Laarhoven, P.J.M. van and E.H.L. Aarts (1988): Simulated Annealing: Theory and Applications, Kluwer, Dordrecht.Google Scholar
  19. 19.
    Laporte, G. and S. Desroches (1984): Examination Timetabling by Computer, Computers and Operations Research 11 (4), 351–360.CrossRefGoogle Scholar
  20. 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. 21.
    Mehta, N.K. (1981): The application of a graph coloring method to an examination scheduling problem, Interfaces 11, 57–64.Google Scholar
  22. 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
  23. 23.
    Welsh, D.J.A. and M.B. Powell (1967): An upper bound for the chromatic number of a graph and its application to timetabling problems, Computer Journal 10, 85–86.MATHCrossRefGoogle Scholar
  24. 24.
    White, G.M. and P.W. Chan (1979): Towards the construction of optimal examination schedules, INFOR 17, 219–229.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Bernd Bullnheimer
    • 1
  1. 1.Department of Management ScienceUniversity of ViennaViennaAustria

Personalised recommendations