Mathijs ter Braak — Analysis and improvement of the High School Timetabling Problem scheduling process using a general XHSTT format
|Time:||Wednesday, March 28, 2012|
|Location:||Room 101, Citadel|
The High School Timetabling (HSTT) Problem is amongst the most widely used timetabling problems. This problem has varying structures in different high schools even within the same country or educational system. The HSTT Problem in several countries has been studied in order to find a common set of constraints and objectives. An XML-HSTT (XHSTT) format has been designed in order to better model the complete problem and facilitate data exchange between high school timetabling researchers. A program has been written that can load several high school instances from different countries and hopefully any high school instance. Several algorithms have been constructed in an attempt to create high quality schedules within a certain amount of time. An algorithm of algorithms has been written that tries to find the best combinations of algorithms and parameters.