Solving the School Timetabling Problems using Local Search - A Literature Review

This paper presents a systematic literature review on the application of local search algorithms to address the school timetabling problem. Efficiently scheduling timetables is a complex challenge due to the numerous constraints and objectives involved. Classified as NP-Hard, this problem is often tackled using heuristic techniques, with local search being particularly prominent. The review encompasses studies published between 2014 and 2024, examining various approaches and methodologies. It also analyzes the datasets used, including public benchmarks such as those from the International Timetabling Competition (ITC) and proprietary datasets. The review underscores the importance of standardized benchmarks for ensuring the reproducibility and comparability of research, as well as the challenges posed by differing problem constraints. The findings highlight the wide range of approaches and the necessity for adaptive solutions to meet the specific needs of each context.