Some Balanced Colouring Algorithms For Examination Timetabling

Abstract

This paper describes some balanced colouring algorithms designed to construct examination schedules in such a way that :(1) all examination take place within a minimum number of days; (2) students are never scheduled to take two examinations at the same time; (3) the number of courses are scheduled into each period are approximately equal. These algorithms were tested on a large range of random graphs. Keywords: Balanced colouring,scheduling, random graphs,graph colouring