constraint satisfaction problem

This paper formulates the college timetable scheduling (CTTS) as a constraint satisfaction problem (CSP) in a manner that is easy to implement. Timetable scheduling is a process that is revised in every academic session and requires a lot of constraint checking, so it is inefficient to check the same type of constraints repeatedly to create a proper schedule manually.