Pongcharoen, P.; Promtet, W.; Yenradee, P.; Hicks, C. - In: International Journal of Production Economics 112 (2008) 2, pp. 903-918
University timetabling is an NP-hard problem, which means that the amount of computation required to find solutions increases exponentially with problem size. Timetabling is subject to hard constraints that must be satisfied in order to produce feasible timetables and soft constraints, which are...