{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:05:07Z","timestamp":1767319507645,"version":"3.48.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032091550","type":"print"},{"value":"9783032091567","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-09156-7_21","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:01:24Z","timestamp":1767319284000},"page":"316-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Post-Enrollment Course Timetabling Problem with\u00a0Flexible Teacher Assignments"],"prefix":"10.1007","author":[{"given":"Richard","family":"Hoshino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zilei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.cor.2015.02.011","volume":"61","author":"SM Al-Yakoob","year":"2015","unstructured":"Al-Yakoob, S.M., Sherali, H.D.: Mathematical models and algorithms for a high school timetabling problem. Comput. Oper. Res. 61, 56\u201368 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"21_CR2","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.: Educational timetabling: problems, benchmarks, and state-of-the-art results. Eur. J. Oper. Res. 308(1), 1\u201318 (2023)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.ejor.2016.07.002","volume":"256","author":"\u00c1P Dorneles","year":"2017","unstructured":"Dorneles, \u00c1.P., de Ara\u00fajo, O.C., Buriol, L.S.: A column generation approach to high school timetabling modeled as a multicommodity flow problem. Eur. J. Oper. Res. 256(3), 685\u2013695 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cor.2014.06.023","volume":"52","author":"\u00c1P Dorneles","year":"2014","unstructured":"Dorneles, \u00c1.P., De Ara\u00fajo, O.C., Buriol, L.S.: A fix-and-optimize heuristic for the high school timetabling problem. Comput. Operat. Res. 52, 29\u201338 (2014)","journal-title":"Comput. Operat. Res."},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"ASS Even","year":"1976","unstructured":"Even, A.S.S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.cor.2013.11.012","volume":"52","author":"GH Fonseca","year":"2014","unstructured":"Fonseca, G.H., Santos, H.G.: Variable neighborhood search based algorithms for high school timetabling. Comput. Oper. Res. 52, 203\u2013208 (2014)","journal-title":"Comput. Oper. Res."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.cor.2016.04.016","volume":"74","author":"GH Fonseca","year":"2016","unstructured":"Fonseca, G.H., Santos, H.G., Carrano, E.G.: Integrating matheuristics and metaheuristics for timetabling. Comput. Oper. Res. 74, 108\u2013117 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ejor.2017.03.020","volume":"262","author":"GH Fonseca","year":"2017","unstructured":"Fonseca, G.H., Santos, H.G., Carrano, E.G., Stidsen, T.J.: Integer programming techniques for educational timetabling. Eur. J. Oper. Res. 262(1), 28\u201339 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"21_CR9","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.: Improved local search approaches to solve the post enrolment course timetabling problem. Eur. J. Oper. Res. 261(1), 17\u201329 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"21_CR10","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.: Simulated annealing with improved reheating and learning for the post enrolment course timetabling problem. J. Oper. Res. Soc. 70(6), 873\u2013888 (2019)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"21_CR11","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.: An effective hybrid local search approach for the post enrolment course timetabling problem. Opsearch 57(4), 1131\u20131163 (2020). https:\/\/doi.org\/10.1007\/s12597-020-00444-x","journal-title":"Opsearch"},{"key":"21_CR12","unstructured":"Google OR-Tools: Fast and portable software for combinatorial optimization. https:\/\/developers.google.com\/optimization (2025). Accessed 14 Feb 2025"},{"key":"21_CR13","first-page":"73","volume":"62","author":"C Gotlieb","year":"1963","unstructured":"Gotlieb, C.: The construction of class-teacher timetables. IFIP congress, Amsterdam 62, 73\u201377 (1963)","journal-title":"IFIP congress, Amsterdam"},{"key":"21_CR14","unstructured":"Hoshino, R., Albers, J.: Cohort-based timetabling with integer linear programming. In: Proceedings of the 14th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2024) pp. 276\u2013284 (2024)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-030-58942-4_19","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"R Hoshino","year":"2020","unstructured":"Hoshino, R., Fabris, I.: Optimizing student course preferences in school timetabling. In: Hebrard, E., Musliu, N. (eds.) CPAIOR 2020. LNCS, vol. 12296, pp. 283\u2013299. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_19"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-78230-6_6","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"R Hoshino","year":"2021","unstructured":"Hoshino, R., Fabris, I.: Partitioning students into cohorts during COVID-19. In: Stuckey, P.J. (ed.) CPAIOR 2021. LNCS, vol. 12735, pp. 89\u2013105. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78230-6_6"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10951-014-0405-x","volume":"18","author":"S Kristiansen","year":"2015","unstructured":"Kristiansen, S., S\u00f8rensen, M., Stidsen, T.R.: Integer programming for the generalized high school timetabling problem. J. Sched. 18, 377\u2013392 (2015)","journal-title":"J. Sched."},{"issue":"1","key":"21_CR18","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum, B., et al.: Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS J. Comput. 22(1), 120\u2013130 (2010)","journal-title":"INFORMS J. Comput."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Minh, K.N.T.T., Thanh, N.D.T., Trang, K.T., Hue, N.T.T.: Using tabu search for solving a high school timetabling problem. Advances in intelligent information and database systems, pp. 305\u2013313 (2010)","DOI":"10.1007\/978-3-642-12090-9_26"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.cor.2017.09.014","volume":"90","author":"Y Nagata","year":"2018","unstructured":"Nagata, Y.: Random partial neighborhood search for the post-enrollment course timetabling problem. Comput. Oper. Res. 90, 84\u201396 (2018)","journal-title":"Comput. Oper. Res."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10479-013-1321-8","volume":"218","author":"N Pillay","year":"2014","unstructured":"Pillay, N.: A survey of school timetabling research. Ann. Oper. Res. 218, 261\u2013293 (2014)","journal-title":"Ann. Oper. Res."},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Handbook of metaheuristics, pp. 99\u2013127. Springer (2018)","DOI":"10.1007\/978-3-319-91086-4_4"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10479-010-0699-9","volume":"194","author":"G Post","year":"2012","unstructured":"Post, G., Ahmadi, S., Daskalaki, S., Kingston, J.H., Kyngas, J., Nurmi, C., Ranson, D.: An xml format for benchmarks in high school timetabling. Ann. Oper. Res. 194, 385\u2013397 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"21_CR24","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.ejor.2019.08.001","volume":"280","author":"L Saviniec","year":"2020","unstructured":"Saviniec, L., Santos, M.O., Costa, A.M., dos Santos, L.M.: Pattern-based models and a cooperative parallel metaheuristic for high school timetabling problems. Eur. J. Oper. Res. 280(3), 1064\u20131081 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR25","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.: A two-stage decomposition of high school timetabling applied to cases in denmark. Comput. Oper. Res. 43, 36\u201349 (2014)","journal-title":"Comput. Oper. Res."},{"key":"21_CR26","unstructured":"S\u00f8rensen, M., Kristiansen, S., Stidsen, T.R.: International timetabling competition 2011: an adaptive large neighborhood search algorithm. In: 9th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2012), pp. 489\u2013492 (2012)"},{"key":"21_CR27","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.: A survey of the state-of-the-art of optimisation methodologies in school timetabling problems. Expert Syst. Appl. 165, 113943 (2021)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1080\/01605682.2018.1557022","volume":"71","author":"IX Tassopoulos","year":"2020","unstructured":"Tassopoulos, I.X., Iliopoulou, C.A., Beligiannis, G.N.: Solving the greek school timetabling problem by a mixed integer programming model. J. Oper. Res. Soc. 71(1), 117\u2013132 (2020)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"21_CR29","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.: A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems. Eur. J. Oper. Res. 203(3), 550\u2013558 (2010)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09156-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:01:25Z","timestamp":1767319285000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09156-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032091550","9783032091567"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09156-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lion19.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}