Curriculum based course timetabling

Scheduling courses into predefined periods and rooms over a week with a given set of constraints is an NP-complete problem. This work considers proposing three-phase heuristic algorithms that fulfils the requirements of zero hard constraints values and minimal values for soft constraints. We have run our algorithms on subject problems listed at the international timetabling competition in 2007 (ITC2007) and we have compared our results with those obtained in ITC2007. Our results show that our approach produces better results for the larger or more complex problems.