TY - JOUR
T1 - Solving the Examination Timetabling Problem Using a Two-Phase Heuristic: The case of Sokoine University of Agriculture
AU - Egbert Mujuni and Allen Mushi
JO - Journal of Information and Computing Science
VL - 3
SP - 220
EP - 227
PY - 2024
DA - 2024/01
SN - 10
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22547.html
KW - Heuristics, Timetabling, Optimization, Graph Colouring, Simulated Annealing 

AB -  Examination  timetabling  is  an  important  operational  problem  in  any  academic  institution.  The 
problem  involves  assigning  examinations  and  candidates  to  time  periods  and  examination  rooms  while 
satisfying a set of specific constraints. An increased number of student enrolments, a wider variety of courses, 
and  the  growing  flexibility  of  students’  curricula  have  contributed  to  the  growing  challenge  in  preparing 
examination timetables. Since examination timetabling problems differ from one institution to another, in this 
paper  we  develop  and  investigate  the  impact  of  a  two-phase  heuristic  that  combines  Graph-Colouring  and 
Simulated  Annealing  at  Sokoine  University  of  Agriculture  (SUA)  in  Tanzania.  Computational  results  are 
presented which shows great improvement over the previous work on the same problem.