A Study on the Optimality of the University Course Timetabling Problem

Abstract

The university course timetabling problem is an NP-complete problem that deals with many factors such as lessons, classes, teachers, students, space and timeslots. It is an optimized problem requiring the allocation of resources so as to satisfy a specified set of constraints. The optimality was able to find feasible solutions in all instances of the dataset and close to optimal solutions in some instances. This study may be used as a benchmark for optimality that solve the curriculum based university course timetabling problem.