Skip to main content
Log in

An integer programming approach to curriculum-based examination timetabling

  • CLAIO 2014
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The examination timetabling problem (ETTP) consists in the assignment of specific dates to the exams of a set of courses assuming that the course enrollments are known. This problem is also known as post-enrollment ETTP. In this paper, we describe and solve a variant of the ETTP which has two particularities: (1) it does not assume the course enrollments as known and uses the curriculum of the degree program to evaluate potential conflicts in the exam schedules, and (2) it considers the exams and classrooms of multiple degree programs simultaneously. We refer to this variant of the ETTP as curriculum-based examination timetabling problem (CB-ETTP), a problem faced by many universities worldwide, being the Universidad Diego Portales (UDP) in Santiago of Chile one of them. To the best of our knowledge, this problem has not been described as such in the ETTP literature. We propose an approach to solve the CB-ETTP consisting of four sequential stages. The first stage groups courses into clusters and generates classroom configurations called room patterns. The second stage assigns time slots and room patterns to course clusters. Then, the third stage assigns time slots and room patterns to individual courses. Finally, the fourth stage generates a definitive exam schedule assigning specific rooms to each course exam. We evaluate the performance of the proposed approach by applying it to real-world instances generated based on data provided by the Faculty of Engineering at the UDP. The results show a reduction in the number of conflicts and rescheduling with respect to the current exam scheduling practice used by this university.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Abdullah, S., Ahmadi, S., Burke, E., & Dror, M. (2007a). Investigating Ahuja–Orlin’s large neighbourhood search approach for examination timetabling. OR Spectrum, 29, 351–372.

    Article  Google Scholar 

  • Abdullah, S., Ahmadi, S., Burke, E., Dror, M., & McCollum, B. (2007b). A tabu based large neighbourhood search methodolgy for the capacited examination timetabling problem. Journal of Operational Research, 58, 1494–1502.

    Article  Google Scholar 

  • Abdul-Rahman, S., Burke, E., Bargiela, A., McCollum, B., & Özcan, E. (2014). A constructive approach to examination timetabling based on adaptive decomposition and ordering. Annals of Operations Research, 218, 3–21.

    Article  Google Scholar 

  • Aboudi, R., & Barcia, P. (1998). Determining cutting stock patterns when defects are present. Annals of Operations Research, 82, 343–354.

    Article  Google Scholar 

  • Al-Yakoob, A., Sherali, H., & Al-Jazzaf, M. (2010). A mixed-integer mathematical modeling approach to exam timetabling. Computer Management Science, 7, 19–46.

    Article  Google Scholar 

  • Asmuni, H., Burke, E., Garibaldi, J., McCollum, B., & Parkes, A. (2009). An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables. Computer and Operations Research, 36, 981–1001.

    Article  Google Scholar 

  • Ayob, M., Malik, A., Abdullah, S., Razak Hamdam, A., Kendall, G., & Qu, R. (2007). Solving a practical examination timetabling problem: A case study. Lecture Notes in Computer Science, 4707, 611–624.

    Article  Google Scholar 

  • Azimi, Z. N. (2005). Hybrid heuristics for examination timetabling problem. Applied Mathematics and Computation, 163, 705–733.

    Article  Google Scholar 

  • Bellio, R., Di Gaspero, L., & Schaerf, A. (2012). Design and statistical analysis of a hybrid local search algorithm for course timetabling. Journal of Scheduling, 15, 49–61.

    Article  Google Scholar 

  • Beyrouthy, C., Burke, E., McCollum, B., McMullan, P., & Parkes, A. (2010). University space planning and space-type profiles. Journal of Scheduling, 13(4), 363–374.

    Article  Google Scholar 

  • Birbas, T., Daskalaki, S., & Housos, E. (2009). School Timetabling for quality student and teacher schedules. Journal of Scheduling, 12, 177–197.

    Article  Google Scholar 

  • Bonutti, A., De Cesco, F., Di Gaspero, L., & Schaerf, A. (2012). Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, visualization, and results. Annals of Operations Research, 194, 59–70.

    Article  Google Scholar 

  • Burke, E., Bykov, Y., Newall, J., & Petrovic, S. (2004a). A time predefined local search approach to exam timetabling problems. IIE Transactions, 36, 509–528.

    Article  Google Scholar 

  • Burke, E., Bykov, Y., & Petrovic, S. (2001). A multicriteria approach to examination timetabling. Lectures Notes in Computer Science, 2079, 118–131.

    Article  Google Scholar 

  • Burke, E., De Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004b). The state of the art of nurse rostering. Journal of Scheduling, 7, 441–499.

    Article  Google Scholar 

  • Burke, E., Eckersley, A., McCollum, B., Petrovic, S., & Qu, R. (2010a). Hybrid variable neighbourhood approaches to university exam timetabling. European Journal of Operational Research, 206, 46–53.

    Article  Google Scholar 

  • Burke, E., Kendall, G., Misir, M., & Özcan, E. (2012). Monte carlo hyper-heuristics for examination timetabling. Annals of Operations Research, 2012, 73–90.

    Article  Google Scholar 

  • Burke, E., Li, J., & Qu, R. (2009). A Pareto-based search methodology for multi-objective nurse scheduling. Annals of Operations Research,. doi:10.1007/s10479-009-0590-8.

    Google Scholar 

  • Burke, E., Maracek, J., Parkes, A., & Rudová, H. (2010b). Decomposition, reformulation, and diving in university course timetabling. Computers and Operations Research, 37(3), 582–597.

    Article  Google Scholar 

  • Burke, E., Newall, J., & Weare, R. (1996). A memetic algorithm for university Timetabling. Lecture Notes in Computer Science, 1153, 241–250.

    Article  Google Scholar 

  • Burke, E., Petrovic, S., & Qu, R. (2006). Case-based heuristic selection for timetabling problems. Journal of Scheduling, 9, 115–132.

    Article  Google Scholar 

  • Burke, E., Pham, N., Qu, R., & Yellen, J. (2012b). Linear combination of heuristics for examination timetabling. Annals of Operations Research, 194, 89–109.

    Article  Google Scholar 

  • Carter, M., Laporte, G., & Lee, S. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of Operational Research Society, 47(3), 373–383.

    Article  Google Scholar 

  • Cheong, C., Tan, K., & Veeravalli, B. (2009). A multi-objective evolutionary algorithm for examination timetabling. Journal of Scheduling, 12, 121–146.

    Article  Google Scholar 

  • Daskalaki, S., Birbas, T., & Housos, E. (2004). An integer programming formulation for a case study in university timetabling. European Journal of Operational Research, 153, 117–135.

    Article  Google Scholar 

  • De Causmaecker, P., Demeester, P., & Vanden Berghe, G. (2009). A descomposed metaheuristic approach for a real-world university timetabling problem. European Journal of Operational Research, 195, 307–318.

    Article  Google Scholar 

  • De Leone, R., Festa, P., & Marchitto, E. (2011). A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution. Journal of Heuristics, 17, 441–466.

    Article  Google Scholar 

  • De Werra, D. (1985). An introduction to timetabling. European Journal of Operational Research, 19, 151–162.

    Article  Google Scholar 

  • Demeester, P., Bilgin, B., De Causmaecker, P., & Vanden Berghe, G. (2012). A hyperheuristic approach to examination timetabling problems: Benchmarks and a new roblem from practice. Journal of Scheduling, 15, 83–103.

    Article  Google Scholar 

  • Derigs, U., & Friederichs, S. (2013). Air cargo scheduling: Integrated models and solution procedures. OR Spectrum, 35(2), 325–362.

    Article  Google Scholar 

  • Dimopoulou, M., & Miliotis, P. (2001). Implementation of a university course and examination timetabling system. European Journal of Operational Research, 130, 202–213.

    Article  Google Scholar 

  • Duran, G., Guajardo, M., Miranda, J., Sauré, D., Souyris, S., Weintraub, A., et al. (2007). Scheduling the Chilean soccer league by integer programming. Interfaces, 7(6), 539–552.

    Article  Google Scholar 

  • Eley, M. (2006). Some experiments with ant colony algorithms for the exam timetabling. Lecture Notes in Computer Science, 4150, 492–499.

    Article  Google Scholar 

  • Gendreau, M., Ferland, J., Gendron, B., Hail, N., Jaumard, B., Lapierre, S., et al. (2007). Physician scheduling in emergency rooms. Lecture Notes in Computer Science, 3867, 53–66.

    Article  Google Scholar 

  • Gogos, G., Alefragis, P., & Housos, E. (2012). An improved multi-staged algorithmic process for the solution of the examination timetabling problem. Annals of Operations Research, 194, 203–221.

    Article  Google Scholar 

  • Goossens, D., & Spieksma, F. (2012). Soccer schedules in Europe: An overview. Journal of Scheduling, 15, 641–651.

    Article  Google Scholar 

  • Gupta, D., & Denton, B. (2008). Appointment scheduling in health care: Challenges and opportunities. IIE Transactions, 40(9), 800–819.

    Article  Google Scholar 

  • Jat, S., & Yang, S. (2011). A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling. Journal of Scheduling, 14, 617–637.

    Article  Google Scholar 

  • Joshua, J., & Tajudin, A. (2006). Visualizing the examination timetabling data using clustering method and TreeMaps. In Proceedings of the 2nd IMT-GT regional conference on mathematics, statistics and applications.

  • Joshua, J., Tajudin, A., Bahari, B., & Leow, A. (2010). Exploration of rough sets analysis in real-world examination. Lectures Notes in Computer Science, 6729, 173–182.

    Google Scholar 

  • Kahar, M., & Kendall, G. (2010). The examination timetabling problem at Universiti Malaysia Pahang: Comparison of a constructive heuristic with an existing software solution. European Journal of Operational Research, 207, 557–565.

    Article  Google Scholar 

  • Lach, G., & Lübbecke, M. (2012). Curriculum based course timetabling: New solutions to Udine benchmark instances. Annals of Operations Research, 194, 255–272.

    Article  Google Scholar 

  • Le Huédé, F., Grabisch, M., Labreuche, C., & Savéant, P. (2006). MCS—A new algorithm for multicriteria optimisation in constraint programming. Annals of Operations Research, 147, 143–174.

    Article  Google Scholar 

  • Lewis, R., Paechter, B., & McCollum, B. (2007). Post enrolment based course timetabling: A description of the problem model used for track two of the second international timetabling competition. Cardiff Accounting and Finance Working Papers A2007/3, Cardiff University, Cardiff Business School, Accounting and Finance Section.

  • Lezaun, M., Pérez, G., & Sáinz de la Maza, E. (2007). Rostering in a rail passenger carrier. Journal of Scheduling, 10, 245–254.

    Article  Google Scholar 

  • Lü, Z., & Hao, J. (2010). Adaptive tabu search for course timetabling. European Journal of Operational Research, 200, 235–244.

    Article  Google Scholar 

  • Lü, Z., Hao, J., & Glover, F. (2011). Neighborhood analysis: A case study on curriculum-based course timetabling. Journal of Heuristics, 17, 97–118.

    Article  Google Scholar 

  • Maenhout, B., & Vanhoucke, M. (2010). Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem. Journal of Scheduling, 13, 77–93.

    Article  Google Scholar 

  • Mansour, N., Isahakian, V., & Ghalayini, I. (2011). Scatter search technique for exam timetabling. Applied Intelligence, 34, 299–310.

    Article  Google Scholar 

  • McCollum, B., McMullan, P., Burke, E., Parkes, A., & Qu, R. (2008). The second international timetabling competition: Examination timetabling track. N Ireland: Technical Report Queen’s Belfast University.

  • McCollum, B. (2007). A perspective on bridging the gap between research and practice in university timetabling. Lecture Notes in Computer Science, 3867, 3–23.

    Article  Google Scholar 

  • McCollum, B., McMullan, P., Parkes, A., Burke, E., & Qu, R. (2012). A new model for automated examination timetabling. Annals of Operations Research, 194, 291–315.

    Article  Google Scholar 

  • Medard, C., & Sawhney, N. (2007). Airline crew scheduling from planning to operations. European Journal of Operational Research, 183, 1013–1027.

    Article  Google Scholar 

  • Merlot, L., Boland, N., Hughes, B., & Stuckey, P. (2003). A hybrid algorithm for the examination timetabling problem. In E. K. Burke & P. De Causmaecker (Eds.) Lecture notes in computer science: Vol 2740 Practice and theory of automated timetabling IV: selected papers from the 4th international conference (pp. 207–231). Berlin: Springer.

  • Miranda, J., Rey, P., & Robles, J. (2012). UdpSkeduler: A web architecture based decision support system for course and classroom scheduling. Decision Support Systems, 52, 505–513.

    Article  Google Scholar 

  • MirHassani, S. (2006). Improving paper spread in examination timetables using integer programming. Applied Mathematics and Computation, 179, 702–706.

    Article  Google Scholar 

  • MirHassani, S., & Habibi, F. (2013). Solution approaches to the course timetabling problem. Artificial Intelligence Review, 39(2), 133–149.

    Article  Google Scholar 

  • Munford, C. (2010). A multiobjective framework for heavily constrained examination timetabling problems. Annals of Operations Research, 180(1), 3–31.

    Article  Google Scholar 

  • Pais, T., & Maral, P. (2012). Managing the tabu list length using a fuzzy inference system: An application to examination timetabling. Annals of Operations Research, 194, 341–363.

    Article  Google Scholar 

  • Patrick, J., Puterman, M., & Queyranne, M. (2008). Dynamic multipriority patient scheduling for a diagnostic resource. Operations Research, 56(6), 1507–1525.

    Article  Google Scholar 

  • Petrovic, S., Yang, Y., & Dror, M. (2007). Case-based selection of initialisation heuristics for metaheuristic examination timetabling. European Journal of Operational Research, 33, 772–785.

    Google Scholar 

  • 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, 197, 482–491.

    Article  Google Scholar 

  • Pillay, N., & Banzhaf, W. (2010). An informed genetic algorithm for the examination timetabling problem. Applied Soft Computing, 10, 457–467.

    Article  Google Scholar 

  • Qu, R., Burke, E., & McCollum, B. (2009a). Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems. European Journal of Operational Research, 198, 392–404.

    Article  Google Scholar 

  • Qu, R., Burke, E., McCollum, B., Merlot, L., & Lee, S. (2009b). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12(1), 55–89.

    Article  Google Scholar 

  • Respicio, A., & Captivo, M. (2005). Metaheuristics: Progress as real problem solvers. Operations Research/Computer Science Interfaces Series, Springer, chap Bi-Objective Sequencing of Cutting Patterns (Vol. 32, pp. 227–241).

  • Rudová, H., Müller, T., & Murray, K. (2011). Complex university course timetabling. Journal of Scheduling, 14, 187–207.

    Article  Google Scholar 

  • Sabar, N., Ayov, M., Qu, R., & Kendall, G. (2012b). A graph coloring constructive hyper-heuristic for examination timetabling problems. Applied Intelligence, 37, 1–11.

    Article  Google Scholar 

  • Sabar, N., Kendall, Ayov G. M., & Qu, R. (2012a). A honey-bee mating optimization algorithm for educational timetabling problems. European Journal of Operational Research, 216, 533–543.

    Article  Google Scholar 

  • Sagir, M., & Kamisli, Z. (2010). Exam scheduling: Mathematical modeling and parameter estimation with the analytic network process approach. Mathematical and Computer Modelling, 52, 930–941.

    Article  Google Scholar 

  • Sarin, S., Wang, Y., & Varadarajan, A. (2010). A university timetabling problem and its solution using Benders’ partitioning—A case study. Journal of Scheduling, 13, 131–141.

    Article  Google Scholar 

  • Sauré, A., Patrick, J., Tyldesley, S., & Puterman, M. (2012). Dynamic multi-appointment patient scheduling for radiation therapy. European Journal of Operational Research, 223(2), 573–584.

    Article  Google Scholar 

  • Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87–127.

    Article  Google Scholar 

  • Schöbel, A. (2012). Line planning in public transportation: Models and methods. OR Spectrum, 34, 491–510.

    Article  Google Scholar 

  • Suliman, S. (2006). Pattern generating procedure for the cutting stock problem. International Journal of Production Economics, 74, 293–301.

    Article  Google Scholar 

  • Thomas, J., & Tajudin, A. (2006). Visualizing the examination timetabling data using clustering method and TreeMaps. In Proceedings of the 2nd IMT-GT regional conference on mathematics, statistics and applications.

  • Thomas, J., Tajudin, A., & Belaton, B. (2010). Information visualizing approach on the university examination timetabling problem. Visual Information Communication, 255–264.

  • Thompson, J., & Dowsland, K. (1996). Variants of simulated annealing for the examination timetabling problem. Annals of Operations Research, 63, 105–128.

    Article  Google Scholar 

  • Thompson, J., & Dowsland, K. (1998). A robust simulated annealing based examination timetabling system. Computers and Operations Research, 25, 637–648.

    Article  Google Scholar 

  • Turabieh, H., & Addullah, S. (2011). An integrated hybrid approach to the examination timetabling problem. Omega, 39, 598–607.

    Article  Google Scholar 

  • Van den Broek, J., Hurkens, C., & Woeginger, G. (2009). Timetabling problems at the TU Eindhoven. European Journal of Operational Research, 196, 877–885.

    Article  Google Scholar 

  • Wang, S., Bussieck, M., Guignard, M., Meeraus, A., & O’Brien, F. (2009). Term-end exam scheduling at United States military academy/west point. Journal of Scheduling, 13, 375–391.

    Article  Google Scholar 

  • Wren, A. (1996). Scheduling, timetabling and rostering—A special relationship. In E. Burke, P. Ross (Eds), Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science (Vol. 1153, pp. 46–75).

Download references

Acknowledgments

This research was partially supported by a postgraduate fellowship from the “Comisión Nacional de Investigación Científica y Tecnológica (CONICYT)”, Chile and the Institute Complex Engineering Systems (Grants CONICYT: FB016 and ICM: P05-004F). The authors would like to thank Claudio Gutiérrez, Camila Ramos, Catalina Parga, José Tomás Marquínez, Daniel Herl and Daniel Zúñiga for their assistance during the course of this research project.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alejandro Cataldo.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cataldo, A., Ferrer, JC., Miranda, J. et al. An integer programming approach to curriculum-based examination timetabling. Ann Oper Res 258, 369–393 (2017). https://doi.org/10.1007/s10479-016-2321-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-016-2321-2

Keywords

Navigation