Comparison of algorithms forautomated university scheduling

Schedule generation is a common real-world problem, that has been shown to behard to solve. In a scheduling algorithm, various constraints related to scheduling are the inputs and a schedule satisfying these constraints is the output. In this report, two algorithms for schedule generation are compared: Tabu Searchand a Genetic Algorithm. How well the algorithms perform for generating schedules from constraint input of dierent sizes is assessed, as well as how the performance of the algorithms is aected by varying parameters of the algorithm.The major conclusion drawn is that there is no major dierence between how well Tabu Search and the Genetic Algorithm scale when faced with a larger input size