Author:

Abstract:

In this abstract we describe the university timetabling problem as it is perceived and solved at the KaHo Sint-Lieven School of Engineering. Timetabling is carried out manually by dragging and dropping events in a room-timeslot matrix, but potential conflicts are automatically spotted by the conflict module built into the application. We are now in the process of automatizing the construction of timetables itself. In the next sections we describe the specific timetabling problem at KaHo Sint-Lieven and the steps we follow to tackle it. The approach is based on a tabu search algorithm. Inspired by Kingston [13], we group sessions in order to make the timetabling problem less complex.