Timetable scheduling is a complex and challenging problem, especially in educational institutions where multiple constraints must be balanced

Generates two clash-free class schedules using a genetic algorithm with random selection, crossover, and mutation. Designed for 3 teachers over 3 days and 3 periods.

Timetable scheduling with Greedy Algorithm, Local Search, Genetic Algorithm