{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:17:11Z","timestamp":1772641031935,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10479-024-06242-8","type":"journal-article","created":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T05:01:47Z","timestamp":1728450107000},"page":"845-870","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Educational timetabling problem with teaching load assignment using preferences and compactness"],"prefix":"10.1007","volume":"358","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9982-9991","authenticated-orcid":false,"given":"C.","family":"Maya-Padr\u00f3n","sequence":"first","affiliation":[]},{"given":"N. M.","family":"Arratia-Mart\u00ednez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"key":"6242_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.cor.2017.09.007","volume":"90","author":"C Akkan","year":"2018","unstructured":"Akkan, C., & G\u00fclc\u00fc, A. (2018). A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem. Computers & Operations Research, 90, 22\u201332. https:\/\/doi.org\/10.1016\/j.cor.2017.09.007","journal-title":"Computers & Operations Research"},{"key":"6242_CR2","doi-asserted-by":"publisher","first-page":"111666","DOI":"10.1109\/ACCESS.2021.3103495","volume":"9","author":"H Algethami","year":"2021","unstructured":"Algethami, H., & Laesanklang, W. (2021). A mathematical model for course timetabling problem with faculty-course assignment constraints. IEEE Access, 9, 111666\u2013111682. https:\/\/doi.org\/10.1109\/ACCESS.2021.3103495","journal-title":"IEEE Access"},{"issue":"19","key":"6242_CR3","doi-asserted-by":"publisher","first-page":"2500","DOI":"10.3390\/math9192500","volume":"9","author":"NM Arratia-Martinez","year":"2021","unstructured":"Arratia-Martinez, N. M., Avila-Torres, P. A., & Trujillo-Reyes, J. C. (2021). Solving a university course timetabling problem based on AACSB policies. Mathematics, 9(19), 2500. https:\/\/doi.org\/10.3390\/math9192500","journal-title":"Mathematics"},{"key":"6242_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2021\/6617177","volume":"2021","author":"NM Arratia Martinez","year":"2021","unstructured":"Arratia Martinez, N. M., Maya Padron, C., & Avila Torres, P. A. (2021). University course timetabling problem with professor assignment. Mathematical Problems in Engineering, 2021, 1\u20139. https:\/\/doi.org\/10.1155\/2021\/6617177","journal-title":"Mathematical Problems in Engineering"},{"key":"6242_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cie.2014.11.010","volume":"86","author":"H Babaei","year":"2015","unstructured":"Babaei, H., Karimpour, J., & Hadidi, A. (2015). A survey of approaches for university course timetabling problem. Computers & Industrial Engineering, 86, 43\u201359. https:\/\/doi.org\/10.1016\/j.cie.2014.11.010","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"6242_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2022.07.011","volume":"308","author":"S Ceschia","year":"2022","unstructured":"Ceschia, S., Di Gaspero, L., & Schaerf, A. (2022). Educational timetabling: Problems, benchmarks, and state-of-the-art results. European Journal of Operational Research, 308(1), 1\u201318. https:\/\/doi.org\/10.1016\/j.ejor.2022.07.011","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"6242_CR7","doi-asserted-by":"publisher","first-page":"498","DOI":"10.3390\/axioms12050498","volume":"12","author":"M Chen","year":"2023","unstructured":"Chen, M., Werner, F., & Shokouhifar, M. (2023). Mathematical modeling and exact optimizing of university course scheduling considering preferences of professors. Axioms, 12(5), 498. https:\/\/doi.org\/10.3390\/axioms12050498","journal-title":"Axioms"},{"key":"6242_CR8","doi-asserted-by":"publisher","first-page":"106515","DOI":"10.1109\/ACCESS.2021.3100613","volume":"9","author":"MC Chen","year":"2021","unstructured":"Chen, M. C., Sze, S. N., Goh, S. L., Sabar, N. R., & Kendall, G. (2021). A survey of university course timetabling problem: Perspectives, trends and opportunities. IEEE Access, 9, 106515\u2013106529. https:\/\/doi.org\/10.1109\/ACCESS.2021.3100613","journal-title":"IEEE Access"},{"issue":"5","key":"6242_CR9","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1007\/s11590-020-01588-x","volume":"15","author":"G Colajanni","year":"2021","unstructured":"Colajanni, G., & Daniele, P. (2021). A new model for curriculum-based university course timetabling. Optimization Letters, 15(5), 1601\u20131616. https:\/\/doi.org\/10.1007\/s11590-020-01588-x","journal-title":"Optimization Letters"},{"issue":"1","key":"6242_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0377-2217(03)00103-6","volume":"153","author":"S Daskalaki","year":"2004","unstructured":"Daskalaki, S., Birbas, T., & Housos, E. (2004). An integer programming formulation for a case study in university timetabling. European Journal of Operational Research, 153(1), 117\u2013135. https:\/\/doi.org\/10.1016\/S0377-2217(03)00103-6","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6242_CR11","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. https:\/\/doi.org\/10.1016\/j.ejor.2019.11.024","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"6242_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10479-019-03382-0","volume":"302","author":"B Herres","year":"2021","unstructured":"Herres, B., & Schmitz, H. (2021). Decomposition of university course timetabling. Annals of Operations Research, 302(2), 405\u2013423. https:\/\/doi.org\/10.1007\/s10479-019-03382-0","journal-title":"Annals of Operations Research"},{"key":"6242_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.eswa.2018.12.048","volume":"122","author":"N Leite","year":"2019","unstructured":"Leite, N., Mel\u00edcio, F., & Rosa, A. C. (2019). A fast simulated annealing algorithm for the examination timetabling problem. Expert Systems with Applications, 122, 137\u2013151. https:\/\/doi.org\/10.1016\/j.eswa.2018.12.048","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"6242_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10951-020-00666-3","volume":"24","author":"A Lemos","year":"2021","unstructured":"Lemos, A., Monteiro, P. T., & Lynce, I. (2021). Disruptions in timetables: A case study at universidade de lisboa. Journal of Scheduling, 24(1), 35\u201348. https:\/\/doi.org\/10.1007\/s10951-020-00666-3","journal-title":"Journal of Scheduling"},{"issue":"3","key":"6242_CR15","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TEVC.2006.885162","volume":"11","author":"R Lewis","year":"2007","unstructured":"Lewis, R., & Paechter, B. (2007). Finding feasible timetables using group-based operators. IEEE Transactions on Evolutionary Computation, 11(3), 397\u2013413. https:\/\/doi.org\/10.1109\/TEVC.2006.885162","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"6242_CR16","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10462-011-9262-6","volume":"39","author":"SA MirHassani","year":"2013","unstructured":"MirHassani, S. A., & Habibi, F. (2013). Solution approaches to the course timetabling problem. Artificial Intelligence Review, 39(2), 133\u2013149. https:\/\/doi.org\/10.1007\/s10462-011-9262-6","journal-title":"Artificial Intelligence Review"},{"key":"6242_CR17","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.procs.2019.11.169","volume":"161","author":"A Muklason","year":"2019","unstructured":"Muklason, A., Irianti, R. G., & Marom, A. (2019). Automated course timetabling optimization using Tabu-variable neighborhood search based hyper-heuristic algorithm. Procedia Computer Science, 161, 656\u2013664. https:\/\/doi.org\/10.1016\/j.procs.2019.11.169","journal-title":"Procedia Computer Science"},{"key":"6242_CR18","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.asoc.2018.04.034","volume":"68","author":"T Song","year":"2018","unstructured":"Song, T., Liu, S., Tang, X., Peng, X., & Chen, M. (2018). An iterated local search algorithm for the university course timetabling problem. Applied Soft Computing, 68, 597\u2013608. https:\/\/doi.org\/10.1016\/j.asoc.2018.04.034","journal-title":"Applied Soft Computing"},{"key":"6242_CR19","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.cie.2019.02.050","volume":"130","author":"Peyman Yasari","year":"2019","unstructured":"Yasari, Peyman, Ranjbar, Mohammad, Jamili, Negin, & Shaelaie, Mohammad-Hesam. (2019). A two-stage stochastic programming approach for a multi-objective course timetabling problem with courses cancelation risk. Computers & Industrial Engineering, 130, 650\u2013660. https:\/\/doi.org\/10.1016\/j.cie.2019.02.050","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"6242_CR20","doi-asserted-by":"publisher","first-page":"82","DOI":"10.11113\/mjfas.v18n1.2408","volume":"18","author":"ZM Zaulir","year":"2022","unstructured":"Zaulir, Z. M., Aziz, N. L. A., & Aizam, N. A. H. (2022). A general mathematical model for university courses timetabling: Implementation to a public university in Malaysia. Malaysian Journal of Fundamental and Applied Sciences, 18(1), 82\u201394. https:\/\/doi.org\/10.11113\/mjfas.v18n1.2408","journal-title":"Malaysian Journal of Fundamental and Applied Sciences"},{"issue":"3","key":"6242_CR21","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.ejor.2009.09.014","volume":"203","author":"D Zhang","year":"2010","unstructured":"Zhang, D., Liu, Y., M\u2019Hallah, R., & Leung, S. C. (2010). A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems. European Journal of Operational Research, 203(3), 550\u2013558. https:\/\/doi.org\/10.1016\/j.ejor.2009.09.014","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06242-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06242-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06242-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T11:04:09Z","timestamp":1772622249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06242-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["6242"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06242-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"30 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}