{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:10:17Z","timestamp":1776939017335,"version":"3.51.4"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10951-010-0171-3","type":"journal-article","created":{"date-parts":[[2010,4,30]],"date-time":"2010-04-30T13:46:36Z","timestamp":1272635196000},"page":"187-207","source":"Crossref","is-referenced-by-count":39,"title":["Complex university course timetabling"],"prefix":"10.1007","volume":"14","author":[{"given":"Hana","family":"Rudov\u00e1","sequence":"first","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"M\u00fcller","sequence":"additional","affiliation":[]},{"given":"Keith","family":"Murray","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,1]]},"reference":[{"issue":"4","key":"171_CR1","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1080\/088395100117016","volume":"14","author":"S. Abdennadher","year":"2000","unstructured":"Abdennadher, S., & Marte, M. (2000). University course timetabling using constraint handling rules. Journal of Applied Artificial Intelligence, 14(4), 311\u2013326.","journal-title":"Journal of Applied Artificial Intelligence"},{"issue":"1","key":"171_CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0305-0548(89)90053-1","volume":"16","author":"J. Aubin","year":"1989","unstructured":"Aubin, J., & Ferland, J. A. (1989). A large scale timetabling problem. Computers & Operations Research, 16(1), 67\u201377.","journal-title":"Computers & Operations Research"},{"key":"171_CR3","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10951-005-4780-1","volume":"8","author":"P. Avella","year":"2005","unstructured":"Avella, P., & Vasil\u2019ev, I. (2005). A computational study of a cutting plane algorithm for university course timetabling. Journal of Scheduling, 8, 497\u2013514.","journal-title":"Journal of Scheduling"},{"key":"171_CR4","series-title":"LNCS","first-page":"16","volume-title":"Proceedings of the 12th biennial conference of the Canadian society for computational studies of intelligence on advances in artificial intelligence","author":"D. Banks","year":"1998","unstructured":"Banks, D., van Beek, P., & Meisels, A. (1998). A heuristic incremental modeling approach to course timetabling. In LNCS : Vol. 1418. Proceedings of the 12th biennial conference of the Canadian society for computational studies of intelligence on advances in artificial intelligence (pp. 16\u201329). Berlin: Springer."},{"key":"171_CR5","first-page":"600","volume-title":"Proceedings of the fourteenth international joint conference on artificial intelligence","author":"P. Baptiste","year":"1995","unstructured":"Baptiste, P., & Le Pape, C. (1995). A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In C. S. Mellish (Ed.), Proceedings of the fourteenth international joint conference on artificial intelligence (pp. 600\u2013606). San Mateo: Morgan Kaufmann."},{"key":"171_CR6","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-540-24662-6_13","volume-title":"Recent advances in constraints","author":"R. Bart\u00e1k","year":"2004","unstructured":"Bart\u00e1k, R., M\u00fcller, T., & Rudov\u00e1, H. (2004). A new approach to modeling and solving minimal perturbation problems. In LNAI : Vol. 3010. Recent advances in constraints (pp. 233\u2013249). Berlin: Springer."},{"key":"171_CR7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S1574-6526(06)80007-6","volume-title":"Handbook of constraint programming","author":"C. Bessiere","year":"2006","unstructured":"Bessiere, C. (2006). Constraint propagation. In F. Rossi et al. (Eds.), Handbook of constraint programming (pp. 29\u201383). Amsterdam: Elsevier."},{"key":"171_CR8","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/978-3-540-77345-0_15","volume-title":"Practice and theory of automated timetabling VI","author":"C. Beyrouthy","year":"2007","unstructured":"Beyrouthy, C., Burke, E. K., McCollum, B., Landa-Silva, D., McMullan, P., & Parkes, A. J. (2007). The teaching space allocation problem with splitting. In E.\u00a0Burke & H.\u00a0Rudov\u00e1 (Eds.), LNCS : Vol. 3867. Practice and theory of automated timetabling VI (pp. 228\u2013247). Berlin: Springer."},{"key":"171_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1057\/palgrave.jors.2602523","volume":"60","author":"C. Beyrouthy","year":"2009","unstructured":"Beyrouthy, C., Burke, E. K., Landa-Silva, D., McCollum, B., McMullan, P., & Parkes,\u00a0A. J. (2009). Towards improving the utilisation of university teaching space. Journal of the Operational Research Society, 60, 130\u2013143.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"171_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/256303.256306","volume":"44","author":"S. Bistarelli","year":"1997","unstructured":"Bistarelli, S., Montanari, U., & Rossi, F. (1997). Semiring-based constraint solving and optimization. Journal of the ACM, 44(2), 201\u2013236.","journal-title":"Journal of the ACM"},{"key":"171_CR11","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/S1574-6526(06)80025-8","volume-title":"Handbook of constraint programming","author":"K. N. Brown","year":"2006","unstructured":"Brown, K. N., & Miguel, I. (2006). Uncertainty and change. In F. Rossi et al. (Eds.), Handbook of constraint programming (pp. 731\u2013760). Amsterdam: Elsevier."},{"key":"171_CR12","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-44629-X_17","volume-title":"Practice and theory of automated timetabling III","author":"P. Brucker","year":"2001","unstructured":"Brucker, P., & Knust, S. (2001). Resource-constrained project scheduling and timetabling. In E. Burke & W. Erben (Eds.), LNCS : Vol. 2079. Practice and theory of automated timetabling III (pp. 277\u2013293). Berlin: Springer."},{"key":"171_CR13","series-title":"LNCS","volume-title":"Practice and theory of automated timetabling II","year":"1998","unstructured":"Burke, E., & Carter M. (Eds.) (1998). LNCS : Vol. 1408. Practice and theory of automated timetabling II. Berlin: Springer."},{"key":"171_CR14","series-title":"LNCS","volume-title":"Practice and theory of automated timetabling IV","year":"2003","unstructured":"Burke, E., & De Causmaecker, P. (Eds.) (2003). LNCS : Vol. 2740. Practice and theory of automated timetabling IV. Berlin: Springer."},{"key":"171_CR15","series-title":"LNCS","volume-title":"Practice and theory of automated timetabling III","year":"2001","unstructured":"Burke, E., & Erben, W. (Eds.) (2001). LNCS : Vol. 2079. Practice and theory of automated timetabling III. Berlin: Springer."},{"key":"171_CR16","volume-title":"7th international conference on the practice and theory of automated timetabling","year":"2008","unstructured":"Burke, E., & Gendreau, M. (Eds.) (2008). 7th international conference on the practice and theory of automated timetabling. Montr\u00e9al: Universit\u00e9 de Montr\u00e9al."},{"key":"171_CR17","series-title":"LNCS","volume-title":"Practice and theory of automated timetabling","year":"1996","unstructured":"Burke, E., & Ross, P. (Eds.) (1996). LNCS : Vol. 1153. Practice and theory of automated timetabling. Berlin: Springer."},{"key":"171_CR18","series-title":"LNCS","volume-title":"Practice and theory of automated timetabling VI","year":"2007","unstructured":"Burke, E., & Rudov\u00e1, H. (Eds.) (2007). LNCS : Vol. 3867. Practice and theory of automated timetabling VI. Berlin: Springer."},{"key":"171_CR19","series-title":"LNCS","volume-title":"Practice and theory of automated timetabling V","year":"2005","unstructured":"Burke, E., & Trick, M. (Eds.) (2005). LNCS : Vol.\u00a03616. Practice and theory of automated timetabling V. Berlin: Springer."},{"key":"171_CR20","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E. K. Burke","year":"2002","unstructured":"Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140, 266\u2013280.","journal-title":"European Journal of Operational Research"},{"key":"171_CR21","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/11593577_12","volume-title":"Practice and theory of automated timetabling\u00a0V","author":"H. Cambazard","year":"2005","unstructured":"Cambazard, H., Demazeau, F., Jussien, N., & David, P. (2005). Interactively solving school timetabling problems using extensions of constraint programming. In E. Burke & M. Trick (Eds.), LNCS : Vol. 3616. Practice and theory of automated timetabling\u00a0V (pp. 190\u2013207). Montr\u00e9al: Universit\u00e9 de Montr\u00e9al."},{"key":"171_CR22","volume-title":"7th international conference on the practice and theory of automated timetabling","author":"H. Cambazard","year":"2008","unstructured":"Cambazard, H., Hebrard, E., O\u2019Sullivan, B., & Papadopoulos, A. (2008). Local search and constraint programming for the post-enrolment-based course timetabling problem. In E. Burke & M.\u00a0Gendreau (Eds.), 7th international conference on the practice and theory of automated timetabling. Berlin: Springer."},{"key":"171_CR23","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/3-540-44629-X_5","volume-title":"Practice and theory of automated timetabling III","author":"M. W. Carter","year":"2001","unstructured":"Carter, M. W. (2001). A comprehensive course timetabling and student scheduling system at the University of Waterloo. In E. Burke & W. Erben (Eds.), LNCS : Vol. 2079. Practice and theory of automated timetabling III (pp. 64\u201382). Berlin: Springer."},{"key":"171_CR24","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BFb0055878","volume-title":"Practice and theory of automated timetabling II","author":"M. W. Carter","year":"1998","unstructured":"Carter, M. W., & Laporte, G. (1998). Recent developments in practical course timetabling. In E. Burke & M. Carter (Eds.), LNCS : Vol. 1408. Practice and theory of automated timetabling II (pp. 3\u201319). Berlin: Springer."},{"key":"171_CR25","first-page":"363","volume-title":"Proceedings of the 1996 joint international conference and symposium on logic programming","author":"Y. Caseau","year":"1996","unstructured":"Caseau, Y., & Laburthe, F. (1996). Cumulative scheduling with task intervals. In M. Maher (Ed.), Proceedings of the 1996 joint international conference and symposium on logic programming (pp. 363\u2013377). Cambridge: MIT Press."},{"issue":"1","key":"171_CR26","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.ejor.2008.01.043","volume":"195","author":"P. Causmaecker De","year":"2009","unstructured":"De Causmaecker, P., Demeester, P., & Vanden Berghe, G. (2009). A\u00a0decomposed metaheuristic approach for a real-world university timetabling problem. European Journal of Operational Research, 195(1), 307\u2013318.","journal-title":"European Journal of Operational Research"},{"key":"171_CR27","unstructured":"Cheadle, A. M., Harvey, W., Sadler, A. J., Schimpf, J., Shen, K., & Wallace, M. G. (2003). ECL i PS e : A\u00a0tutorial introduction (Technical Report IC-Parc-03-1). IC-Parc, Imperial College London."},{"issue":"6","key":"171_CR28","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10951-006-8495-8","volume":"9","author":"M. Chiarandini","year":"2006","unstructured":"Chiarandini, M., Birattari, M., Socha, K., & Rossi-Doria, O. (2006). An effective hybrid algorithm for university course timetabling. Journal of Scheduling, 9(6), 403\u2013432.","journal-title":"Journal of Scheduling"},{"key":"171_CR29","volume-title":"7th international conference on the practice and theory of automated timetabling","author":"M. Chiarandini","year":"2008","unstructured":"Chiarandini, M., Fawcett, C., & Hoos, H. H. (2008). A modular multiphase heuristic solver for post enrolment course timetabling. In E. Burke & M. Gendreau (Eds.), 7th international conference on the practice and theory of automated timetabling. Montr\u00e9al: Universit\u00e9 de Montr\u00e9al."},{"key":"171_CR30","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.834","volume":"14","author":"R. Debruyne","year":"2001","unstructured":"Debruyne, R., & Bessi\u00e8re, C. (2001). Domain filtering consistencies. Journal of Artificial Intelligence Research, 14, 205\u2013230.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"171_CR31","volume-title":"Constraint processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R. (2003). Constraint processing. San Mateo: Morgan Kaufmann."},{"issue":"2","key":"171_CR32","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0004-3702(02)00120-0","volume":"136","author":"R. Dechter","year":"2002","unstructured":"Dechter, R., & Frost, D. (2002). Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence, 136(2), 147\u2013188.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"171_CR33","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L. Gaspero Di","year":"2006","unstructured":"Di Gaspero, L., & Schaerf, A. (2006). Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms, 5(1), 65\u201389.","journal-title":"Journal of Mathematical Modeling and Algorithms"},{"key":"171_CR34","unstructured":"Di Gaspero, L., McCollum, B., & Schaerf, A. (2007). The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3) (Technical Report QUB\/IEEE\/Tech\/ITC2007\/CurriculumCTT\/v1.0). University, Belfast, United Kingdom."},{"issue":"5","key":"171_CR35","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"4","author":"H. Sakkout El","year":"2000","unstructured":"El Sakkout, H., & Wallace, M. (2000). Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 4(5), 359\u2013388.","journal-title":"Constraints"},{"key":"171_CR36","first-page":"504","volume-title":"Proceedings of the 13th European conference on artificial intelligence (ECAI-98)","author":"H. Sakkout El","year":"1998","unstructured":"El Sakkout, H., Richards, T., & Wallace, M. (1998). Minimal perturbation in dynamic scheduling. In H. Prade (Ed.), Proceedings of the 13th European conference on artificial intelligence (ECAI-98) (pp. 504\u2013508). New York: Wiley."},{"key":"171_CR37","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-540-45157-0_3","volume-title":"Practice and theory of automated timetabling IV","author":"A. Elkhyari","year":"2003","unstructured":"Elkhyari, A., Gu\u00e9ret, C., & Jussien, N. (2003). Solving dynamic timetabling problems as dynamic resource constrained project scheduling problems using new constraint programming tools. In E.\u00a0Burke & P. De\u00a0Causmaecker (Eds.), LNCS : Vol. 2740. Practice and theory of automated timetabling IV (pp. 39\u201359). Berlin: Springer."},{"key":"171_CR38","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","volume":"58","author":"E. C. Freuder","year":"1992","unstructured":"Freuder, E. C., & Wallace, R. J. (1992). Partial constraint satisfaction. Artificial Intelligence, 58, 21\u201370.","journal-title":"Artificial Intelligence"},{"key":"171_CR39","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1613\/jair.1","volume":"1","author":"M. L. Ginsberg","year":"1993","unstructured":"Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 23\u201346.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"171_CR40","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-61794-9_56","volume-title":"Practice and theory of automated timetabling","author":"C. Gu\u00e9ret","year":"1996","unstructured":"Gu\u00e9ret, C., Jussien, N., Boizumault, P., & Prins, C. (1996). Building university timetables using constraint logic programming. In E.\u00a0Burke & P. Ross (Eds.), LNCS : Vol. 1153. Practice and theory of automated timetabling (pp. 130\u2013145). Berlin: Springer."},{"key":"171_CR41","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-61794-9_58","volume-title":"Practice and theory of automated timetabling","author":"M. Henz","year":"1996","unstructured":"Henz, M., & W\u00fcrtz, J. (1996). Using Oz for college timetabling. In E.\u00a0Burke & P. Ross (Eds.), LNCS : Vol. 1153. Practice and theory of automated timetabling (pp. 162\u2013177). Berlin: Springer."},{"issue":"1","key":"171_CR42","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","volume":"54","author":"A. Hertz","year":"1991","unstructured":"Hertz, A. (1991). Tabu search for large scale timetabling problems. European Journal of Operational Research, 54(1), 39\u201347.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"171_CR43","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"N. Jussien","year":"2002","unstructured":"Jussien, N., & Lhomme, O. (2002). Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139(1), 21\u201345.","journal-title":"Artificial Intelligence"},{"key":"171_CR44","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/11593577_7","volume-title":"Practice and theory of automated timetabling V","author":"P. Kostuch","year":"2005","unstructured":"Kostuch, P. (2005). The university course timetabling problem with a 3-phase approach. In E. Burke & M. Trick (Eds.), LNCS : Vol.\u00a03616. Practice and theory of automated timetabling V (pp.\u00a0109\u2013125). Berlin: Springer."},{"key":"171_CR45","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-61794-9_57","volume-title":"Practice and theory of automated timetabling","author":"G. Lajos","year":"1996","unstructured":"Lajos, G. (1996). Complete university modular timetabling using constraint logic programming. In E. Burke & P. Ross (Eds.), LNCS : Vol. 1153. Practice and theory of automated timetabling (pp. 146\u2013161). Berlin: Springer."},{"issue":"1\u20132","key":"171_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2004.05.004","volume":"159","author":"J. Larrosa","year":"2004","unstructured":"Larrosa, J., & Schiex, T. (2004). Solving weighted CSP by maintaining arc consistency. Artificial Intelligence, 159(1\u20132), 1\u201326.","journal-title":"Artificial Intelligence"},{"key":"171_CR47","volume-title":"7th international conference on the practice and theory of automated timetabling","author":"R. Lewis","year":"2008","unstructured":"Lewis, R. (2008a). A time-dependent metaheuristic algorithm for Track-2 of the second international timetabling competition. In E. Burke & M. Gendreau (Eds.), 7th international conference on the practice and theory of automated timetabling. Montr\u00e9al: Universit\u00e9 de Montr\u00e9al."},{"issue":"1","key":"171_CR48","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R. Lewis","year":"2008","unstructured":"Lewis, R. (2008b). A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum, 30(1), 167\u2013190.","journal-title":"OR Spectrum"},{"key":"171_CR49","unstructured":"Lewis, R., Paechter, B., & McCollum, B. (2007). Post enrolment based course timetabling: A description of the problem model used for track two of the second international timetabling competition (Cardiff Working Papers in Accounting and Finance A2007-3). Cardiff Business School, Cardiff University."},{"issue":"1","key":"171_CR50","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. K. Mackworth","year":"1977","unstructured":"Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8(1), 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"171_CR51","volume-title":"7th international conference on the practice and theory of automated timetabling","author":"A. Mayer","year":"2008","unstructured":"Mayer, A., Nothegger, C., Chwatal, A., & Raidl, G. R. (2008). Solving the post enrolment course timetabling problem by ant colony optimization. In Burke, E. & Gendreau, M. (Eds.), 7th international conference on the practice and theory of automated timetabling. Montr\u00e9al: Universit\u00e9 de Montr\u00e9al."},{"key":"171_CR52","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-77345-0_1","volume-title":"Practice and theory of automated timetabling VI","author":"B. McCollum","year":"2007","unstructured":"McCollum, B. (2007). A perspective on bridging the gap between theory and practice in university timetabling. In E. Burke & H. Rudov\u00e1 (Eds.), LNCS : Vol. 3867. Practice and theory of automated timetabling VI (pp. 3\u201323). Berlin: Springer."},{"key":"171_CR53","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B. McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis,\u00a0R., Parkes, A. J., Di Gaspero, L., Qu, R., & Burke, E. K. (2010). Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing, 22, 120\u2013130.","journal-title":"INFORMS Journal on Computing"},{"key":"171_CR54","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58, 161\u2013205.","journal-title":"Artificial Intelligence"},{"key":"171_CR55","unstructured":"M\u00fcller, T. (2005). Constraint-based timetabling. PhD thesis, Charles University in Prague, Faculty of Mathematics and Physics."},{"issue":"1","key":"171_CR56","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T. M\u00fcller","year":"2009","unstructured":"M\u00fcller, T. (2009). ITC2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429\u2013446.","journal-title":"Annals of Operations Research"},{"key":"171_CR57","unstructured":"M\u00fcller, T., & Bart\u00e1k, R. (2002). Interactive timetabling: Concepts, techniques, and practical results. In E. Burke & P. De Causmaecker (Eds.), PATAT 2002\u2014Proceedings of the 4th international conference on the practice and theory of automated timetabling (pp. 58\u201372)."},{"key":"171_CR58","volume-title":"7th international conference on the practice and theory of automated timetabling","author":"T. M\u00fcller","year":"2008","unstructured":"M\u00fcller, T., & Murray, K. (2008). Comprehensive approach to student sectioning. In E. Burke & M. Gendreau (Eds.), 7th international conference on the practice and theory of automated timetabling. Montr\u00e9al: Universit\u00e9 de Montr\u00e9al."},{"key":"171_CR59","unstructured":"M\u00fcller, T., Bart\u00e1k, R., & Rudov\u00e1, H. (2004). Conflict-based statistics. In J. Gottlieb, D. Landa-Silva, N. Musliu, & E. Soubeiga (Eds.), EU\/ME workshop on design and evaluation of advanced hybrid meta-heuristics. University of Nottingham."},{"key":"171_CR60","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/11593577_8","volume-title":"Practice and theory of automated timetabling V","author":"T. M\u00fcller","year":"2005","unstructured":"M\u00fcller, T., Bart\u00e1k, R., & Rudov\u00e1, H. (2005). Minimal perturbation problem in course timetabling. In E. Burke & M. Trick (Eds.), LNCS : Vol. 3616. Practice and theory of automated timetabling V (pp. 126\u2013146). Berlin: Springer."},{"key":"171_CR61","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-77345-0_13","volume-title":"Practice and theory of automated timetabling VI","author":"K. Murray","year":"2007","unstructured":"Murray, K., M\u00fcller, T., & Rudov\u00e1, H. (2007). Modeling and solution of a complex university course timetabling problem. In E. Burke & H. Rudov\u00e1 (Eds.), LNCS : Vol. 3867. Practice and theory of automated timetabling VI (pp. 189\u2013209). Berlin: Springer."},{"issue":"4","key":"171_CR62","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10951-008-0090-8","volume":"12","author":"D. Ouelhadj","year":"2009","unstructured":"Ouelhadj, D., Petrovic, S., & Qu, R. (2009). A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling, 12(4), 417\u2013431.","journal-title":"Journal of Scheduling"},{"key":"171_CR63","volume-title":"The handbook of scheduling: algorithms, models, and performance analysis","author":"S. Petrovic","year":"2004","unstructured":"Petrovic, S., & Burke, E. K. (2004). University timetabling. In J. Y.-T. Leung (Ed.), The handbook of scheduling: algorithms, models, and performance analysis. New York: CRC Press, Chap. 45."},{"key":"171_CR64","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/11593577_3","volume-title":"Practice and theory of automated timetabling V","author":"S. Piechowiak","year":"2005","unstructured":"Piechowiak, S., Ma, J., & Mandiau, R. (2005). An open interactive timetabling tool. In E. Burke & M. Trick (Eds.), LNCS : Vol. 3616. Practice and theory of automated timetabling V (pp. 34\u201350). Berlin: Springer."},{"key":"171_CR65","first-page":"362","volume-title":"Proceedings of the eleventh national conference on artificial intelligence and the eighth innovative applications of artificial intelligence conference","author":"J.-C. R\u00e9gin","year":"1994","unstructured":"R\u00e9gin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proceedings of the eleventh national conference on artificial intelligence and the eighth innovative applications of artificial intelligence conference (pp. 362\u2013367). Cambridge: AAAI Press\/MIT Press."},{"key":"171_CR66","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-61794-9_71","volume-title":"Practice and theory of automated timetabling","author":"V. Robert","year":"1996","unstructured":"Robert, V., & Hertz, A. (1996). How to decompose constrained course scheduling problems into easier assignment type subproblems. In E. Burke & P. Ross (Eds.), LNCS : Vol. 1153. Practice and theory of automated timetabling (pp. 364\u2013373). Berlin: Springer."},{"key":"171_CR67","volume-title":"Handbook of constraint programming","year":"2006","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (Eds.) (2006). Handbook of constraint programming. Amsterdam: Elsevier."},{"key":"171_CR68","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-540-45157-0_21","volume-title":"Practice and theory of automated timetabling IV","author":"H. Rudov\u00e1","year":"2003","unstructured":"Rudov\u00e1, H., & Murray, K. (2003). University course timetabling with soft constraints. In E. Burke & P. De\u00a0Causmaecker (Eds.), LNCS : Vol. 2740. Practice and theory of automated timetabling IV (pp. 310\u2013328). Berlin: Springer."},{"issue":"3","key":"171_CR69","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1287\/inte.25.3.30","volume":"25","author":"S. E. Sampson","year":"1995","unstructured":"Sampson, S. E., Freeland, J. R., & Weiss, E. N. (1995). Class scheduling to maximize participant satisfaction. Interfaces, 25(3), 30\u201341.","journal-title":"Interfaces"},{"issue":"2","key":"171_CR70","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A. (1999). A survey of automated timetabling. Articifial Intelligence Review, 13(2), 87\u2013127.","journal-title":"Articifial Intelligence Review"},{"key":"171_CR71","first-page":"631","volume-title":"Proceedings of the fourteenth international joint conference on artificial intelligence","author":"T. Schiex","year":"1995","unstructured":"Schiex, T., Fargier, H., & Verfaillie, G. (1995). Valued constraint satisfaction problems: Hard and easy problems. In C. S. Mellish (Ed.), Proceedings of the fourteenth international joint conference on artificial intelligence (pp. 631\u2013639). San Mateo: Morgan Kaufmann."},{"issue":"4","key":"171_CR72","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s00291-006-0074-z","volume":"29","author":"K. Schimmelpfeng","year":"2007","unstructured":"Schimmelpfeng, K., & Helberg, S. (2007). Application of a real-world university-course timetabling model solved by integer programming. OR Spectrum, 29(4), 783\u2013803.","journal-title":"OR Spectrum"},{"issue":"2","key":"171_CR73","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G. Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000). Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159(2), 139\u2013171.","journal-title":"Journal of Computational Physics"},{"key":"171_CR74","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","volume":"3","author":"L. G. Shapiro","year":"1981","unstructured":"Shapiro, L. G., & Haralick, R. M. (1981). Structural descriptions and inexact matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 3, 504\u2013519.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"171_CR75","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S1574-6526(06)80008-8","volume-title":"Handbook of constraint programming","author":"P. Beek van","year":"2006","unstructured":"van Beek, P. (2006). Backtracking search algorithms. In F. Rossi et al. (Eds.), Handbook of constraint programming (pp. 85\u2013134). Amsterdam: Elsevier."},{"issue":"3","key":"171_CR76","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10601-005-2239-9","volume":"10","author":"G. Verfaillie","year":"2005","unstructured":"Verfaillie, G., & Jussien, N. (2005). Constraint solving in uncertain and dynamic environments\u2014a survey. Constraints, 10(3), 253\u2013281.","journal-title":"Constraints"},{"key":"171_CR77","volume-title":"Handbook of metaheuristics","author":"C. Voudouris","year":"2003","unstructured":"Voudouris, C., & Tsang, E. (2003). Guided local search. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics. Dordrecht: Kluwer Academic, Chap.\u00a07."},{"key":"171_CR78","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BFb0055889","volume-title":"Practice and theory of automated timetabling II","author":"G. M. White","year":"1998","unstructured":"White, G. M., & Zhang, J. (1998). Generating complete university timetables by combining tabu search with constraint logic. In E.\u00a0Burke & M.\u00a0Carter (Eds.), LNCS : Vol. 1408. Practice and theory of automated timetabling II (pp. 187\u2013198). Berlin: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0171-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0171-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0171-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0171-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,1]]},"references-count":78,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["171"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0171-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,1]]}}}