{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:00:42Z","timestamp":1772665242314,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T00:00:00Z","timestamp":1600041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T00:00:00Z","timestamp":1600041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["DSAIPA\/AI\/0044\/2018"],"award-info":[{"award-number":["DSAIPA\/AI\/0044\/2018"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UIDB\/50021\/2020"],"award-info":[{"award-number":["UIDB\/50021\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BSAB\/143643\/2019"],"award-info":[{"award-number":["SFRH\/BSAB\/143643\/2019"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BD\/143212\/2019"],"award-info":[{"award-number":["SFRH\/BD\/143212\/2019"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10951-020-00666-3","type":"journal-article","created":{"date-parts":[[2020,9,14]],"date-time":"2020-09-14T07:02:45Z","timestamp":1600066965000},"page":"35-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Disruptions in timetables: a case study at Universidade de Lisboa"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3876-1011","authenticated-orcid":false,"given":"Alexandre","family":"Lemos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7934-5495","authenticated-orcid":false,"given":"Pedro T.","family":"Monteiro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4868-415X","authenticated-orcid":false,"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,14]]},"reference":[{"issue":"1","key":"666_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-012-1081-x","volume":"218","author":"RJ As\u00edn Ach\u00e1","year":"2014","unstructured":"As\u00edn Ach\u00e1, R. J., & Nieuwenhuis, R. (2014). Curriculum-based course timetabling with SAT and MaxSAT. Annals Operations Research, 218(1), 71\u201391. https:\/\/doi.org\/10.1007\/s10479-012-1081-x.","journal-title":"Annals Operations Research"},{"issue":"1","key":"666_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-018-2757-7","volume":"275","author":"M Banbara","year":"2019","unstructured":"Banbara, M., Inoue, K., Kaufmann, B., Okimoto, T., Schaub, T., Soh, T., et al. (2019). $$teaspoo{n}$$: Solving the curriculum-based course timetabling problems with Answer Set Programming. Annals Operations Research, 275(1), 3\u201337. https:\/\/doi.org\/10.1007\/s10479-018-2757-7.","journal-title":"Annals Operations Research"},{"issue":"1","key":"666_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10951-011-0224-2","volume":"15","author":"R Bellio","year":"2012","unstructured":"Bellio, R., Gaspero, L. D., & Schaerf, A. (2012). Design and statistical analysis of a hybrid local search algorithm for course timetabling. Journal of Scheduling, 15(1), 49\u201361. https:\/\/doi.org\/10.1007\/s10951-011-0224-2.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"666_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11750-015-0366-z","volume":"23","author":"A Bettinelli","year":"2015","unstructured":"Bettinelli, A., Cacchiani, V., Roberti, R., & Toth, P. (2015). An overview of curriculum-based course timetabling. TOP, 23(2), 313\u2013349. https:\/\/doi.org\/10.1007\/s11750-015-0366-z.","journal-title":"TOP"},{"issue":"1","key":"666_CR5","doi-asserted-by":"publisher","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, A. J. (2009). Towards improving the utilization of university teaching space. Journal of the Operational Research Society, 60(1), 130\u2013143. https:\/\/doi.org\/10.1057\/palgrave.jors.2602523.","journal-title":"Journal of the Operational Research Society"},{"key":"666_CR6","doi-asserted-by":"publisher","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2008). Penalising patterns in timetables: Novel integer programming formulations. In Operations Research Proceedings (pp 409\u2013414). New York: Springer https:\/\/doi.org\/10.1007\/978-3-540-77903-2_63.","DOI":"10.1007\/978-3-540-77903-2_63"},{"issue":"3","key":"666_CR7","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.cor.2009.02.023","volume":"37","author":"EK Burke","year":"2010","unstructured":"Burke, E. K., Marecek, J., Parkes, A. J., & Rudov\u00e1, H. (2010). Decomposition, reformulation, and diving in university course timetabling. Computers & Operations Research, 37(3), 582\u2013597. https:\/\/doi.org\/10.1016\/j.cor.2009.02.023.","journal-title":"Computers & Operations Research"},{"issue":"10","key":"666_CR8","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1016\/j.cor.2013.02.010","volume":"40","author":"V Cacchiani","year":"2013","unstructured":"Cacchiani, V., Caprara, A., Roberti, R., & Toth, P. (2013). A new lower bound for curriculum-based course timetabling. Computers & Operations Research, 40(10), 2466\u20132477. https:\/\/doi.org\/10.1016\/j.cor.2013.02.010.","journal-title":"Computers & Operations Research"},{"key":"666_CR9","unstructured":"de\u00a0Souza\u00a0Rocha, W., Claudia, M., Boeres, S., & Rangel, M.C. (2012). A GRASP algorithm for the university timetabling problem. In Proceeding of 9th international conference of the practice and theory of automated timetabling (PATAT) (pp. 404\u2013406)."},{"key":"666_CR10","unstructured":"Di\u00a0Gaspero, L., Schaerf, A., & McCollum, B. (2007). The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3). Tech. Rep., Queen\u2019s University."},{"key":"666_CR11","doi-asserted-by":"publisher","unstructured":"Elkhyari, A., Gu\u00e9ret, C., & Jussien, N. (2002). Solving dynamic resource constraint project scheduling problems using new constraint programming tools. In Proceeding of 4th international conference of the practice and theory of automated timetabling (PATAT) (pp. 39\u201362). https:\/\/doi.org\/10.1007\/978-3-540-45157-0_3","DOI":"10.1007\/978-3-540-45157-0_3"},{"issue":"4","key":"666_CR12","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S Even","year":"1976","unstructured":"Even, S., Itai, A., & Shamir, A. (1976). On the complexity of timetable and multicommodity flow problems. Society for Industrial and Applied Mathematics SIAM Journal on Computing, 5(4), 691\u2013703. https:\/\/doi.org\/10.1137\/0205048.","journal-title":"Society for Industrial and Applied Mathematics SIAM Journal on Computing"},{"issue":"5","key":"666_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1287\/inte.28.5.29","volume":"28","author":"DH Fylstra","year":"1998","unstructured":"Fylstra, D. H., Lasdon, L. S., Watson, J., & Waren, A. D. (1998). Design and use of the Microsoft Excel solver. Interfaces, 28(5), 29\u201355. https:\/\/doi.org\/10.1287\/inte.28.5.29.","journal-title":"Interfaces"},{"key":"666_CR14","unstructured":"Gurobi\u00a0Optimization L. (2018). Gurobi optimizer reference manual. http:\/\/www.gurobi.com"},{"issue":"2","key":"666_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R. W. (1950). Error detecting and error correcting codes. The Bell System Technical Journal, 29(2), 147\u2013160. https:\/\/doi.org\/10.1002\/j.1538-7305.1950.tb00463.x.","journal-title":"The Bell System Technical Journal"},{"key":"666_CR16","doi-asserted-by":"publisher","unstructured":"Kingston, J. H. (2013). Educational timetabling. In Automated Scheduling and Planning\u2014From Theory to Practice (pp. 91\u2013108). New York: Springer. https:\/\/doi.org\/10.1007\/978-3-642-39304-4_4","DOI":"10.1007\/978-3-642-39304-4_4"},{"key":"666_CR17","unstructured":"Kingston, J.H. (2016). Specifying and solving minimal perturbation problems in timetabling. In Proceeding of 11th International Conference of the Practice and Theory of Automated Timetabling (PATAT) (pp. 207\u2013210)."},{"key":"666_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cor.2016.04.006","volume":"73","author":"W Ku","year":"2016","unstructured":"Ku, W., & Beck, J. C. (2016). Mixed integer programming models for job shop scheduling: A computational analysis. Computers & Operations Research, 73, 165\u2013173. https:\/\/doi.org\/10.1016\/j.cor.2016.04.006.","journal-title":"Computers & Operations Research"},{"key":"666_CR19","doi-asserted-by":"publisher","unstructured":"Lach, G., & L\u00fcbbecke, M.E. (2008). Optimal university course timetables and the partial transversal polytope. In Experimental Algorithms, 7th International Workshop (pp. 235\u2013248). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_18","DOI":"10.1007\/978-3-540-68552-4_18"},{"issue":"100","key":"666_CR20","doi-asserted-by":"publisher","first-page":"092","DOI":"10.1016\/j.orp.2018.100092","volume":"6","author":"A Lemos","year":"2019","unstructured":"Lemos, A., Melo, F. S., Monteiro, P. T., & Lynce, I. (2019). Room usage optimization in timetabling: A case study at universidade de lisboa. Operations Research Perspectives, 6(100), 092. https:\/\/doi.org\/10.1016\/j.orp.2018.100092.","journal-title":"Operations Research Perspectives"},{"key":"666_CR21","unstructured":"Lemos, A., Monteiro, P.T., & Lynce, I. (2020a). ITC 2019: University Course Timetabling with MaxSAT. In Practice and Theory of Automated Timetabling 2021 (Vol. 1)."},{"key":"666_CR22","doi-asserted-by":"crossref","unstructured":"Lemos, A., Monteiro, P. T., & Lynce, I. (2020b). Minimal perturbation in university timetabling with maximum satisfiability. In Proceedings of 16th international conference on integration of constraint programming, artificial intelligence, and operations research (CPAIOR). Preprint at http:\/\/web.tecnico.ulisboa.pt\/alexandre.lemos\/papers\/CPAIOR20.pdf.","DOI":"10.1007\/978-3-030-58942-4_21"},{"issue":"2","key":"666_CR23","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.ejor.2019.01.026","volume":"276","author":"M Lindahl","year":"2019","unstructured":"Lindahl, M., Stidsen, T., & S\u00f8rensen, M. (2019). Quality recovering of university timetables. European Journal of Operational Research, 276(2), 422\u2013435. https:\/\/doi.org\/10.1016\/j.ejor.2019.01.026.","journal-title":"European Journal of Operational Research"},{"key":"666_CR24","doi-asserted-by":"publisher","unstructured":"McCollum, B. (2006). University timetabling: Bridging the gap between research and practice. In Proceedings of the 5th international conference on the practice and theory of automated timetabling (PATAT) (pp. 15\u201335). New York: Springer. https:\/\/doi.org\/10.1007\/978-3-540-77345-0_1.","DOI":"10.1007\/978-3-540-77345-0_1"},{"issue":"1","key":"666_CR25","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T M\u00fcller","year":"2009","unstructured":"M\u00fcller, T. (2009). ITC-2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429. https:\/\/doi.org\/10.1007\/s10479-009-0644-y.","journal-title":"Annals of Operations Research"},{"key":"666_CR26","doi-asserted-by":"publisher","unstructured":"M\u00fcller, T., Rudov\u00e1, H., & Bart\u00e1k, R. (2004). Minimal perturbation problem in course timetabling. In Proceedings of the 5th international conference on the practice and theory of automated timetabling (PATAT) (pp. 126\u2013146). https:\/\/doi.org\/10.1007\/11593577_8.","DOI":"10.1007\/11593577_8"},{"key":"666_CR27","unstructured":"M\u00fcller, T., Rudov\u00e1, H., & M\u00fcllerov\u00e1, Z. (2018). University course timetabling and international timetabling competition 2019. In Proceedings of the 12th international conference on the practice and theory of automated timetabling (PATAT) (p. 27)."},{"issue":"2","key":"666_CR28","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10479-015-2094-z","volume":"252","author":"AE Phillips","year":"2017","unstructured":"Phillips, A. E., Walker, C. G., Ehrgott, M., & Ryan, D. M. (2017). Integer programming for minimal perturbation problems in university course timetabling. Annals Operations Research, 252(2), 283\u2013304. https:\/\/doi.org\/10.1007\/s10479-015-2094-z.","journal-title":"Annals Operations Research"},{"issue":"1","key":"666_CR29","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10479-017-2625-x","volume":"275","author":"N Pillay","year":"2019","unstructured":"Pillay, N., & \u00d6zcan, E. (2019). Automated generation of constructive ordering heuristics for educational timetabling. Annals Operations Research, 275(1), 181\u2013208. https:\/\/doi.org\/10.1007\/s10479-017-2625-x.","journal-title":"Annals Operations Research"},{"issue":"4","key":"666_CR30","doi-asserted-by":"publisher","first-page":"139","DOI":"10.3233\/SAT190083","volume":"7","author":"O Roussel","year":"2011","unstructured":"Roussel, O. (2011). Controlling a solver execution with the runsolver tool. Journal on Satisfiability, Boolean Modelling and Computation, 7(4), 139\u2013144.","journal-title":"Journal on Satisfiability, Boolean Modelling and Computation"},{"issue":"4","key":"666_CR31","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"5","author":"HE Sakkout","year":"2000","unstructured":"Sakkout, H. E., & Wallace, M. (2000). Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4), 359\u2013388. https:\/\/doi.org\/10.1023\/A:1009856210543.","journal-title":"Constraints"},{"key":"666_CR32","doi-asserted-by":"crossref","unstructured":"Sherali, H. D., & Adams, W. P. (1998). Reformulation-linearization techniques for discrete optimization problems. In Handbook of combinatorial optimization (pp. 479\u2013532). New York: Springer.","DOI":"10.1007\/978-1-4613-0303-9_7"},{"issue":"2","key":"666_CR33","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.ejor.2015.11.028","volume":"251","author":"H Vermuyten","year":"2016","unstructured":"Vermuyten, H., Lemmens, S., Marques, I., & Beli\u00ebn, J. (2016). Developing compact course timetables with optimized student flows. European Journal of Operational Research, 251(2), 651\u2013661. https:\/\/doi.org\/10.1016\/j.ejor.2015.11.028.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"666_CR34","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10479-017-2688-8","volume":"275","author":"RAO Vrielink","year":"2019","unstructured":"Vrielink, R. A. O., Jansen, E. A., Hans, E. W., & van Hillegersberg, J. (2019). Practices in timetabling in higher education institutions: A systematic review. Annals Operations Research, 275(1), 145\u2013160. https:\/\/doi.org\/10.1007\/s10479-017-2688-8.","journal-title":"Annals Operations Research"},{"issue":"3","key":"666_CR35","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s10601-011-9108-5","volume":"16","author":"R Zivan","year":"2011","unstructured":"Zivan, R., Grubshtein, A., & Meisels, A. (2011). Hybrid search for minimal perturbation in dynamic csps. Constraints, 16(3), 228\u2013249. https:\/\/doi.org\/10.1007\/s10601-011-9108-5.","journal-title":"Constraints"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00666-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-020-00666-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00666-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T01:32:06Z","timestamp":1631583126000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-020-00666-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,14]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["666"],"URL":"https:\/\/doi.org\/10.1007\/s10951-020-00666-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,14]]},"assertion":[{"value":"14 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}