Designing timetables is very important everywhere. Making timetables for every section is very difficult to do by a person. So, in this application, we need to create a timetable that can automatically generate schedules based on the available time slots of faculty members and the subjects they are teaching. This paper aims to make the process of creating a timetable much better, quick, and absence of overlapping. Through the utilization of problem-solving techniques that consider constraints, along with the implementation of genetic algorithms tailored to meet specific requirements and limitations. The main purpose of using a genetic algorithm (GA) and constraint satisfaction problem (CSP) is to identify the strengths of each method and mitigate their respective weaknesses, leading to more effective and efficient timetable generation.