Master thesis defense timetabling problem arises in most of Vietnamese universities where we have to schedule professors, rooms, slots to different juries of students satisfying a given set of constraints while maximizing the match between expertise of professors and the thesis of the corresponding student. We implement a Constraint-Based Local Search algorithm for solving this problem. 

The source code and some real data tests are available here: Download




Category: Resource