OCSH: optimized cluster specific heuristics for the university course timetabling problem

Abstract

The University Course Timetabling Problem (UCTP) is a search problem that allocates a given number of rooms with given courses based on their scheduled time slots. UCTP belongs to the NP-complete class and can be defined as a constraint satisfaction problem (CSP). To solve the performance issue of CSP solvers, there are various local search methods. CSP… (More)
DOI: 10.1145/3200842.3200858

11 Figures and Tables