{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:46:16Z","timestamp":1768423576308,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"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":["SFRH\/BD\/143212\/2019"],"award-info":[{"award-number":["SFRH\/BD\/143212\/2019"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00e2ncia e a Tecnologia","doi-asserted-by":"publisher","award":["DSAIPA\/AI\/0033\/2019"],"award-info":[{"award-number":["DSAIPA\/AI\/0033\/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":["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"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10951-021-00695-6","type":"journal-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T02:02:20Z","timestamp":1627005740000},"page":"371-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Introducing UniCorT: an iterative university course timetabling tool with MaxSAT"],"prefix":"10.1007","volume":"25","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":[[2021,7,23]]},"reference":[{"key":"695_CR1","doi-asserted-by":"crossref","unstructured":"Ans\u00f3tegui, C., & Many\u00e0, F. (2004). Mapping problems with finite-domain variables into problems with boolean variables. Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT),3542, 1\u201315.","DOI":"10.1007\/11527695_1"},{"issue":"1","key":"695_CR2","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 of Operations Research, 218(1), 71\u201391.","journal-title":"Annals of Operations Research"},{"key":"695_CR3","unstructured":"Atsuta M, Nonobe K, Ibaraki T (2008) ITC-2007 track 2: an approach using a general CSP solver. In: 7th International Conference on the Practice and Theory of Automated Timetabling (PATAT), pp 19\u201322"},{"issue":"1","key":"695_CR4","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 of Operations Research, 275(1), 3\u201337.","journal-title":"Annals of Operations Research"},{"key":"695_CR5","unstructured":"Bayardo, R. J. & Schrag, R. (1997) Using CSP look-back techniques to solve real-world SAT instances. In: Kuipers B, Webber BL (eds) Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI) and Ninth Innovative Applications of Artificial Intelligence Conference (IAAI), AAAI Press \/ The MIT Press, pp 203\u2013208."},{"key":"695_CR6","volume-title":"Handbook of Satisfiability","author":"A Biere","year":"2009","unstructured":"Biere, A., Heule, M., & van Maaren, H. (2009). Handbook of Satisfiability. Amsterdam: IOS press."},{"key":"695_CR7","doi-asserted-by":"crossref","unstructured":"Bittner PM, Thum T, Schaefer I (2019) SAT encodings of the at-most-k constraint - A case study on configuring university courses. In: Proceedings of the Software Engineering and Formal Methods (SEFM), pp 127\u2013144.","DOI":"10.1007\/978-3-030-30446-1_7"},{"key":"695_CR8","doi-asserted-by":"crossref","unstructured":"Carter, M. W. (2000) A comprehensive course timetabling and student scheduling system at the University of Waterloo. In: 3rd International Conference on the Practice and Theory of Automated Timetabling (PATAT), pp 64\u201384.","DOI":"10.1007\/3-540-44629-X_5"},{"issue":"3","key":"695_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., & Putnam, H. (1960). A computing procedure for quantification theory. J ACM, 7(3), 201\u2013215.","journal-title":"J ACM"},{"issue":"1\u20134","key":"695_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2006). Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2(1\u20134), 1\u201326.","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"695_CR11","unstructured":"Er-rhaimini K (2020) Forest growth optimization for solving timetabling problems. In: Proceedings of the International Timetabling Competition 2019."},{"key":"695_CR12","unstructured":"Gashi E, Sylejmani K (2020) Simulated annealing with penalization for university course timetabling. In: Proceedings of the International Timetabling Competition 2019."},{"issue":"2","key":"695_CR13","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.ejor.2019.11.024","volume":"283","author":"A G\u00fclc\u00fc","year":"2020","unstructured":"G\u00fclc\u00fc, A., & Akkan, C. (2020). Robust university course timetabling problem subject to single and multiple disruptions. European Journal of Operational Research, 283(2), 630\u2013646.","journal-title":"European Journal of Operational Research"},{"key":"695_CR14","doi-asserted-by":"publisher","unstructured":"Herres, B., & Schmitz, H. (2021). Decomposition of university course timetabling. Annals of Operations Research, 302, 405\u2013423. https:\/\/doi.org\/10.1007\/s10479-019-03382-0","DOI":"10.1007\/s10479-019-03382-0"},{"key":"695_CR15","unstructured":"Holm, D.S., Mikkelsen, R\u00d8, S\u00f8rensen, M., Stidsen TR (2020b) A mip based approach for international timetabling competation 2019. In: Proceedings of the International Timetabling Competition 2019."},{"key":"695_CR16","unstructured":"Holm, D., Mikkelsen, R., S\u00f8rensen, M., Stidsen, T. (2020a) A mip formulation of the international timetabling competition 2019 problem. Technical Report."},{"key":"695_CR17","doi-asserted-by":"crossref","unstructured":"Hoshino, R., Fabris, I. (2020) Optimizing student course preferences in school timetabling. In: Proceedings of 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR), Springer, pp 283\u2013299.","DOI":"10.1007\/978-3-030-58942-4_19"},{"key":"695_CR18","doi-asserted-by":"publisher","unstructured":"Joshi, S., Kumar, P., Martins, R., & Rao, S. (2018). Approximation strategies for incomplete MaxSAT. In J. Hooker (Eds.), Principles and practice of constraint programming. CP 2018. Lecture Notes in Computer Science, Vol. 11008. Cham: Springer. https:\/\/doi.org\/10.1007\/978-3-319-98334-9_15","DOI":"10.1007\/978-3-319-98334-9_15"},{"key":"695_CR19","doi-asserted-by":"crossref","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, 100092.","DOI":"10.1016\/j.orp.2018.100092"},{"key":"695_CR20","doi-asserted-by":"crossref","unstructured":"Lemos, A., Monteiro, P.T., Lynce I (2020c) Minimal perturbation in university timetabling with maximum satisfiability. In: Proceedings of 17th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR), Springer, pp 317\u2013333.","DOI":"10.1007\/978-3-030-58942-4_21"},{"key":"695_CR21","unstructured":"Lemos, A., Monteiro, P. T., Lynce, I. (2020b) Itc 2019: University course timetabling with maxsat. In: Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (PATAT) Volume 1, pp 105 \u2013 128."},{"key":"695_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-020-00666-3","author":"A Lemos","year":"2020","unstructured":"Lemos, A., Monteiro, P. T., & Lynce, I. (2020a). Disruptions in timetables: A case study at Universidade de Lisboa. Journal of Scheduling,. https:\/\/doi.org\/10.1007\/s10951-020-00666-3.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"695_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.","journal-title":"European Journal of Operational Research"},{"key":"695_CR24","unstructured":"Lovelace, A. L. (2010) On the complexity of scheduling university courses. Master\u2019s thesis, California Polytechnic State University, San Luis Obispo."},{"issue":"3\u20134","key":"695_CR25","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10472-011-9233-2","volume":"62","author":"J Marques-Silva","year":"2011","unstructured":"Marques-Silva, J., Argelich, J., Gra\u00e7a, A., & Lynce, I. (2011). Boolean lexicographic optimization: algorithms & applications. Annals of Mathematics and Artificial Intelligence, 62(3\u20134), 317\u2013343.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"695_CR26","doi-asserted-by":"crossref","unstructured":"Martins, R., Manquinho, V. M., Lynce, I. (2014) Open-WBO: A modular MaxSAT solver,. In: Theory and Applications of Satisfiability Testing (SAT) - 17th, pp 438\u2013445.","DOI":"10.1007\/978-3-319-09284-3_33"},{"key":"695_CR27","unstructured":"McCollum, B. (2006) University timetabling: Bridging the gap between research and practice. In: 5th International Conference on the Practice and Theory of Automated Timetabling (PATAT), Springer, pp 15\u201335."},{"key":"695_CR28","unstructured":"M\u00fcller, T., (2020) Itc 2019: Preliminary results using the unitime solver. In: Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling (PATAT) Volume 1."},{"key":"695_CR29","unstructured":"M\u00fcller, T., Rudov\u00e1, H., M\u00fcllerov\u00e1, Z., (2018) University course timetabling and International Timetabling Competition 2019. In: Burke EK, Di\u00a0Gaspero L, McCollum B, Musliu N, \u00d6zcan E (eds) Proceedings of the 12th International Conference on the Practice and Theory of Automated Timetabling (PATAT-2018), pp 5\u201331."},{"issue":"1","key":"695_CR30","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.","journal-title":"Annals of Operations Research"},{"key":"695_CR31","doi-asserted-by":"crossref","unstructured":"Nadel, A., (2019a) Anytime weighted MaxSAT with improved polarity selection and bit-vector optimization. In: Proceedings of the 19th Conference on Formal Methods in Computer Aided Design (FMCAD).","DOI":"10.23919\/FMCAD.2019.8894273"},{"key":"695_CR32","doi-asserted-by":"crossref","unstructured":"Nadel, A., (2019b) TT-Open-WBO-Inc: Tuning polarity and variable selection for anytime SAT-based optimization. In: Proceedings of the MaxSAT Evaluations.","DOI":"10.3233\/SAT-200126"},{"issue":"2","key":"695_CR33","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 of Operations Research, 252(2), 283\u2013304.","journal-title":"Annals of Operations Research"},{"key":"695_CR34","unstructured":"Rappos, E., Thi\u00e9mard, E., Robert, S., H\u00eache, J.F., (2020) International timetabling competition 2019: A mixed integer programming approach for solving university timetabling problems. In: Proceedings of the International Timetabling Competition 2019."},{"issue":"2","key":"695_CR35","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10951-010-0171-3","volume":"14","author":"H Rudov\u00e1","year":"2011","unstructured":"Rudov\u00e1, H., M\u00fcller, T., & Murray, K. S. (2011). Complex university course timetabling. J Sched, 14(2), 187\u2013207.","journal-title":"J Sched"},{"issue":"1","key":"695_CR36","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10479-017-2621-1","volume":"275","author":"D Schindl","year":"2019","unstructured":"Schindl, D. (2019). Optimal student sectioning on mandatory courses with various sections numbers. Annals of Operations Research, 275(1), 209\u2013221.","journal-title":"Annals of Operations Research"},{"key":"695_CR37","unstructured":"Silva, J. P. M., Sakallah, K. A., (1996) GRASP - a new search algorithm for satisfiability. In: Rutenbar, R. A., Otten RHJM (eds) Proceedings of the International Conference on Computer-Aided Design (ICCAD), IEEE Computer Society \/ ACM, pp 220\u2013227."},{"key":"695_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Simulated Annealing: Theory and Applications, Mathematics and Its Applications","author":"PJM van Laarhoven","year":"1987","unstructured":"van Laarhoven, P. J. M., & Aarts, E. H. L. (1987). Simulated Annealing: Theory and Applications, Mathematics and Its Applications (Vol. 37). New york: Springer."},{"issue":"1","key":"695_CR39","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 of Operations Research, 275(1), 145\u2013160.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"695_CR40","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"JP Warners","year":"1998","unstructured":"Warners, J. P. (1998). A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters, 68(2), 63\u201369.","journal-title":"Information Processing Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00695-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-021-00695-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00695-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:01:18Z","timestamp":1659078078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-021-00695-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,23]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["695"],"URL":"https:\/\/doi.org\/10.1007\/s10951-021-00695-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,23]]},"assertion":[{"value":"1 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}