Vol. 4, Issue 4, Part A (2018)

Abstract
Scheduling of timetable is one of the important tasks come across in real life circumstances. Timetable problem is a NP-hard problem where different constraints and various resources are applied but the resources are limited. In this paper, Graph Colouring Algorithm is used to generate the weekly time table of the student for the college. We describe the software of the Graph Colouring Algorithm to a highly constrained real–world occurrence of the College course timetabling problem. By using this software we get an effective preparation of courses and events where complex combinations of resources must be assigned efficiently to timetables. It test all the constraints applied and also check all the clashes and eliminate it.