Development of examinations scheduling algorithm using graph colouring
| dc.contributor.author | Selemani,Mohamed Abdallah | |
| dc.date.accessioned | 2025-08-28T13:12:55Z | |
| dc.date.available | 2025-08-28T13:12:55Z | |
| dc.date.issued | 2012 | |
| dc.description | Masters Dissertation | |
| dc.description.abstract | Examination Timetabling Problem (ETP) is a real life problem encountered in academic institutions and attracted the attention of reseach communities since In this study, a Recursive Largest First (RLF) algorithm for graph colouring is used to solve the ETP at SUA. We discuss in detail the step-by-step process that is taken to implement our timetabling-by-graph-coloring procedure, from the 1960’s. This study intends to develop a graph based algorithm for ETP at Sokoine University of Agriculture (SUA). the assembled data, to colouring the conflict graph, to transforming this colouring to a conflict-free timetable, to finally assigning exams to classrooms. Our algorithm is very flexible, since it. allows the user to define the basic problem data which are courses to examined, courses’ enrolment, rooms and their to run twice a year for the construction of the examination timetable of a specific educational organization. Some improvements on it. such as applying metaheuris- Using the two semester data sets from the case study, computational experiments are conducted based on the developed algorithm and obtained the promising results. Sample Computational results, using actual data provided by students’ | |
| dc.identifier.uri | https://www.suaire.sua.ac.tz/handle/123456789/6947 | |
| dc.language.iso | en | |
| dc.publisher | Sokoine University Agriculture | |
| dc.subject | Examinations | |
| dc.subject | Timetabling | |
| dc.subject | Academic institutions | |
| dc.title | Development of examinations scheduling algorithm using graph colouring | |
| dc.type | Thesis |