Abstract

Graph coloring is an important aspect of graph theory with great application in University timetable scheduling. The examination timetable scheduling maximizes the time and minimizes resources (venue and invigilators) to give effective output of the event. The constraint based approach method is implemented in scheduling examination timetable for Faculty of Science, Federal University Lokoja. Then the results on thirteen (13) departments give a 3-timeslot within twelve (12) days examination period with no students having two (2) examinations per day. In all, there is no conflict of venues and courses thereby giving an efficient scheduling process for the entire examination.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.