{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:13:58Z","timestamp":1779380038558,"version":"3.53.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T00:00:00Z","timestamp":1718928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T00:00:00Z","timestamp":1718928000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009057","name":"University of Graz","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009057","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We consider a complex university timetabling problem arising in a four-year study program of teacher education where every student has to choose two subjects. Since any combination of two subjects is feasible, the goal of designing a collision-free timetable for every student seems to be unreachable. However, the task becomes more tractable because parallel groups are offered for most courses, i.e. sectioning of students takes place. Difficulties arise from the individual progress of students who often follow neither the prescribed term of each course nor the prescribed ordering of courses. Under these and other conditions, an optimized timetable can be determined by a multi-stage process, adjusted to the estimated student numbers and their past achievements. Some of the features encountered in this planning task were also part of the well-known ITC-2019 timetabling competition, while others constitute new aspects. After moving main lectures into a regular time grid with minimal changes concerning the previously existing plan, the task of finding a timetable for all lectures with parallel groups is modeled as an integer linear program. At a later time, students with their actual demands are allocated a non-overlapping set of courses that is relevant and feasible for their individual study situation. Besides the maximization of allocated courses, a fairness criterion is also invoked at this stage. Since both optimization tasks are prone to infeasibility, we introduce features to resolve this issue in practice.<\/jats:p>","DOI":"10.1007\/s10100-024-00923-2","type":"journal-article","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T09:02:27Z","timestamp":1718960547000},"page":"277-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Curriculum-based university course timetabling considering individual course of studies"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1428-0451","authenticated-orcid":false,"given":"Elmar","family":"Steiner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ulrich","family":"Pferschy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,21]]},"reference":[{"issue":"1","key":"923_CR1","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 JA (1989) A large scale timetabling problem. Comput Oper Res 16(1):67\u201377","journal-title":"Comput Oper Res"},{"issue":"2","key":"923_CR2","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.ejor.2018.06.042","volume":"272","author":"N-CF Bagger","year":"2019","unstructured":"Bagger N-CF, S\u00f8rensen M, Stidsen TR (2019) Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling. Eur J Oper Res 272(2):430\u2013446","journal-title":"Eur J Oper Res"},{"key":"923_CR3","doi-asserted-by":"crossref","unstructured":"Banks D, van Beek P, Meisels A (1998) A heuristic incremental modeling approach to course timetabling. In: Carbonell, J.G.E.A. (ed.) Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol. 1418. Springer, Heidelberg, pp 16\u201329","DOI":"10.1007\/3-540-64575-6_37"},{"key":"923_CR4","unstructured":"Brown G, Graves G (1975) Elastic programming: a new approach to large-scale mixed integer optimization. In: ORSA\/TIMS Conference, Las Vegas"},{"key":"923_CR5","first-page":"3","volume-title":"The Practice and theory of automated timetabling II Lecture Notes in Computer Science","author":"MW Carter","year":"1998","unstructured":"Carter MW, Laporte G (1998) Recent developments in practical course timetabling. The Practice and theory of automated timetabling II Lecture Notes in Computer Science, vol 1408. Springer, Heidelberg, pp 3\u201319"},{"issue":"1","key":"923_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2022.07.011","volume":"308","author":"S Ceschia","year":"2023","unstructured":"Ceschia S, Di Gaspero L, Schaerf A (2023) Educational timetabling: problems, benchmarks, and state-of-the-art results. Eur J Oper Res 308(1):1\u201318","journal-title":"Eur J Oper Res"},{"key":"923_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0377-2217(94)90152-X","volume":"73","author":"N Chakravarti","year":"1994","unstructured":"Chakravarti N (1994) Some results concerning post-infeasibility analysis. Eur J Oper Res 73:139\u2013143","journal-title":"Eur J Oper Res"},{"key":"923_CR8","volume-title":"Feasibility and infeasibility in optimization. Algorithms and computational methods","author":"JW Chinneck","year":"2008","unstructured":"Chinneck JW (2008) Feasibility and infeasibility in optimization. Algorithms and computational methods. Springer, New York"},{"key":"923_CR9","doi-asserted-by":"publisher","DOI":"10.1287\/inte.2022.0083","author":"IT Christou","year":"2024","unstructured":"Christou IT, Vagianou E, Vardoulias G (2024) Planning courses for student success at the American college of Greece. INFORMS J Appl Anal. https:\/\/doi.org\/10.1287\/inte.2022.0083","journal-title":"INFORMS J Appl Anal"},{"issue":"3","key":"923_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10951-015-0424-2","volume":"19","author":"M Dostert","year":"2016","unstructured":"Dostert M, Politz A, Schmitz H (2016) A complexity analysis and an algorithmic approach to student sectioning in existing timetables. J Sched 19(3):285\u2013293","journal-title":"J Sched"},{"key":"923_CR11","doi-asserted-by":"crossref","unstructured":"Ehrgott M, Ryan DM (2003) The method of elastic constraints for multiobjective combinatorial optimization and its application in airline crew scheduling. In: Multi-objective programming and goal programming. Springer, Berlin, Heidelberg, pp 117\u2013122","DOI":"10.1007\/978-3-540-36510-5_14"},{"issue":"3","key":"923_CR12","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1016\/j.ejor.2021.10.014","volume":"300","author":"R Esmaeilbeigi","year":"2021","unstructured":"Esmaeilbeigi R, Mak-Hau V, Yearwood J, Nguyen V (2021) The multiphase course timetabling problem. Eur J Oper Res 300(3):1098\u20131119","journal-title":"Eur J Oper Res"},{"key":"923_CR13","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10951-022-00724-y","volume":"25","author":"DS Holm","year":"2022","unstructured":"Holm DS, Mikkelsen R\u00d8, S\u00f8rensen M, Stidsen TJ (2022) A graph-based MIP formulation of the international timetabling competition 2019. J Sched 25:405\u2013428","journal-title":"J Sched"},{"issue":"3","key":"923_CR14","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.ejor.2014.10.043","volume":"243","author":"J Johnes","year":"2015","unstructured":"Johnes J (2015) Operational research in education. Eur J Oper Res 243(3):683\u2013696","journal-title":"Eur J Oper Res"},{"issue":"1","key":"923_CR15","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 ME (2012) Curriculum based course timetabling: new solutions to Udine benchmark instances. Ann Oper Res 194(1):255\u2013272","journal-title":"Ann Oper Res"},{"issue":"1","key":"923_CR27","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10951-020-00641-y","volume":"24","author":"F La Rosa-Rivera","year":"2021","unstructured":"La Rosa-Rivera F, Nunez-Varela JI, Puente-Montejano CA, Nava-Mu\u00f1oz SE (2021) Measuring the complexity of university timetabling instances. J Sched 24(1):103\u2013121","journal-title":"J Sched"},{"issue":"2","key":"923_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0165-0114(00)00010-5","volume":"122","author":"T Le\u00f3n","year":"2001","unstructured":"Le\u00f3n T, Liern V (2001) A fuzzy method to repair infeasibility in linearly constrained problems. Fuzzy Sets Syst 122(2):237\u2013243","journal-title":"Fuzzy Sets Syst"},{"key":"923_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-12799-6","volume-title":"Fairness in academic course timetabling","author":"M M\u00fchlenthaler","year":"2015","unstructured":"M\u00fchlenthaler M (2015) Fairness in academic course timetabling. Springer Lecture Notes in Economics and Mathematical Systems, USA, pp 75\u2013105"},{"key":"923_CR18","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10479-014-1553-2","volume":"239","author":"M M\u00fchlenthaler","year":"2016","unstructured":"M\u00fchlenthaler M, Wanka R (2016) Fairness in academic course timetabling. Ann Oper Res 239:171\u2013188","journal-title":"Ann Oper Res"},{"issue":"1","key":"923_CR19","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. Ann Oper Res 181(1):249\u2013269","journal-title":"Ann Oper Res"},{"issue":"1","key":"923_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10479-014-1643-1","volume":"239","author":"T M\u00fcller","year":"2016","unstructured":"M\u00fcller T, Rudov\u00e1 H (2016) Real-life curriculum-based timetabling with elective courses and course sections. Ann Oper Res 239(1):153\u2013170","journal-title":"Ann Oper Res"},{"key":"923_CR21","doi-asserted-by":"crossref","unstructured":"M\u00fcller T, Rudov\u00e1 H, Bart\u00e1k R (2005) Minimal perturbation problem in course timetabling. In: Burke E, Trick M (Eds.) Practice and Theory of Automated Timetabling V. Lecture Notes in Computer Science, Springer, Heidelberg, vol. 3616, pp 126\u2013146.","DOI":"10.1007\/11593577_8"},{"key":"923_CR22","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-2018), pp 5\u201331"},{"key":"923_CR23","unstructured":"M\u00fcller T (2022) ITC 2019: results using the UniTime solver. In: Proceedings of the 13th international conference on the practice and theory of automated timetabling (PATAT), Vol. 3, pp 243\u2013247"},{"issue":"2","key":"923_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10479-015-2094-z","volume":"252","author":"AE Phillips","year":"2017","unstructured":"Phillips AE, Walker CG, Ehrgott M, Ryan DM (2017) Integer programming for minimal perturbation problems in university course timetabling. Ann Oper Res 252(2):283\u2013304","journal-title":"Ann Oper Res"},{"key":"923_CR25","doi-asserted-by":"crossref","unstructured":"Polinder G-J, Kroon L, Aardal K, Schmidt M, Molinaro M (2018) Resolving infeasibilities in railway timetabling instances. technical report, available at SSRN: https:\/\/ssrn.com\/abstract=3106739","DOI":"10.2139\/ssrn.3106739"},{"issue":"9","key":"923_CR26","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1287\/mnsc.25.9.916","volume":"25","author":"GM Roodman","year":"1979","unstructured":"Roodman GM (1979) Post-infeasibility analysis in linear programming. Manage Sci 25(9):916\u2013922","journal-title":"Manage Sci"},{"key":"923_CR28","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. J Sched 14:187\u2013207","journal-title":"J Sched"},{"issue":"3","key":"923_CR29","first-page":"283","volume":"2","author":"M Safi","year":"2012","unstructured":"Safi M, Marzooni H (2012) Diagnosis and resolution of infeasibility in the constraint method for solving multi objective linear programming problems. Am J Oper Res 2(3):283\u2013288","journal-title":"Am J Oper Res"},{"issue":"2","key":"923_CR30","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. Artif Intell Rev 13(2):87\u2013127","journal-title":"Artif Intell Rev"},{"issue":"1","key":"923_CR31","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. Ann Oper Res 275(1):209\u2013221","journal-title":"Ann Oper Res"},{"key":"923_CR32","unstructured":"Steiner E, Pferschy U, Schaerf A (2022) Three-phase curriculum based university course timetabling. In: Proceedings of the 13th international conference on the practice and theory of automated timetabling (PATAT), Vol. 3, pp 163\u2013181"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00923-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10100-024-00923-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-024-00923-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T16:33:58Z","timestamp":1737218038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10100-024-00923-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,21]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["923"],"URL":"https:\/\/doi.org\/10.1007\/s10100-024-00923-2","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,21]]},"assertion":[{"value":"2 June 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2024","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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}