{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:35:58Z","timestamp":1774946158864,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T00:00:00Z","timestamp":1680825600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T00:00:00Z","timestamp":1680825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Karlsruher Institut f\u00fcr Technologie (KIT)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Course timetables are the organizational foundation of a university\u2019s educational program. While students and lecturers perceive timetable quality individually according to their preferences, there are also collective criteria derived normatively such as balanced workloads or idle time avoidance. A recent challenge and opportunity in curriculum-based timetabling consists of customizing timetables with respect to individual student preferences and with respect to integrating online courses as part of modern course programs or in reaction to flexibility requirements as posed in pandemic situations. Curricula consisting of (large) lectures and (small) tutorials further open the possibility for optimizing not only the lecture and tutorial plan for all students but also the assignments of individual students to tutorial slots. In this paper, we develop a multi-level planning process for university timetabling: On the tactical level, a lecture and tutorial plan is determined for a set of study programs; on the operational level, individual timetables are generated for each student interlacing the lecture plan through a selection of tutorials from the tutorial plan favoring individual preferences. We utilize this mathematical-programming-based planning process as part of a matheuristic which implements a genetic algorithm in order to improve lecture plans, tutorial plans, and individual timetables so as to find an overall university program with well-balanced timetable performance criteria. Since the evaluation of the fitness function amounts to invoking the entire planning process, we additionally provide a proxy in the form of an artificial neural network metamodel. Computational results exhibit the procedure\u2019s capability of generating high quality schedules.<\/jats:p>","DOI":"10.1007\/s10479-023-05325-2","type":"journal-article","created":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T05:02:29Z","timestamp":1680843749000},"page":"1313-1348","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A matheuristic for customized multi-level multi-criteria university timetabling"],"prefix":"10.1007","volume":"328","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4805-9576","authenticated-orcid":false,"given":"Fabian","family":"Dunke","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Nickel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,7]]},"reference":[{"key":"5325_CR1","doi-asserted-by":"crossref","unstructured":"Abdullah, S. , Turabieh, H. , McCollum, B. , & McMullan, P. (2010). A multi-objective post enrolment course timetabling problem: A new case study. In Proceedings of the 2010 IEEE congress on evolutionary computation (pp. 1\u20137).","DOI":"10.1109\/CEC.2010.5586227"},{"key":"5325_CR2","doi-asserted-by":"crossref","unstructured":"Akkan, C. , & G\u00fclc\u00fc, A. (2018). A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem. Computers and Operations Research, 9022\u20139032.","DOI":"10.1016\/j.cor.2017.09.007"},{"issue":"4","key":"5325_CR3","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10951-022-00722-0","volume":"25","author":"C Akkan","year":"2022","unstructured":"Akkan, C., G\u00fclc\u00fc, A., & Ku\u015f, Z. (2022). Bi-criteria simulated annealing for the curriculum-based course timetabling problem with robustness approximation. Journal of Scheduling, 25(4), 477\u2013501.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"5325_CR4","doi-asserted-by":"publisher","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 and Operations Research, 16(1), 67\u201377.","journal-title":"Computers and Operations Research"},{"key":"5325_CR5","doi-asserted-by":"crossref","unstructured":"Babaei, H. , Karimpour, J. , & Hadidi, A. (2015). A survey of approaches for university course timetabling problem. Computers and Industrial Engineering, 8643\u20138659.","DOI":"10.1016\/j.cie.2014.11.010"},{"key":"5325_CR6","doi-asserted-by":"crossref","unstructured":"Banks, D. , Beek, P. V. , & Meisels, A. (1998). A heuristic incremental modeling approach to course timetabling, pp. 16\u201329.","DOI":"10.1007\/3-540-64575-6_37"},{"issue":"2","key":"5325_CR7","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1287\/msom.2021.0996","volume":"24","author":"C Barnhart","year":"2022","unstructured":"Barnhart, C., Bertsimas, D., Delarue, A., & Yan, J. (2022). Course scheduling under sudden scarcity: Applications to pandemic planning. Manufacturing and Service Operations Management, 24(2), 727\u2013745.","journal-title":"Manufacturing and Service Operations Management"},{"key":"5325_CR8","doi-asserted-by":"crossref","unstructured":"Bettinelli, A. , Cacchiani, V. , Roberti, R. , & Toth, P. (2015). An overview of curriculum-based course timetabling. TOP, 23(2), 313\u2013349.","DOI":"10.1007\/s11750-015-0366-z"},{"issue":"6","key":"5325_CR9","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1287\/inte.2021.1083","volume":"51","author":"RA Bowman","year":"2021","unstructured":"Bowman, R. A. (2021). Developing optimal student plans of study. INFORMS Journal on Applied Analytics, 51(6), 409\u2013421.","journal-title":"INFORMS Journal on Applied Analytics"},{"issue":"9","key":"5325_CR10","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1093\/comjnl\/40.9.565","volume":"40","author":"EK Burke","year":"1997","unstructured":"Burke, E. K., Jackson, K., Kingston, J. H., & Weare, R. (1997). Automated university timetabling: The state of the art. The Computer Journal, 40(9), 565\u2013571.","journal-title":"The Computer Journal"},{"issue":"3","key":"5325_CR11","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., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2010). Decomposition, reformulation, and diving in university course timetabling. Computers and Operations Research, 37(3), 582\u2013597.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"5325_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"EK Burke","year":"2002","unstructured":"Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2), 266\u2013280.","journal-title":"European Journal of Operational Research"},{"key":"5325_CR13","doi-asserted-by":"crossref","unstructured":"Burke, E. K. , Silva, J. , & Soubeiga, E. (2005). Multi-objective hyper-heuristic approaches for space allocation and timetabling. In Metaheuristics: Progress as real problem solvers (pp. 129\u2013158). Springer.","DOI":"10.1007\/0-387-25383-1_6"},{"issue":"1","key":"5325_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-010-0737-7","volume":"194","author":"H Cambazard","year":"2012","unstructured":"Cambazard, H., Hebrard, E., O\u2019Sullivan, B., & Papadopoulos, A. (2012). Local search and constraint programming for the post enrolment-based course timetabling problem. Annals of Operations Research, 194(1), 111\u2013135.","journal-title":"Annals of Operations Research"},{"key":"5325_CR15","doi-asserted-by":"crossref","unstructured":"Carrasco, M. P. , & Pato, M. V. (2000). A multiobjective genetic algorithm for the class\/teacher timetabling problem. In Proceedings of the 3rd international conference on the practice and theory of automated timetabling, pp. 3\u201317.","DOI":"10.1007\/3-540-44629-X_1"},{"key":"5325_CR16","doi-asserted-by":"crossref","unstructured":"Carter, M. W. (2000). A comprehensive course timetabling and student scheduling system at the University of Waterloo. In International conference on the practice and theory of automated timetabling, pp. 64\u201382.","DOI":"10.1007\/3-540-44629-X_5"},{"key":"5325_CR17","doi-asserted-by":"crossref","unstructured":"Carter, M. W. , & Laporte, G. (1997). Recent developments in practical course timetabling. In Proceedings of the 2nd international conference on the practice and theory of automated timetabling, pp. 3\u201319.","DOI":"10.1007\/BFb0055878"},{"issue":"7","key":"5325_CR18","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1016\/j.cor.2011.09.014","volume":"39","author":"S Ceschia","year":"2012","unstructured":"Ceschia, S., Di Gaspero, L., & Schaerf, A. (2012). Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem. Computers and Operations Research, 39(7), 1615\u20131624.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"5325_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ejor.2003.06.023","volume":"160","author":"S Daskalaki","year":"2005","unstructured":"Daskalaki, S., & Birbas, T. (2005). Efficient solutions for a university timetabling problem through integer programming. European Journal of Operational Research, 160(1), 106\u2013120.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5325_CR20","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.","journal-title":"European Journal of Operational Research"},{"key":"5325_CR21","doi-asserted-by":"crossref","unstructured":"Datta, D. , Deb, K. , & Fonseca, C. M. (2007). Multi-objective evolutionary algorithm for university class timetabling problem. In Evolutionary scheduling (pp. 197\u2013236). Springer.","DOI":"10.1007\/978-3-540-48584-1_8"},{"issue":"6","key":"5325_CR22","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10951-008-0073-9","volume":"11","author":"D Datta","year":"2008","unstructured":"Datta, D., Fonseca, C. M., & Deb, K. (2008). A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems. Journal of Scheduling, 11(6), 405\u2013419.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"5325_CR23","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: Nsga-II. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"5325_CR24","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ejor.2008.01.043","volume":"195","author":"P De Causmaecker","year":"2009","unstructured":"De Causmaecker, P., Demeester, P., & Berghe, G. V. (2009). A decomposed 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"},{"issue":"2","key":"5325_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D de Werra","year":"1985","unstructured":"de Werra, D. (1985). An introduction to timetabling. European Journal of Operational Research, 19(2), 151\u2013162.","journal-title":"European Journal of Operational Research"},{"key":"5325_CR26","unstructured":"Di\u00a0Gaspero, L. , McCollum, B. , & Schaerf, A. (2007). The second International Timetabling Competition (ITC-2007): Curriculum-based course timetabling (track 3) (Tech. Rep.). Udine, Italy: DIEGM, University of Udine."},{"issue":"2","key":"5325_CR27","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0305-0548(85)90045-0","volume":"12","author":"JA Ferland","year":"1985","unstructured":"Ferland, J. A., & Roy, S. (1985). Timetabling problem for university as assignment of activities to resources. Computers and Operations Research, 12(2), 207\u2013218.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"5325_CR28","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2017.01.040","volume":"261","author":"SL Goh","year":"2017","unstructured":"Goh, S. L., Kendall, G., & Sabar, N. R. (2017). Improved local search approaches to solve the post-enrolment course timetabling problem. European Journal of Operational Research, 261(1), 17\u201329.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"5325_CR29","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1080\/01605682.2018.1468862","volume":"70","author":"SL Goh","year":"2019","unstructured":"Goh, S. L., Kendall, G., & Sabar, N. R. (2019). Simulated annealing with improved reheating and learning for the post enrolment course timetabling problem. Journal of the Operational Research Society, 70(6), 873\u2013888.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"5325_CR30","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1007\/s12597-020-00444-x","volume":"57","author":"SL Goh","year":"2020","unstructured":"Goh, S. L., Kendall, G., Sabar, N. R., & Abdullah, S. (2020). An effective hybrid local search approach for the post-enrolment course timetabling problem. Opsearch, 57(4), 1131\u20131163.","journal-title":"Opsearch"},{"issue":"4","key":"5325_CR31","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10951-022-00724-y","volume":"25","author":"D Holm","year":"2022","unstructured":"Holm, D., Mikkelsen, R., S\u00f8rensen, M., & Stidsen, T. (2022). A graph-based MIP formulation of the International Timetabling Competition 2019. Journal of Scheduling, 25(4), 405\u2013428.","journal-title":"Journal of Scheduling"},{"key":"5325_CR32","doi-asserted-by":"crossref","unstructured":"Hoshino, R. , & Fabris, I. (2020). Optimizing student course preferences in school timetabling. In Proceedings of the 17th international conference on integration of constraint programming, artificial intelligence, and operations research, pp. 283\u2013299.","DOI":"10.1007\/978-3-030-58942-4_19"},{"issue":"3","key":"5325_CR33","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10878-012-9521-8","volume":"27","author":"G Jaradat","year":"2014","unstructured":"Jaradat, G., Ayob, M., & Ahmad, Z. (2014). On the performance of scatter search for post-enrolment course timetabling problems. Journal of Combinatorial Optimization, 27(3), 417\u2013439.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"6","key":"5325_CR34","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10951-010-0202-0","volume":"14","author":"SN Jat","year":"2011","unstructured":"Jat, S. N., & Yang, S. (2011). A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling. Journal of Scheduling, 14(6), 617\u2013637.","journal-title":"Journal of Scheduling"},{"key":"5325_CR35","doi-asserted-by":"crossref","unstructured":"Jat, S. N. , & Yang, S. (2011). A guided search non-dominated sorting genetic algorithm for the multi-objective university course timetabling problem. In Proceedings of the 11th European conference on evolutionary computation in combinatorial optimization (pp. 1\u201313). Springer.","DOI":"10.1007\/978-3-642-20364-0_1"},{"issue":"1","key":"5325_CR36","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-010-0700-7","volume":"194","author":"G Lach","year":"2012","unstructured":"Lach, G., & L\u00fcbbecke, M. E. (2012). Curriculum-based course timetabling: New solutions to Udine benchmark instances. Annals of Operations Research, 194(1), 255\u2013272.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"5325_CR37","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10951-021-00695-6","volume":"25","author":"A Lemos","year":"2022","unstructured":"Lemos, A., Monteiro, P., & Lynce, I. (2022). Introducing UniCorT: An iterative university course timetabling tool with MaxSAT. Journal of Scheduling, 25(4), 371\u2013390.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"5325_CR38","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R Lewis","year":"2008","unstructured":"Lewis, R. (2008). A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum, 30(1), 167\u2013190.","journal-title":"OR Spectrum"},{"issue":"1","key":"5325_CR39","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10479-010-0696-z","volume":"194","author":"R Lewis","year":"2012","unstructured":"Lewis, R. (2012). A time-dependent metaheuristic algorithm for post enrolment-based course timetabling. Annals of Operations Research, 194(1), 273\u2013289.","journal-title":"Annals of Operations Research"},{"key":"5325_CR40","unstructured":"Lindahl, M., Stidsen, T., S\u00f8rensen, M. (2017). Strategic, tactical and operational university timetabling. DTU Management. Retreived from: https:\/\/orbit.dtu.dk\/en\/publications\/strategic-tactical-and-operational-university-timetabling."},{"key":"5325_CR41","doi-asserted-by":"crossref","unstructured":"Lohpetch, D. , & Jaengchuea, S. (2016). A hybrid multi-objective genetic algorithm with a new local search approach for solving the post enrolment based course timetabling problem. In Recent advances in information and communication technology 2016 (pp. 195\u2013206). Springer.","DOI":"10.1007\/978-3-319-40415-8_19"},{"issue":"1","key":"5325_CR42","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., & Hao, J.-K. (2010). Adaptive tabu search for course timetabling. European Journal of Operational Research, 200(1), 235\u2013244.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5325_CR43","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10732-010-9128-0","volume":"17","author":"Z L\u00fc","year":"2011","unstructured":"L\u00fc, Z., Hao, J.-K., & Glover, F. (2011). Neighborhood analysis: A case study on curriculum-based course timetabling. Journal of Heuristics, 17(2), 97\u2013118.","journal-title":"Journal of Heuristics"},{"key":"5325_CR44","doi-asserted-by":"crossref","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., Burke, & E. K. (2010). Setting the research agenda in automated timetabling: The second International Timetabling Competition. INFORMS Journal on Computing, 22(1), 120\u2013130.","DOI":"10.1287\/ijoc.1090.0320"},{"key":"5325_CR45","doi-asserted-by":"crossref","unstructured":"M\u00e9ndez-D\u00edaz, I. , Zabala, P. , & Miranda-Bront, J. J. (2016). An ILP based heuristic for a generalization of the post-enrollment course timetabling problem. Computers and Operations Research, 76195\u201376207.","DOI":"10.1016\/j.cor.2016.06.018"},{"issue":"4","key":"5325_CR46","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10951-022-00728-8","volume":"25","author":"R Mikkelsen","year":"2022","unstructured":"Mikkelsen, R., & Holm, D. (2022). A parallelized matheuristic for the International Timetabling Competition 2019. Journal of Scheduling, 25(4), 429\u2013452.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"5325_CR47","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.","journal-title":"Artificial Intelligence Review"},{"issue":"1","key":"5325_CR48","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10479-010-0735-9","volume":"181","author":"T M\u00fcller","year":"2010","unstructured":"M\u00fcller, T., & Murray, K. (2010). Comprehensive approach to student sectioning. Annals of Operations Research, 181(1), 249\u2013269.","journal-title":"Annals of Operations Research"},{"key":"5325_CR49","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 (vol.\u00a01, pp. 5\u201331)."},{"key":"5325_CR50","unstructured":"M\u00fcller, T. , Rudov\u00e1, H. , & M\u00fcllerov\u00e1, Z. (2022). Real-world university course timetabling at the International Timetabling Competition 2019. In Proceedings of the 13th international conference on the practice and theory of automated timetabling, (vol. 3, pp. 234\u2013238)."},{"issue":"1","key":"5325_CR51","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10479-012-1078-5","volume":"194","author":"C Nothegger","year":"2012","unstructured":"Nothegger, C., Mayer, A., Chwatal, A., & Raidl, G. R. (2012). Solving the post enrolment course timetabling problem by ant colony optimization. Annals of Operations Research, 194(1), 325\u2013339.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"5325_CR52","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-014-1688-1","volume":"239","author":"N Pillay","year":"2016","unstructured":"Pillay, N. (2016). A review of hyper-heuristics for educational timetabling. Annals of Operations Research, 239(1), 3\u201338.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"5325_CR53","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.ijpe.2007.07.009","volume":"112","author":"P Pongcharoen","year":"2008","unstructured":"Pongcharoen, P., Promtet, W., Yenradee, P., & Hicks, C. (2008). Stochastic optimisation timetabling tool for university course scheduling. International Journal of Production Economics, 112(2), 903\u2013918.","journal-title":"International Journal of Production Economics"},{"issue":"4","key":"5325_CR54","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10951-021-00715-5","volume":"25","author":"E Rappos","year":"2022","unstructured":"Rappos, E., Thi\u00e9mard, E., Robert, S., & H\u00eache, J.-F. (2022). A mixed-integer programming approach for solving university course timetabling problems. Journal of Scheduling, 25(4), 391\u2013404.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"5325_CR55","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. (2011). Complex university course timetabling. Journal of Scheduling, 14(2), 187\u2013207.","journal-title":"Journal of Scheduling"},{"key":"5325_CR56","doi-asserted-by":"crossref","unstructured":"Rudov\u00e1, H. , & Murray, K. (2002). University course timetabling with soft constraints. In Proceedings of the 4th international conference on the practice and theory of automated timetabling, pp. 310\u2013328.","DOI":"10.1007\/978-3-540-45157-0_21"},{"issue":"2","key":"5325_CR57","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"issue":"4","key":"5325_CR58","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s00291-006-0074-z","volume":"29","author":"K Schimmelpfeng","year":"2007","unstructured":"Schimmelpfeng, K., & Helber, 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"},{"key":"5325_CR59","doi-asserted-by":"crossref","unstructured":"Shiue, F.-J. , Zheng, M.-C. , Lee, H.-Y. , Khitam, A. F. , & Li, P.-Y. (2019). Renovation construction process scheduling for long-term performance of buildings: An application case of university campus. Sustainability, 11(19), 5542.","DOI":"10.3390\/su11195542"},{"key":"5325_CR60","doi-asserted-by":"crossref","unstructured":"Silva, J. , Burke, E. K. , & Petrovic, S. (2004). An introduction to multiobjective metaheuristics for scheduling and timetabling. In Metaheuristics for multiobjective optimisation (pp. 91\u2013129). Springer.","DOI":"10.1007\/978-3-642-17144-4_4"},{"key":"5325_CR61","doi-asserted-by":"crossref","unstructured":"Suyanto, S. (2010). An informed genetic algorithm for university course and student timetabling problems. In Proceedings of the 10th international conference on artifical intelligence and soft computing: Part II (pp. 229\u2013236).","DOI":"10.1007\/978-3-642-13232-2_28"},{"key":"5325_CR62","doi-asserted-by":"crossref","unstructured":"Sylejmani, K. , Gashi, E. , & Ymeri, A. (2022). Simulated annealing with penalization for university course timetabling. In Proceedings of the 13th international conference on the practice and theory of automated timetabling, (vol. 2, pp. 2361\u2013366).","DOI":"10.1007\/s10951-022-00747-5"},{"issue":"1","key":"5325_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10462-013-9399-6","volume":"44","author":"CK Teoh","year":"2015","unstructured":"Teoh, C. K., Wibowo, A., & Ngadiman, M. S. (2015). Review of state of the art for metaheuristic techniques in academic scheduling problems. Artificial Intelligence Review, 44(1), 1\u201321.","journal-title":"Artificial Intelligence Review"},{"issue":"1","key":"5325_CR64","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10479-010-0708-z","volume":"194","author":"J Van den Broek","year":"2012","unstructured":"Van den Broek, J., & Hurkens, C. A. (2012). An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007. Annals of Operations Research, 194(1), 439\u2013454.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05325-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05325-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05325-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T16:17:18Z","timestamp":1692116238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05325-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,7]]},"references-count":64,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["5325"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05325-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,7]]},"assertion":[{"value":"21 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest which is relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}