{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T05:46:57Z","timestamp":1773726417599,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T00:00:00Z","timestamp":1651536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100012774","name":"Innovationsfonden","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10951-022-00728-8","type":"journal-article","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T08:02:56Z","timestamp":1651564976000},"page":"429-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A parallelized matheuristic for the International Timetabling Competition 2019"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3416-7349","authenticated-orcid":false,"given":"Rasmus \u00d8.","family":"Mikkelsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8361-0311","authenticated-orcid":false,"given":"Dennis S.","family":"Holm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,3]]},"reference":[{"issue":"2","key":"728_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11750-015-0363-2","volume":"23","author":"A Bettinelli","year":"2015","unstructured":"Bettinelli, A., Cacchiani, V., Roberti, R., & Toth, P. (2015). An overview of curriculum-based course timetabling. Top, 23(2), 313\u2013349. https:\/\/doi.org\/10.1007\/s11750-015-0363-2","journal-title":"Top"},{"issue":"3","key":"728_CR2","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 & Operations Research, 37(3), 582\u2013597. https:\/\/doi.org\/10.1016\/j.cor.2009.02.023 Hybrid Metaheuristics.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"728_CR3","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. https:\/\/doi.org\/10.1007\/s10479-010-0828-5","journal-title":"Annals of Operations Research"},{"key":"728_CR4","unstructured":"Di Gaspero, L., Mccollum, B., & Schaerf, A. (2007). The second International Timetabling Competition (ITC-2007): Curriculum-based course timetabling (Track 3). Technical report. Technical Report QUB\/IEEE\/Tech\/ITC2007\/CurriculumCTT\/v1.0, Queen\u2019s University, Belfast."},{"key":"728_CR5","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. (2014). A fix-and-optimize heuristic for the high school timetabling problem. Computers & Operations Research, 52, 29\u201338.","journal-title":"Computers & Operations Research"},{"key":"728_CR6","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. (2016). Integrating matheuristics and metaheuristics for timetabling. Computers & Operations Research, 74, 108\u2013117. https:\/\/doi.org\/10.1016\/j.cor.2016.04.016","journal-title":"Computers & Operations Research"},{"issue":"3","key":"728_CR7","first-page":"653","volume":"29","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., & Mart\u00ed, R. (2000). Fundamentals of scatter search and path relinking. Control and Cybernetics, 29(3), 653\u2013684.","journal-title":"Control and Cybernetics"},{"issue":"2","key":"728_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ijpe.2009.08.022","volume":"123","author":"S Helber","year":"2010","unstructured":"Helber, S., & Sahling, F. (2010). A fix-and-optimize approach for the multi-level capacitated lot sizing problem. International Journal of Production Economics, 123(2), 247\u2013256.","journal-title":"International Journal of Production Economics"},{"key":"728_CR9","doi-asserted-by":"publisher","unstructured":"Holm, D., Mikkelsen, R., S\u00f8rensen, M., & Stidsen, T. (2020). A graph-based MIP formulation of the international timetabling competition 2019. Journal of Scheduling. https:\/\/doi.org\/10.1007\/s10951-022-00724-y","DOI":"10.1007\/s10951-022-00724-y"},{"key":"728_CR10","unstructured":"Kristiansen, S. & Stidsen, T. (2013). A Comprehensive Study of Educational Timetabling\u2014a Survey. Number 8.2013 in DTU Management Engineering Report. DTU Management Engineering."},{"issue":"1","key":"728_CR11","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. https:\/\/doi.org\/10.1007\/s10479-010-0700-7","journal-title":"Annals of Operations Research"},{"issue":"3","key":"728_CR12","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.ejor.2011.05.014","volume":"214","author":"JC Lang","year":"2011","unstructured":"Lang, J. C., & Shen, Z.-J.M. (2011). Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions. European Journal of Operational Research, 214(3), 595\u2013605.","journal-title":"European Journal of Operational Research"},{"key":"728_CR13","unstructured":"Lewis, R., Paechter, B., & Mccollum, B. (2007). Post enrolment based course timetabling: A description of the problem model used for track two of the second International Timetabling Competition. In Cardiff Working Papers in Accounting and Finance A2007-3, Cardiff Business School, Cardiff University."},{"issue":"4","key":"728_CR14","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10732-018-9371-3","volume":"24","author":"M Lindahl","year":"2018","unstructured":"Lindahl, M., S\u00f8rensen, M., & Stidsen, T. R. (2018). A fix-and-optimize matheuristic for university timetabling. Journal of Heuristics, 24(4), 645-665.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"728_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., Di Gaspero, L., Qu, R., & Burke, E. K. (2010). Setting the research agenda in automated timetabling: The second International Timetabling Competition. INFORMS Journal on Computing, 22(1), 120\u2013130. https:\/\/doi.org\/10.1287\/ijoc.1090.0320","journal-title":"INFORMS Journal on Computing"},{"key":"728_CR16","unstructured":"M\u00fcller, T., Rudov\u00e1, H., & M\u00fcllerov\u00e1, Z. (2018a). University course timetabling and International Timetabling Competition 2019. In Burke, E.\u00a0K., Di\u00a0Gaspero, L., McCollum, B., Musliu, N., & \u00d6zcan, E., (Eds.), Proceedings of the 12th International Conference of the Practice and Theory of Automated Timetabling (PATAT 2018), Vienna, Austria (pp. 5\u201331)."},{"key":"728_CR17","unstructured":"M\u00fcller, T., Rudov\u00e1, H., & M\u00fcllerov\u00e1, Z. (2018b). University course timetabling and International Timetabling Competition 2019. https:\/\/www.unitime.org\/present\/patat18-slides.pdf. Accessed 12 Apr 2021."},{"issue":"4","key":"728_CR18","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S R\u00f8pke","year":"2006","unstructured":"R\u00f8pke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455\u2013472. https:\/\/doi.org\/10.1287\/trsc.1050.0135","journal-title":"Transportation Science"},{"issue":"1","key":"728_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.ejor.2017.07.029","volume":"265","author":"L Saviniec","year":"2018","unstructured":"Saviniec, L., Santos, M. O., & Costa, A. M. (2018). Parallel local search algorithms for high school timetabling problems. European Journal of Operational Research, 265(1), 81\u201398.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"728_CR20","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"},{"key":"728_CR21","doi-asserted-by":"publisher","first-page":"113943","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"},{"issue":"3","key":"728_CR22","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0166-218X(92)90253-7","volume":"35","author":"A Tripathy","year":"1992","unstructured":"Tripathy, A. (1992). Computerised decision aid for timetabling-a case analysis. Discrete Applied Mathematics, 35(3), 313\u2013323.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00728-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00728-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00728-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:01:27Z","timestamp":1659078087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00728-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,3]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["728"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00728-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,3]]},"assertion":[{"value":"15 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}