Abeer Bashab1, Ashraf Osman Ibrahim2,*, Ibrahim Abakar Tarigo Hashem3, Karan Aggarwal4, Fadhil Mukhlif5, Fuad A. Ghaleb5, Abdelzahir Abdelmaboud6
CMC-Computers, Materials & Continua, Vol.74, No.3, pp. 6461-6484, 2023, DOI:10.32604/cmc.2023.034051
- 28 December 2022
Abstract University timetabling problems are a yearly challenging task and are faced repeatedly each semester. The problems are considered non-polynomial time (NP) and combinatorial optimization problems (COP), which means that they can be solved through optimization algorithms to produce the aspired optimal timetable. Several techniques have been used to solve university timetabling problems, and most of them use optimization techniques. This paper provides a comprehensive review of the most recent studies dealing with concepts, methodologies, optimization, benchmarks, and open issues of university timetabling problems. The comprehensive review starts by presenting the essence of university timetabling as… More >
Login
Register
