In this scientific work, we present the possibility of solving one of the major NP-complete problems, the “Timetable Problem”, which is currently being given more emphasis in the university environment, by exploring the various possibilities of automatic solution with the least time complexity.