{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T04:51:36Z","timestamp":1769835096304,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["PRIN 2020 (Prot. 2020LNEZYC)"],"award-info":[{"award-number":["PRIN 2020 (Prot. 2020LNEZYC)"]}],"id":[{"id":"10.13039\/501100003407","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>We consider the medical student scheduling (MSS) problem, which consists of assigning medical students to internships of different disciplines in various hospitals during the academic year to fulfill their educational and clinical training. The MSS problem takes into account, among other constraints and objectives, precedences between disciplines, student preferences, waiting periods, and hospital changes. We developed a local search technique, based on a combination of two different neighborhood relations and guided by a simulated annealing procedure. Our search method has been able to find the optimal solution for all instances of the dataset proposed by Akbarzadeh and Maenhout (Comput Oper Res 129: 105209, 2021b), in a much shorter runtime than their technique. In addition, we propose a novel dataset in order to test our technique on a more challenging ground. For this new dataset, which is publicly available along with our source code for inspection and future comparisons, we report the experimental results and a sensitivity analysis.<\/jats:p>","DOI":"10.1007\/s10951-024-00806-z","type":"journal-article","created":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T13:01:47Z","timestamp":1712408507000},"page":"233-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving the medical student scheduling problem using simulated annealing"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8188-5793","authenticated-orcid":false,"given":"Eugenia","family":"Zanazzo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1191-1929","authenticated-orcid":false,"given":"Sara","family":"Ceschia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2052-8593","authenticated-orcid":false,"given":"Agostino","family":"Dovier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6965-0536","authenticated-orcid":false,"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,6]]},"reference":[{"issue":"1","key":"806_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.ejor.2020.05.042","volume":"288","author":"B Akbarzadeh","year":"2021","unstructured":"Akbarzadeh, B., & Maenhout, B. (2021). A decomposition-based heuristic procedure for the medical student scheduling problem. European Journal of Operational Research, 288(1), 63\u201379.","journal-title":"European Journal of Operational Research"},{"key":"806_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105209","volume":"129","author":"B Akbarzadeh","year":"2021","unstructured":"Akbarzadeh, B., & Maenhout, B. (2021). An exact branch-and-price approach for the medical student scheduling problem. Computers and Operations Research, 129, 105209.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"806_CR3","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/inte.2022.1116","volume":"52","author":"B Akbarzadeh","year":"2022","unstructured":"Akbarzadeh, B., Wouters, J., Sys, C., & Maenhout, B. (2022). The scheduling of medical students at Ghent university. INFORMS Journal on Applied Analytics, 52(4), 303\u2013323.","journal-title":"INFORMS Journal on Applied Analytics"},{"issue":"7","key":"806_CR4","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1057\/jors.2015.109","volume":"67","author":"JF Bard","year":"2016","unstructured":"Bard, J. F., Shu, Z., Morrice, D. J., & Leykum, L. K. (2016). Annual block scheduling for internal medicine residents with 4+1 templates. Journal of the Operational Research Society, 67(7), 911\u2013927.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"806_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10479-007-0220-2","volume":"155","author":"J Beli\u00ebn","year":"2007","unstructured":"Beli\u00ebn, J., & Demeulemeester, E. (2007). On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem. Annals of Operations Research, 155(1), 143\u2013166.","journal-title":"Annals of Operations Research"},{"key":"806_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105300","volume":"132","author":"R Bellio","year":"2021","unstructured":"Bellio, R., Ceschia, S., Di Gaspero, L., & Schaerf, A. (2021). Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling. Computers & Operations Research, 132, 105300.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"806_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/opre.1100.0865","volume":"59","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Farias, V. F., & Trichakis, N. (2011). The price of fairness. Operations research, 59(1), 17\u201331.","journal-title":"Operations research"},{"key":"806_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-02538-9_13","volume-title":"Experimental Methods for the Analysis of Optimization Algorithms","author":"M Birattari","year":"2010","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., & St\u00fctzle, T. (2010). F-race and iterated F-race: An overview. Experimental Methods for the Analysis of Optimization Algorithms (pp. 311\u2013336). Berlin: Springer."},{"issue":"1","key":"806_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ejor.2018.04.003","volume":"274","author":"CH Brech","year":"2019","unstructured":"Brech, C. H., Ernst, A., & Kolisch, R. (2019). Scheduling medical residents\u2019 training at university hospitals. European Journal of Operational Research, 274(1), 253\u2013266.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"806_CR10","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1111\/poms.12978","volume":"28","author":"AA Cire","year":"2019","unstructured":"Cire, A. A., Diamant, A., Yunes, T., & Carrasco, A. (2019). A network-based formulation for scheduling clinical rotations. Production and Operations Management, 28(5), 1186\u20131205.","journal-title":"Production and Operations Management"},{"key":"806_CR11","doi-asserted-by":"crossref","unstructured":"Cohn, A., Root, S., Kymissis, C., Esses, J., & Westmoreland, N. (2009). Scheduling medical residents at Boston university school of medicine. Interfaces, 39(3), 186\u2013195.","DOI":"10.1287\/inte.1080.0369"},{"issue":"2","key":"806_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1287\/opre.41.2.269","volume":"41","author":"LS Franz","year":"1993","unstructured":"Franz, L. S., & Miller, J. L. (1993). Scheduling medical residents to rotations: Solving the large-scale multiperiod staff assignment problem. Operations Research, 41(2), 269\u2013279.","journal-title":"Operations Research"},{"key":"806_CR13","doi-asserted-by":"crossref","unstructured":"Goodman, M. D., Dowsland, K. A., & Thompson, J. M. (2012). Hybridising GRASP and network flows in the solution of a medical school scheduling problem. Journal of Scheduling, 15(6), 717\u2013731.","DOI":"10.1007\/s10951-012-0289-6"},{"key":"806_CR14","doi-asserted-by":"crossref","unstructured":"G\u00fcler, M. G., Idi, K., G\u00fcler, E. Y., et al. (2013). A goal programming model for scheduling residents in an anesthesia and reanimation department. Expert Systems with Applications, 40(6), 2117\u20132126.","DOI":"10.1016\/j.eswa.2012.10.030"},{"issue":"3","key":"806_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10951-013-0362-9","volume":"17","author":"J Guo","year":"2014","unstructured":"Guo, J., Morrison, D. R., Jacobson, S. H., & Jokela, J. A. (2014). Complexity results for the basic residency scheduling problem. Journal of Scheduling, 17(3), 211\u2013223.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"806_CR16","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10696-019-09365-4","volume":"32","author":"S Kraul","year":"2020","unstructured":"Kraul, S. (2020). Annual scheduling for anesthesiology medicine residents in task-related programs with a focus on continuity of care. Flexible Services and Manufacturing Journal, 32(1), 181\u2013212.","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"2","key":"806_CR17","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1016\/j.ejor.2019.01.034","volume":"276","author":"S Kraul","year":"2019","unstructured":"Kraul, S., F\u00fcgener, A., Brunner, J. O., & Blobner, M. (2019). A robust framework for task-related resident scheduling. European Journal of Operational Research, 276(2), 656\u2013675.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"806_CR18","doi-asserted-by":"publisher","first-page":"1778","DOI":"10.1111\/poms.12728","volume":"26","author":"B Lemay","year":"2017","unstructured":"Lemay, B., Cohn, A., Epelman, M., & Gorga, S. (2017). New methods for resolving conflicting requests with examples from medical residency scheduling. Production and Operations Management, 26(9), 1778\u20131793.","journal-title":"Production and Operations Management"},{"issue":"4","key":"806_CR19","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10729-017-9403-9","volume":"21","author":"RA Proano","year":"2018","unstructured":"Proano, R. A., & Agarwal, A. (2018). Scheduling internal medicine resident rotations to ensure fairness and facilitate continuity of care. Health Care Management Science, 21(4), 461\u2013474.","journal-title":"Health Care Management Science"},{"key":"806_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-6530-4","volume-title":"Optimization by GRASP","author":"MG Resende","year":"2016","unstructured":"Resende, M. G., & Ribeiro, C. C. (2016). Optimization by GRASP. New york: Springer."},{"issue":"3","key":"806_CR21","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1016\/j.ejor.2022.05.007","volume":"304","author":"M Seizinger","year":"2023","unstructured":"Seizinger, M., & Brunner, J. O. (2023). Optimized planning of nursing curricula in dual vocational schools focusing on the German health care system. European Journal of Operational Research, 304(3), 1223\u20131241.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"806_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s10729-014-9289-8","volume":"19","author":"HK Smalley","year":"2016","unstructured":"Smalley, H. K., & Keskinocak, P. (2016). Automated medical resident rotation and shift scheduling to ensure quality resident education and patient care. Health Care Management Science, 19(1), 66\u201388.","journal-title":"Health Care Management Science"},{"key":"806_CR23","unstructured":"Stuckey, P.J., Marriott, K., & Tack, G. (2022). The minizinc handbook. https:\/\/www.minizinc.org\/."},{"issue":"3","key":"806_CR24","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.cie.2006.08.003","volume":"51","author":"S Topaloglu","year":"2006","unstructured":"Topaloglu, S. (2006). A multi-objective programming model for scheduling emergency medicine residents. Computers & Industrial Engineering, 51(3), 375\u2013388.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"806_CR25","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.cor.2010.04.018","volume":"38","author":"S Topaloglu","year":"2011","unstructured":"Topaloglu, S., & Ozkarahan, I. (2011). A constraint programming-based solution approach for medical resident scheduling problems. Computers & Operations Research, 38(1), 246\u2013255.","journal-title":"Computers & Operations Research"},{"key":"806_CR26","unstructured":"Urli, T. (2013). json2run: a tool for experiment design & analysis. CoRR arXiv:1305.1112"},{"key":"806_CR27","doi-asserted-by":"crossref","unstructured":"White, C.A., & White, G.M. (2003). Scheduling doctors for clinical training unit rounds using tabu optimization. In: Practice and Theory of Automated Timetabling IV, Springer, pp 120\u2013128.","DOI":"10.1007\/978-3-540-45157-0_8"},{"key":"806_CR28","unstructured":"Zheng, Z., Gong, X., & Liu, X. (2016). A two-phase heuristic approach for solving trainee rotation assignment problem at a local school of nursing. In: Proc. of the International Conference on the Practice and Theory of Automated Timetabling (PATAT-2016), pp 421\u2013438."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00806-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-024-00806-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-024-00806-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T13:09:35Z","timestamp":1748869775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-024-00806-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,6]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["806"],"URL":"https:\/\/doi.org\/10.1007\/s10951-024-00806-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,6]]},"assertion":[{"value":"18 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}