IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v194y2012i1p291-31510.1007-s10479-011-0997-x.html
   My bibliography  Save this article

A new model for automated examination timetabling

Author

Listed:
  • Barry McCollum
  • Paul McMullan
  • Andrew Parkes
  • Edmund Burke
  • Rong Qu

Abstract

Automated examination timetabling has been addressed by a wide variety of methodologies and techniques over the last ten years or so. Many of the methods in this broad range of approaches have been evaluated on a collection of benchmark instances provided at the University of Toronto in 1996. Whilst the existence of these datasets has provided an invaluable resource for research into examination timetabling, the instances have significant limitations in terms of their relevance to real-world examination timetabling in modern universities. This paper presents a detailed model which draws upon experiences of implementing examination timetabling systems in universities in Europe, Australasia and America. This model represents the problem that was presented in the 2nd International Timetabling Competition (ITC2007). In presenting this detailed new model, this paper describes the examination timetabling track introduced as part of the competition. In addition to the model, the datasets used in the competition are also based on current real-world instances introduced by EventMAP Limited. It is hoped that the interest generated as part of the competition will lead to the development, investigation and application of a host of novel and exciting techniques to address this important real-world search domain. Moreover, the motivating goal of this paper is to close the currently existing gap between theory and practice in examination timetabling by presenting the research community with a rigorous model which represents the complexity of the real-world situation. In this paper we describe the model and its motivations, followed by a full formal definition. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • Barry McCollum & Paul McMullan & Andrew Parkes & Edmund Burke & Rong Qu, 2012. "A new model for automated examination timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 291-315, April.
  • Handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:291-315:10.1007/s10479-011-0997-x
    DOI: 10.1007/s10479-011-0997-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-011-0997-x
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-011-0997-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. van Loon, J. N. M., 1981. "Irreducibly inconsistent systems of linear inequalities," European Journal of Operational Research, Elsevier, vol. 8(3), pages 283-288, November.
    2. Salem Al-Yakoob & Hanif Sherali & Mona Al-Jazzaf, 2010. "A mixed-integer mathematical modeling approach to exam timetabling," Computational Management Science, Springer, vol. 7(1), pages 19-46, January.
    3. Burke, E.K. & Eckersley, A.J. & McCollum, B. & Petrovic, S. & Qu, R., 2010. "Hybrid variable neighbourhood approaches to university exam timetabling," European Journal of Operational Research, Elsevier, vol. 206(1), pages 46-53, October.
    4. Barry McCollum & Andrea Schaerf & Ben Paechter & Paul McMullan & Rhyd Lewis & Andrew J. Parkes & Luca Di Gaspero & Rong Qu & Edmund K. Burke, 2010. "Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 120-130, February.
    5. Burke, Edmund K. & McCollum, Barry & Meisels, Amnon & Petrovic, Sanja & Qu, Rong, 2007. "A graph-based hyper-heuristic for educational timetabling problems," European Journal of Operational Research, Elsevier, vol. 176(1), pages 177-192, January.
    6. K A Dowsland & J M Thompson, 2005. "Ant colony optimization for the examination scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 426-438, April.
    7. E.K. Burke & J.P. Newall, 2004. "Solving Examination Timetabling Problems through Adaption of Heuristic Orderings," Annals of Operations Research, Springer, vol. 129(1), pages 107-134, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    2. Taha Arbaoui & Jean-Paul Boufflet & Aziz Moukrim, 2015. "Preprocessing and an improved MIP model for examination timetabling," Annals of Operations Research, Springer, vol. 229(1), pages 19-40, June.
    3. Alejandro Cataldo & Juan-Carlos Ferrer & Jaime Miranda & Pablo A. Rey & Antoine Sauré, 2017. "An integer programming approach to curriculum-based examination timetabling," Annals of Operations Research, Springer, vol. 258(2), pages 369-393, November.
    4. T. Godwin, 2022. "Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy," OPSEARCH, Springer;Operational Research Society of India, vol. 59(3), pages 1055-1093, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Mohammed Al-Betar & Ahamad Khader & Iyad Doush, 2014. "Memetic techniques for examination timetabling," Annals of Operations Research, Springer, vol. 218(1), pages 23-50, July.
    2. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    3. Edmund Burke & Graham Kendall & Mustafa Mısır & Ender Özcan, 2012. "Monte Carlo hyper-heuristics for examination timetabling," Annals of Operations Research, Springer, vol. 196(1), pages 73-90, July.
    4. Edmund K. Burke & Yuri Bykov, 2016. "An Adaptive Flex-Deluge Approach to University Exam Timetabling," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 781-794, November.
    5. R. A. Oude Vrielink & E. A. Jansen & E. W. Hans & J. Hillegersberg, 2019. "Practices in timetabling in higher education institutions: a systematic review," Annals of Operations Research, Springer, vol. 275(1), pages 145-160, April.
    6. Moritz Mühlenthaler & Rolf Wanka, 2016. "Fairness in academic course timetabling," Annals of Operations Research, Springer, vol. 239(1), pages 171-188, April.
    7. Turabieh, Hamza & Abdullah, Salwani, 2011. "An integrated hybrid approach to the examination timetabling problem," Omega, Elsevier, vol. 39(6), pages 598-607, December.
    8. Abdul Rahman, Syariza & Bargiela, Andrzej & Burke, Edmund K. & Özcan, Ender & McCollum, Barry & McMullan, Paul, 2014. "Adaptive linear combination of heuristic orderings in constructing examination timetables," European Journal of Operational Research, Elsevier, vol. 232(2), pages 287-297.
    9. Sabar, Nasser R. & Ayob, Masri & Kendall, Graham & Qu, Rong, 2012. "A honey-bee mating optimization algorithm for educational timetabling problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 533-543.
    10. De Boeck, Liesje & Beliën, Jeroen & Creemers, Stefan, 2016. "A column generation approach for solving the examination-timetabling problemAuthor-Name: Woumans, Gert," European Journal of Operational Research, Elsevier, vol. 253(1), pages 178-194.
    11. Álvaro García-Sánchez & Araceli Hernández & Eduardo Caro & Gonzalo Jiménez, 2019. "Universidad Politécnica de Madrid Uses Integer Programming for Scheduling Weekly Assessment Activities," Interfaces, INFORMS, vol. 49(2), pages 104-116, March.
    12. Edmund Burke & Rong Qu & Amr Soghier, 2014. "Adaptive selection of heuristics for improving exam timetables," Annals of Operations Research, Springer, vol. 218(1), pages 129-145, July.
    13. Li, Jingpeng & Bai, Ruibin & Shen, Yindong & Qu, Rong, 2015. "Search with evolutionary ruin and stochastic rebuild: A theoretic framework and a case study on exam timetabling," European Journal of Operational Research, Elsevier, vol. 242(3), pages 798-806.
    14. Qu, Rong & Burke, Edmund K. & McCollum, Barry, 2009. "Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems," European Journal of Operational Research, Elsevier, vol. 198(2), pages 392-404, October.
    15. Syariza Abdul-Rahman & Edmund Burke & Andrzej Bargiela & Barry McCollum & Ender Özcan, 2014. "A constructive approach to examination timetabling based on adaptive decomposition and ordering," Annals of Operations Research, Springer, vol. 218(1), pages 3-21, July.
    16. R Qu & E K Burke, 2009. "Hybridizations within a graph-based hyper-heuristic framework for university timetabling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1273-1285, September.
    17. Pillay, N. & Banzhaf, W., 2009. "A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem," European Journal of Operational Research, Elsevier, vol. 197(2), pages 482-491, September.
    18. Zhang, Defu & Liu, Yongkai & M'Hallah, Rym & Leung, Stephen C.H., 2010. "A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems," European Journal of Operational Research, Elsevier, vol. 203(3), pages 550-558, June.
    19. Taha Arbaoui & Jean-Paul Boufflet & Aziz Moukrim, 2015. "Preprocessing and an improved MIP model for examination timetabling," Annals of Operations Research, Springer, vol. 229(1), pages 19-40, June.
    20. Christine Mumford, 2010. "A multiobjective framework for heavily constrained examination timetabling problems," Annals of Operations Research, Springer, vol. 180(1), pages 3-31, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:291-315:10.1007/s10479-011-0997-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.