A Review of Metaheuristic Techniques for Solving University Course Timetabling Problem

Educational timetable generation is one of the major administrative requirements in schools and universities. University course timetabling problem falls in the category of NP-hard problems having various constraints, objectives, and limited resources. Generating an optimized timetable is challenging and time-consuming process. The objective here is to present a concise review of some recent techniques that researchers have tried to resolve university course timetabling problem having single/multiple objectives.