caa a22 4500 44583885X CHVBK 20180317145338.0 cr unu---uuuuu 170323e20110401xx s 000 0 eng 10.1007/s10951-010-0171-3 doi (NATIONALLICENCE)springer-10.1007/s10951-010-0171-3 Complex university course timetabling [Elektronische Daten] [Hana Rudová, Tomáš Müller, Keith Murray] This paper summarizes the work done to solve a complex course timetabling problem at a large university and provides new insights into the overall timetabling process. The first step in the successful solution of this problem was to define a course structure model that allowed application of classical course timetabling methods. Several methods were necessary to solve the complete problem. First, support procedures were needed to detect and correct an infeasible problem where hard constraints were being violated. The resulting timetabling problem was then solved via a search for a complete assignment of times and rooms to classes, taking all hard and soft constraints into account. Methods were also developed for modifying a computed solution in response to changes introduced at a later time while having aminimal impact on existing assignments. These problems are described formally using aweighted constraint satisfaction model of the timetabling problem and solutions are proposed through two types of the algorithms:(1)generic iterative forward search with conflict-based statistics, and (2)branch and bound. Experimental results from the course timetabling system developed for Purdue University are provided. These include solutions computed by university schedulers using the system for two separate terms along with extensive experiments solving two central and six departmental problems, individually, and as acombined problem with almost 2,500 classes. The system described is currently used on all of the many varied course timetabling problems encountered each term at Purdue University. Springer Science+Business Media, LLC, 2010 University course timetabling nationallicence Search nationallicence Constraint satisfaction nationallicence Soft constraints nationallicence Dynamic problems nationallicence Heuristic nationallicence Rudová Hana Faculty of Informatics, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic aut Müller Tomáš Space Management and Academic Scheduling, Purdue University, 400 Centennial Mall Drive, 47907-2016, West Lafayette, IN, USA aut Murray Keith Space Management and Academic Scheduling, Purdue University, 400 Centennial Mall Drive, 47907-2016, West Lafayette, IN, USA aut Journal of Scheduling Springer US; http://www.springer-ny.com 14/2(2011-04-01), 187-207 1094-6136 14:2<187 2011 14 10951 https://doi.org/10.1007/s10951-010-0171-3 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10951-010-0171-3 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Rudová Hana Faculty of Informatics, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic aut NATIONALLICENCE 700 1- Müller Tomáš Space Management and Academic Scheduling, Purdue University, 400 Centennial Mall Drive, 47907-2016, West Lafayette, IN, USA aut NATIONALLICENCE 700 1- Murray Keith Space Management and Academic Scheduling, Purdue University, 400 Centennial Mall Drive, 47907-2016, West Lafayette, IN, USA aut NATIONALLICENCE 773 0- Journal of Scheduling Springer US; http://www.springer-ny.com 14/2(2011-04-01), 187-207 1094-6136 14:2<187 2011 14 10951 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer