A practical fix-and-optimize algorithm for university timetabling

The International Timetabling Competition 2019 brought a generalized formulation for the University Timetabling Problem, including student sectioning. The formulation provided allowed for differences in the problem features across the universities. The competition rules did not include any computational restrictions on the used algorithms. Thus the winning algorithm used an extensive parallelized framework with a large time limit. This report shows that the ideas of the winning algorithm can be used in a smaller setup and still be comparable in a shorter and more practical time frame.