Solving the Examination Timetabling Problem Using a Two-Phase Heuristic
| dc.creator | Mujun, Egbert | |
| dc.creator | Mushi, Allen | |
| dc.date | 2016-01-22T11:49:26Z | |
| dc.date | 2016-01-22T11:49:26Z | |
| dc.date | 2015-06-07 | |
| dc.date.accessioned | 2021-05-03T13:36:18Z | |
| dc.date.available | 2021-05-03T13:36:18Z | |
| dc.description | 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. | |
| dc.identifier | 1746-7659 | |
| dc.identifier | http://hdl.handle.net/123456789/174 | |
| dc.identifier.uri | http://hdl.handle.net/123456789/47618 | |
| dc.language | en | |
| dc.publisher | World Academic Press, World Academic Union | |
| dc.relation | Vol. 10;3 | |
| dc.subject | Heuristics | |
| dc.subject | Timetabling | |
| dc.subject | Optimization | |
| dc.subject | Graph Colouring | |
| dc.subject | Simulated Annealing | |
| dc.title | Solving the Examination Timetabling Problem Using a Two-Phase Heuristic | |
| dc.title | The case of Sokoine University of Agriculture | |
| dc.type | Journal Article, Peer Reviewed |