Conference Proceedings

Constraint programming for high school timetabling: A scheduling-based model with hot starts

E Demirović, PJ Stuckey, Willem-Jan van Hoeve

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Springer | Published : 2018


© Springer International Publishing AG, part of Springer Nature 2018. High School Timetabling (HSTT) is a well-known and wide-spread problem. It consists of coordinating resources (e.g. teachers, rooms), times, and events (e.g. classes) with respect to a variety of constraints. In this paper, we study the applicability of constraint programming (CP) for high school timetabling. We formulate a novel CP model for HSTT using a scheduling-based point of view. We show that a drastic improvement in performance over the baseline CP model can be achieved by including solution-based phase saving, which directs the CP solver to first search in close proximity to the best solution found, and our hot st..

View full abstract

Citation metrics