Abstract
University timetabling problems are concerned with the assignment of events and tasks that occur frequently in universities, like exams, courses, projects, and faculty load. These problems are difficult and consume a lot of time and effort if done manually. Automating such tasks will save time and cost, and increase the satisfaction of the stakeholders. Since university timetabling problems are mostly NP-hard, heuristics and metaheuristics are often used for solving them. In this survey, we review different university timetabling problems, such as: Examination Timetabling, Course Timetabling, and Staff Timetabling. We also propose a new problem, which is Project Timetabling. In addition, we discuss some case studies that successfully tackled these problems using metaheuristic algorithms. However, due to the huge number of papers published worldwide in this research area, we focus in this survey on papers published in the Middle Eastern region. The findings of this survey indicate that there are many challenges that are still open for further investigation. Focusing on the convenience of the stakeholders and adopting hybrid search methods are among the promising research directions in this field. Project timetabling which has been introduced in this survey is also another promising area that is open for further investigation by the interested researchers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lewis, R., Paechter, B.: Finding feasible timetables using group-based operators. IEEE Trans. Evol. Comput. 11, 397–413 (2007)
Hosny, M., Fatima, S.: A survey of genetic algorithms for the university timetabling problem. In: International Proceedings of Computer Science and Information Technology, pp. 34–39 (2011)
Dammak, A., Elloumi, A., Kamoun, H., Ferland, J.A.: Course timetabling at a Tunisian university: a case study. J. Syst. Sci. Syst. Eng. 17, 334–352 (2008)
Hosny, M., Al-Olayan, M.: A mutation-based genetic algorithm for room and proctor assignment in examination scheduling. In: Proceedings of 2014 Science and Information Conference, SAI 2014 (2014)
Mansour, N., Sleiman-Haidar, G.: Parallel scatter search algorithms for exam timetabling. Int. J. Appl. Metaheuristic Comput. 2, 27–44 (2011)
Hosny, M.I.: A heuristic algorithm for solving the faculty assignment problem. J. Commun. Comput. 10, 287–294 (2013)
Al-negheimish, S., Alnuhait, F., Albrahim, H., Al-mogherah, S., Alrajhi, M., Hosny, M.: An intelligent bio-inspired algorithm for the faculty scheduling problem. Int. J. Adv. Comput. Sci. Appl. 9, 151–159 (2018)
Cowling, P., Kendall, G., Soubeiga, E.: Hyperheuristics: a tool for rapid prototyping in scheduling and optimisation. Appl. Evol. Comput. 2279, 269–287 (2002)
Weitz, R.R., Jelassi, M.T.: Assigning students to groups: a multi-criteria decision support system approach. Decis. Sci. 23, 746–757 (1992)
Marie-Sainte, S.L.: A new hybrid particle swarm optimization algorithm for real-world university examination timetabling problem. In: 2017 Computing Conference, pp. 157–163 (2017)
Chmait, N., Challita, K.: Using simulated annealing and ant-colony optimization algorithms to solve the scheduling problem. Comput. Sci. Inf. Technol. 1, 208–224 (2013)
Alhuwaishel, N., Hosny, M.: A Hybrid Bees/Demon Optimization Algorithm for Solving the University Course Timetabling Problem, pp. 371–378 (2015)
Shaker, K., Abdullah, S., Alqudsi, A., Jalab, H.: Hybridizing meta-heuristics approaches for solving university course timetabling problems. Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), LNAI, vol. 8171, pp. 374–384 (2013)
Al-qubati, W., Zahary, A., Al-hegami, A.: Using nested tables and mutation in genetic algorithms (NTMGA) to solve timetabling problem in object- relational model, pp. 215–221 (2012)
Alsmadi, O.M.K., Abo-Hammour, Z.S., Abu-Al-Nadi, D.I., Algsoon, A.: A novel genetic algorithm technique for solving university course timetabling problems. In: IEEE International Workshop on Systems, Signal Processing and their Applications, WOSSPA, pp. 195–198 (2011)
Bolaji, A.L., Khader, A.T., Al-betar, M.A., Awadallah, M.A.: An improved artificial bee colony for course timetabling. In: 2011 Sixth International Conference on Bio-Inspired Computing Theories and Applications, pp. 9–14 (2011)
Acknowledgment
The author would like to extend thanks to Mrs. Shameem Fatima for her great efforts in collecting and categorizing the references presented in this survey.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Hosny, M. (2019). Metaheuristic Approaches for Solving University Timetabling Problems: A Review and Case Studies from Middle Eastern Universities. In: Rocha, Á., Serrhini, M. (eds) Information Systems and Technologies to Support Learning. EMENA-ISTL 2018. Smart Innovation, Systems and Technologies, vol 111. Springer, Cham. https://doi.org/10.1007/978-3-030-03577-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-03577-8_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03576-1
Online ISBN: 978-3-030-03577-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)