Skip to main content
SpringerLink
Log in
Book cover

International Conference on the Practice and Theory of Automated Timetabling

PATAT 1997: Practice and Theory of Automated Timetabling II pp 78–91Cite as

An examination scheduling model to maximize students’ study time

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1408))

Abstract

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.

We would like to thank Richard Hartl, Asoka Wöhrmann and three anonymous referees for their helpful comments.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MathSciNet  Google Scholar 

  2. Arani, T. and V. Lofti (1989): A Three Phased Approach to Final Exam Scheduling, IIE Transactions 21, 86–96.

    Google Scholar 

  3. Balakrishnan, N., A. Lucena and R.T. Wong (1992): Scheduling examinations to reduce second-order conflicts, Computers and Operations Research 19, 353–361.

    Article  MATH  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 

  6. Carter, M.W. (1986): A survey of practical applications of examination timetabling algorithms, Operations Research 34, 193–202.

    MathSciNet  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 

  8. Carter, M.W., G. Laporte and J.W. Chinneck (1994): A General Examination Scheduling System, Interfaces 24, 109–120.

    Article  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 

  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.

    Article  Google Scholar 

  11. Eglese, R.W. and G.K. Rand (1987): Conference Seminar Timetabling, Journal of the Operational Research Society 38 (7), 591–598.

    Article  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 

  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.

    MATH  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 

  15. Johnson, D. (1990): Timetabling university examinations, Journal of the Operational Research Society 41, 39–47.

    Article  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 

  17. Kirkpatrick, S., C.D. Gelatt and M.P. Vecchi (1983): Optimization by Simulated Annealing, Science 220, 671–680.

    MathSciNet  Google Scholar 

  18. Laarhoven, P.J.M. van and E.H.L. Aarts (1988): Simulated Annealing: Theory and Applications, Kluwer, Dordrecht.

    Google Scholar 

  19. Laporte, G. and S. Desroches (1984): Examination Timetabling by Computer, Computers and Operations Research 11 (4), 351–360.

    Article  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 

  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.

    Article  MATH  Google Scholar 

  24. White, G.M. and P.W. Chan (1979): Towards the construction of optimal examination schedules, INFOR 17, 219–229.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Science, University of Vienna, Bruenner Str. 72, A-1210, Vienna, Austria

    Bernd Bullnheimer

Authors
  1. Bernd Bullnheimer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund Burke Michael Carter

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bullnheimer, B. (1998). An examination scheduling model to maximize students’ study time. In: Burke, E., Carter, M. (eds) Practice and Theory of Automated Timetabling II. PATAT 1997. Lecture Notes in Computer Science, vol 1408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055882

Download citation

  • DOI: https://doi.org/10.1007/BFb0055882

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64979-3

  • Online ISBN: 978-3-540-49803-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation