{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,30]],"date-time":"2026-08-30T02:09:35Z","timestamp":1788055775207,"version":"build-2784847793"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T00:00:00Z","timestamp":1729382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T00:00:00Z","timestamp":1729382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/S022252\/1 STOR-i Centre for Doctoral Training"],"award-info":[{"award-number":["EP\/S022252\/1 STOR-i Centre for Doctoral Training"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The university course timetabling problem is a challenging problem to solve. As universities have evolved, the features of this problem have changed. One emerging feature is hybrid teaching where classes can be taught online, in-person or a combination of both in-person and online. This work presents a multi-objective binary programming model that includes common university timetabling features, identified from the literature, as well as hybrid teaching features. A lexicographic solution method is outlined and computational experiments using benchmark data are used to demonstrate the key aspects of the model and explore trade-offs among the objectives considered. The results of these experiments demonstrate that the model can be used to find demand-driven schedules for universities that include hybrid teaching. They also show how the model could be used to inform practitioners who are involved in strategic decision-making at universities.<\/jats:p>","DOI":"10.1007\/s10951-024-00817-w","type":"journal-article","created":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T14:01:44Z","timestamp":1729432904000},"page":"195-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Modelling and solving the university course timetabling problem with hybrid teaching considerations"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5686-9640","authenticated-orcid":false,"given":"Matthew","family":"Davison","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmed","family":"Kheiri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Konstantinos G.","family":"Zografos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,20]]},"reference":[{"issue":"3","key":"817_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.3934\/naco.2014.4.269","volume":"4","author":"NAH Aizam","year":"2014","unstructured":"Aizam, N. A. H., & Caccetta, L. (2014). Computational models for timetabling problem. Numerical Algebra, Control & Optimization, 4(3), 269\u2013285.","journal-title":"Numerical Algebra, Control & Optimization"},{"issue":"3","key":"817_CR2","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.ejor.2006.04.035","volume":"180","author":"SM Al-Yakoob","year":"2007","unstructured":"Al-Yakoob, S. M., & Sherali, H. D. (2007). A mixed-integer programming approach to a class timetabling problem: A case study with gender policies and traffic considerations. European Journal of Operational Research, 180(3), 1028\u20131044.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"817_CR3","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10951-005-4780-1","volume":"8","author":"P Avella","year":"2005","unstructured":"Avella, P., & Vasil\u2019Ev, I. (2005). A computational study of a cutting plane algorithm for university course timetabling. Journal of Scheduling, 8(6), 497\u2013514.","journal-title":"Journal of Scheduling"},{"key":"817_CR4","doi-asserted-by":"crossref","unstructured":"Aziz, N. L. A., & Aizam, N. A. H. (2018). A brief review on the features of university course timetabling problem. In AIP conference proceedings (Vol. 2016, no. 1).","DOI":"10.1063\/1.5055403"},{"key":"817_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.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"817_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/0377-2217(95)00204-9","volume":"94","author":"MA Badri","year":"1996","unstructured":"Badri, M. A. (1996). A two-stage multiobjective scheduling model for [faculty-course-time] assignments. European Journal of Operational Research, 94(1), 16\u201328.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"817_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 & Service Operations Management, 24(2), 727\u2013745.","journal-title":"Manufacturing & Service Operations Management"},{"issue":"8","key":"817_CR8","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1145\/355586.364824","volume":"7","author":"S Broder","year":"1964","unstructured":"Broder, S. (1964). Final examination scheduling. Communications of the ACM, 7(8), 494\u2013498.","journal-title":"Communications of the ACM"},{"issue":"1","key":"817_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-010-0828-5","volume":"194","author":"EK Burke","year":"2012","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2012). A branch-and-cut procedure for the Udine course timetabling problem. Annals of Operations Research, 194(1), 71\u201387.","journal-title":"Annals of Operations Research"},{"key":"817_CR10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-44629-X_5","volume-title":"Practice and theory of automated timetabling III","author":"MW Carter","year":"2001","unstructured":"Carter, M. W. (2001). A comprehensive course timetabling and student scheduling system at the university of waterloo. In E. Burke & W. Erben (Eds.), Practice and theory of automated timetabling III (pp. 64\u201382). Berlin: Springer."},{"key":"817_CR11","first-page":"100","volume":"2","author":"A Chaudhuri","year":"2010","unstructured":"Chaudhuri, A., & De, K. (2010). Fuzzy genetic heuristic for university course timetable problem. International Journal of Advances in Soft Computing and Its Applications, 2, 100\u2013123.","journal-title":"International Journal of Advances in Soft Computing and Its Applications"},{"key":"817_CR12","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.","journal-title":"IEEE Access"},{"key":"817_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-61794-9_66","volume-title":"Practice and theory of automated timetabling","author":"TB Cooper","year":"1996","unstructured":"Cooper, T. B., & Kingston, J. H. (1996). The complexity of timetable construction problems. In E. Burke & P. Ross (Eds.), Practice and theory of automated timetabling (pp. 281\u2013295). Berlin: Springer."},{"key":"817_CR14","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/s11518-008-5079-5","volume":"17","author":"A Dammak","year":"2008","unstructured":"Dammak, A., Elloumi, A., Kamoun, H., & Ferland, J. (2008). Course timetabling at a Tunisian university: A case study. Journal of Systems Science and Systems Engineering, 17, 334\u2013352.","journal-title":"Journal of Systems Science and Systems Engineering"},{"issue":"1","key":"817_CR15","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":"817_CR16","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":"817_CR17","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., & Vanden Berghe, G. (2009). A decomposed metaheuristic approach for a real-world university timetabling problem. European Journal of Operational Research, 195, 307\u2013318.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"817_CR18","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"},{"issue":"1","key":"817_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L Di Gaspero","year":"2006","unstructured":"Di Gaspero, L., & Schaerf, A. (2006). Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modelling and Algorithms, 5(1), 65\u201389.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"1","key":"817_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ejor.2017.03.020","volume":"262","author":"GHG Fonseca","year":"2017","unstructured":"Fonseca, G. H. G., Santos, H. G., Carrano, E. G., & Stidsen, T. J. R. (2017). Integer programming techniques for educational timetabling. European Journal of Operational Research, 262(1), 28\u201339.","journal-title":"European Journal of Operational Research"},{"key":"817_CR21","doi-asserted-by":"crossref","unstructured":"Gogos, C., Dimitsas, A., Valouxis, C., & Alefragis, P. (2022). Modeling a balanced commute educational timetabling problem in the context of teaching integer programming. In 7th South-East Europe design automation, computer engineering, computer networks and social media conference (SEEDA-CECNSM) (pp. 1\u20135).","DOI":"10.1109\/SEEDA-CECNSM57760.2022.9932912"},{"issue":"3","key":"817_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1287\/inte.2017.0935","volume":"48","author":"G Gonzalez","year":"2018","unstructured":"Gonzalez, G., Richards, C., & Newman, A. (2018). Optimal course scheduling for United States air force academy cadets. Interfaces, 48(3), 217\u2013234.","journal-title":"Interfaces"},{"key":"817_CR23","unstructured":"Holm, D.\u00a0S., Mikkelsen, R.\u00a0\u00d8., S\u00f8rensen, M., & Stidsen, T. J. R. (2020). A MIP formulation of the international timetabling competition 2019 problem. Technical University of Denmark."},{"issue":"4","key":"817_CR24","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10951-022-00724-y","volume":"25","author":"DS Holm","year":"2022","unstructured":"Holm, D. S., Mikkelsen, R. \u00d8., S\u00f8rensen, M., & Stidsen, T. J. R. (2022). A graph-based MIP formulation of the International Timetabling Competition 2019. Journal of Scheduling, 25(4), 405\u2013428.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"817_CR25","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"},{"key":"817_CR26","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/j.ejor.2014.07.041","volume":"240","author":"R Lewis","year":"2015","unstructured":"Lewis, R., & Thompson, J. (2015). Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem. European Journal of Operational Research, 240, 637\u2013648.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"817_CR27","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2017.09.022","volume":"266","author":"M Lindahl","year":"2018","unstructured":"Lindahl, M., Mason, A. J., Stidsen, T. J. R., & S\u00f8rensen, M. (2018). A strategic view of university timetabling. European Journal of Operational Research, 266(1), 35\u201345.","journal-title":"European Journal of Operational Research"},{"key":"817_CR28","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B Mccollum","year":"2010","unstructured":"Mccollum, B., McMullan, P., Paechter, B., Lewis, R., Schaerf, A., Di Gaspero, L., Parkes, A., Qu, R., & Burke, E. (2010). Setting the research agenda in automated timetabling: The second International Timetabling Competition. INFORMS Journal on Computing, 22, 120\u2013130.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"817_CR29","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10951-022-00728-8","volume":"25","author":"R\u00d8 Mikkelsen","year":"2022","unstructured":"Mikkelsen, R. \u00d8., & Holm, D. S. (2022). A parallelized matheuristic for the International Timetabling Competition 2019. Journal of Scheduling, 25(4), 429\u2013452.","journal-title":"Journal of Scheduling"},{"key":"817_CR30","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":"817_CR31","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.cor.2016.06.018","volume":"76","author":"I M\u00e9ndez-D\u00edaz","year":"2016","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 & Operations Research, 76, 195\u2013207.","journal-title":"Computers & Operations Research"},{"key":"817_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10479-013-1340-5","volume":"239","author":"G Post","year":"2013","unstructured":"Post, G., Di Gaspero, L., Kingston, J., Mccollum, B., & Schaerf, A. (2013). The third international timetabling competition. Annals of Operations Research, 239, 69\u201375.","journal-title":"Annals of Operations Research"},{"key":"817_CR33","doi-asserted-by":"crossref","unstructured":"Post, G., Kingston, J. H., Ahmadi, S., Daskalaki, S., Gogos, C., Kyngas, J., Nurmi, C., Musliu, N., Pillay, N., Santos, H., & Schaerf, A. (2014). XHSTT: An XML archive for high school timetabling problems in different countries. Annals of Operations Research, 218(1), 295\u2013301.","DOI":"10.1007\/s10479-011-1012-2"},{"issue":"2","key":"817_CR34","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"},{"issue":"1","key":"817_CR35","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10479-010-0709-y","volume":"194","author":"HG Santos","year":"2012","unstructured":"Santos, H. G., Uchoa, E., Ochi, L. S., & Maculan, N. (2012). Strong bounds with cut and column generation for class-teacher timetabling. Annals of Operations Research, 194(1), 399\u2013412.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"817_CR36","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":"817_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-070-4","volume-title":"The algorithm design manual","author":"SS Skiena","year":"2008","unstructured":"Skiena, S. S. (2008). The algorithm design manual (2nd ed.). New York: Springer.","edition":"2"},{"key":"817_CR38","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.cor.2013.08.025","volume":"43","author":"M S\u00f8rensen","year":"2014","unstructured":"S\u00f8rensen, M., & Dahms, F. H. W. (2014). A two-stage decomposition of high school timetabling applied to cases in Denmark. Computers & Operations Research, 43, 36\u201349.","journal-title":"Computers & Operations Research"},{"key":"817_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113943","volume":"165","author":"JS Tan","year":"2021","unstructured":"Tan, J. S., Goh, S. L., Kendall, G., & Sabar, N. R. (2021). A survey of the state-of-the-art of optimisation methodologies in school timetabling problems. Expert Systems with Applications, 165, 113943.","journal-title":"Expert Systems with Applications"},{"key":"817_CR40","unstructured":"UniTime. (2023). Universiy timetabling\u2014omprehensive academic scheduling solutions."},{"issue":"2","key":"817_CR41","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.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00817-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-024-00817-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00817-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T09:09:37Z","timestamp":1748855377000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-024-00817-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,20]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["817"],"URL":"https:\/\/doi.org\/10.1007\/s10951-024-00817-w","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,20]]},"assertion":[{"value":"11 July 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}