1. Achá, R.A., Nieuwenhuis, R.: Curriculum-based course timetabling with SAT and MaxSAT. Ann. Oper. Res. 1–21 (2012). doi:
10.1007/s10479-012-1081-x
2. Achá, R.A., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: Cardinality networks and their applications. In: Kullmann, O. (ed.) 12th International Conference on Theory and Applications of Satisfiability Testing, SAT’09. Lecture Notes in Computer Science, vol. 5584, pp. 167–180. Springer, Berlin (2009)
3. Arntzen, H., Løkketangen, A.: A tabu search heuristic for a university timetabling problem. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers. Operations Research/Computer Science Interfaces Series, vol. 32, pp. 65–85. Springer, New York (2005). doi:
10.1007/0-387-25383-1_3
4. Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Technical Report, CSM-192, Computing Science and Mathematics, University of Stirling (2012)
5. Baker, B.S., Coffman, Jr., E.G.: Mutual exclusion scheduling. Theor. Comput. Sci. 162(2), 225–243 (1996). doi:
10.1016/0304-3975(96)00031-X