A new time-dependent algorithm for post enrolment-based course timetabling problem

Abstract

In this paper, we propose a new time-dependent heu-ristic algorithm for post enrolment-based course timetabling prob-lem. The algorithm operates in two stages: a constructive phase is proposed to insert events into the timetable whilst obeying most hard constraints, and a hill-climbing phase is designed to ensure the timetable meeting all the hard constraints. Each stage is allocated a time limit. The experimental results on instances from the second international timetabling competition show that our algorithm is efficient and competitive with other effective algorithms.