{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T01:56:54Z","timestamp":1773107814669,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"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":["J Heuristics"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10732-025-09574-1","type":"journal-article","created":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T17:14:54Z","timestamp":1766078094000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Variable neighborhood search for healthcare providers rostering: a comprehensive review and future research agenda"],"prefix":"10.1007","volume":"32","author":[{"given":"Moustafa","family":"Abdelwanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eman","family":"Ouda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dima Al","family":"Absi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Firda","family":"Rahmadani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1555-5012","authenticated-orcid":false,"given":"Mecit Can Emre","family":"Simsekler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Sleptchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,18]]},"reference":[{"issue":"4","key":"9574_CR1","doi-asserted-by":"publisher","first-page":"2051","DOI":"10.3934\/jimo.2020058","volume":"17","author":"M Abdelghany","year":"2021","unstructured":"Abdelghany, M., Eltawil, A.B., Yahia, Z., et al.: A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem. Journal of Industrial and Management Optimization 17(4), 2051\u20132072 (2021)","journal-title":"Journal of Industrial and Management Optimization"},{"issue":"2","key":"9574_CR2","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1051\/ro\/2021027","volume":"55","author":"M Abdelghany","year":"2021","unstructured":"Abdelghany, M., Yahia, Z., Eltawil, A.B.: A new two-stage variable neighborhood search algorithm for the nurse rostering problem. RAIRO-Operations Research 55(2), 673\u2013687 (2021)","journal-title":"RAIRO-Operations Research"},{"key":"9574_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106546","volume":"164","author":"M Abdelwanis","year":"2024","unstructured":"Abdelwanis, M., Gabor, A.F., Mladenovic, N., et al.: Simulation-based variable neighborhood search for optimizing skill assignments in multi-server facilities with inventories. Computers & Operations Research 164, 106546 (2024). https:\/\/doi.org\/10.1016\/j.cor.2024.106546","journal-title":"Computers & Operations Research"},{"issue":"5","key":"9574_CR4","first-page":"1781","volume":"30","author":"E Arabzadeh","year":"2023","unstructured":"Arabzadeh, E., Fatemi Ghomi, S., Karimi, B.: Multi-period home health care routing and scheduling problem with the medical grouping of patients. Scientia Iranica 30(5), 1781\u20131795 (2023)","journal-title":"Scientia Iranica"},{"key":"9574_CR5","doi-asserted-by":"crossref","unstructured":"Atoyebi, K.S., Abayomi-Alli, A., Daniel, D.W., et\u00a0al.: Enhancing nurse scheduling with user preferences: Hybrid genetic algorithm and variable neighbourhood search approach. In: 2024 IEEE 5th International Conference on Electro-Computing Technologies for Humanity (NIGERCON), IEEE, 1\u20135 (2024)","DOI":"10.1109\/NIGERCON62786.2024.10926960"},{"key":"9574_CR6","doi-asserted-by":"crossref","unstructured":"Batun, S., Begen, M.A.: Optimization in healthcare delivery modeling: Methods and applications. In: Handbook of Healthcare Operations Management: Methods and Applications. Springer, 75\u2013119 (2013)","DOI":"10.1007\/978-1-4614-5885-2_4"},{"issue":"9","key":"9574_CR7","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1007\/s11590-022-01913-6","volume":"17","author":"R Benmansour","year":"2023","unstructured":"Benmansour, R., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search for the single machine scheduling problem to minimize the total early work. Optimization Letters 17(9), 2169\u20132184 (2023)","journal-title":"Optimization Letters"},{"issue":"1","key":"9574_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10479-010-0804-0","volume":"194","author":"B Bilgin","year":"2012","unstructured":"Bilgin, B., De Causmaecker, P., Rossie, B., et al.: Local search neighbourhoods for dealing with a novel nurse rostering model. Ann. Oper. Res. 194(1), 33\u201357 (2012)","journal-title":"Ann. Oper. Res."},{"key":"9574_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106221","volume":"155","author":"J Brimberg","year":"2023","unstructured":"Brimberg, J., Salhi, S., Todosijevi\u0107, R., et al.: Variable neighborhood search: The power of change and simplicity. Computers & Operations Research 155, 106221 (2023). https:\/\/doi.org\/10.1016\/j.cor.2023.106221","journal-title":"Computers & Operations Research"},{"issue":"1","key":"9574_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2014.01.039","volume":"237","author":"EK Burke","year":"2014","unstructured":"Burke, E.K., Curtois, T.: New approaches to nurse rostering benchmark instances. Eur. J. Oper. Res. 237(1), 71\u201381 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9574_CR11","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","volume":"188","author":"EK Burke","year":"2008","unstructured":"Burke, E.K., Curtois, T., Post, G., et al.: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur. J. Oper. Res. 188(2), 330\u2013341 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9574_CR12","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1016\/j.ejor.2009.07.036","volume":"203","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Li, J., Qu, R.: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. Eur. J. Oper. Res. 203(2), 484\u2013493 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9574_CR13","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1057\/jors.2010.86","volume":"62","author":"EK Burke","year":"2011","unstructured":"Burke, E.K., Curtois, T., Van Draat, L.F., et al.: Progress control in iterated local search for nurse rostering. Journal of the Operational Research Society 62(2), 360\u2013367 (2011)","journal-title":"Journal of the Operational Research Society"},{"issue":"19","key":"9574_CR14","doi-asserted-by":"publisher","first-page":"7186","DOI":"10.1080\/00207543.2024.2320707","volume":"62","author":"PS Chen","year":"2024","unstructured":"Chen, P.S., Huang, W.T., Chen, G.Y.H., et al.: Constructing modified variable neighborhood search approaches to solve a nurse scheduling problem. Int. J. Prod. Res. 62(19), 7186\u20137204 (2024). https:\/\/doi.org\/10.1080\/00207543.2024.2320707","journal-title":"Int. J. Prod. Res."},{"key":"9574_CR15","doi-asserted-by":"crossref","unstructured":"Constantino, A.A., Tozzo, E., Pinheiro, R.L., et\u00a0al.: A variable neighbourhood search for nurse scheduling with balanced preference satisfaction. In: International Conference on Enterprise Information Systems, SCITEPRESS, 462\u2013470 (2015)","DOI":"10.5220\/0005364404620470"},{"issue":"1","key":"9574_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10479-012-1235-x","volume":"218","author":"F Della Croce","year":"2014","unstructured":"Della Croce, F., Salassa, F.: A variable neighborhood search based matheuristic for nurse rostering problems. Ann. Oper. Res. 218(1), 185\u2013199 (2014)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9574_CR17","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:ANOR.0000019087.46656.e2","volume":"127","author":"AT Ernst","year":"2004","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., et al.: An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. 127(1), 21\u2013144 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9574_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"AT Ernst","year":"2004","unstructured":"Ernst, A.T., Jiang, H., Krishnamoorthy, M., et al.: Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3\u201327 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9574_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.endm.2018.03.027","volume":"66","author":"HS Ferreira","year":"2018","unstructured":"Ferreira, H.S., Bogue, E.T., Noronha, T.F., et al.: Variable neighborhood search for vehicle routing problem with multiple time windows. Electronic Notes in Discrete Mathematics 66, 207\u2013214 (2018)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"9574_CR20","doi-asserted-by":"publisher","first-page":"69591","DOI":"10.1109\/ACCESS.2022.3186097","volume":"10","author":"SL Goh","year":"2022","unstructured":"Goh, S.L., Sabar, N.R., Abdullah, S., et al.: A 2-stage approach for the nurse rostering problem. IEEE Access 10, 69591\u201369604 (2022)","journal-title":"IEEE Access"},{"key":"9574_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.endm.2017.03.005","volume":"58","author":"RA Gomes","year":"2017","unstructured":"Gomes, R.A., Toffolo, T.A., Santos, H.G.: Variable neighborhood search accelerated column generation for the nurse rostering problem. Electronic Notes in Discrete Mathematics 58, 31\u201338 (2017)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"9574_CR22","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1111\/itor.12540","volume":"27","author":"A Gruler","year":"2018","unstructured":"Gruler, A., Panadero, J., Armas, J., et al.: A variable neighborhood search simheuristic for the multiperiod inventory routing problem with stochastic demands. Int. Trans. Oper. Res. 27, 314\u2013335 (2018). https:\/\/doi.org\/10.1111\/itor.12540","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"9574_CR23","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001). https:\/\/doi.org\/10.1016\/S0377-2217(00)00100-4","journal-title":"Eur. J. Oper. Res."},{"key":"9574_CR24","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovic, N., Moreno-P\u00e9rez, J.: Variable neighbourhood search: Methods and applications. Ann. Oper. Res. 175, 367\u2013407 (2010). https:\/\/doi.org\/10.1007\/s10479-009-0657-6","journal-title":"Ann. Oper. Res."},{"issue":"423","key":"9574_CR25","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2016","unstructured":"Hansen, P., Mladenovic, N., Todosijevi\u0107, R., et al.: Variable neighborhood search: basics and variants. EURO Journal on Computational Optimization 5(423), 454 (2016). https:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO Journal on Computational Optimization"},{"key":"9574_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.orhc.2020.100278","volume":"27","author":"S Heydrich","year":"2020","unstructured":"Heydrich, S., Schroeder, R., Velten, S.: Collaborative duty rostering in health care professions. Operations Research for Health Care 27, 100278 (2020)","journal-title":"Operations Research for Health Care"},{"issue":"9","key":"9574_CR27","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1007\/s11590-023-01993-y","volume":"17","author":"G Kordi","year":"2023","unstructured":"Kordi, G., Divsalar, A., Emami, S.: Multi-objective home health care routing: a variable neighborhood search method. Optimization Letters 17(9), 2257\u20132298 (2023)","journal-title":"Optimization Letters"},{"key":"9574_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105813","volume":"85","author":"S Lan","year":"2019","unstructured":"Lan, S., Fan, W., Liu, T., et al.: A hybrid sca-vns meta-heuristic based on iterated hungarian algorithm for physicians and medical staff scheduling problem in outpatient department of large hospitals with multiple branches. Appl. Soft Comput. 85, 105813 (2019)","journal-title":"Appl. Soft Comput."},{"issue":"5","key":"9574_CR29","doi-asserted-by":"publisher","first-page":"3446","DOI":"10.1007\/s10878-022-00896-5","volume":"44","author":"S Lan","year":"2022","unstructured":"Lan, S., Fan, W., Shao, K., et al.: A column-generation-based approach for an integrated service planning and physician scheduling problem considering re-consultation. J. Comb. Optim. 44(5), 3446\u20133476 (2022)","journal-title":"J. Comb. Optim."},{"issue":"9","key":"9574_CR30","doi-asserted-by":"publisher","first-page":"2043","DOI":"10.1080\/01605682.2021.1954485","volume":"73","author":"S Lan","year":"2022","unstructured":"Lan, S., Fan, W., Yang, S., et al.: Solving a multiple-qualifications physician scheduling problem with multiple types of tasks by dynamic programming and variable neighborhood search. Journal of the Operational Research Society 73(9), 2043\u20132058 (2022)","journal-title":"Journal of the Operational Research Society"},{"key":"9574_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105969","volume":"147","author":"S Lan","year":"2022","unstructured":"Lan, S., Fan, W., Yang, S., et al.: A variable neighborhood search algorithm for an integrated physician planning and scheduling problem. Computers & Operations Research 147, 105969 (2022)","journal-title":"Computers & Operations Research"},{"issue":"2","key":"9574_CR32","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10472-023-09834-5","volume":"91","author":"S Lan","year":"2023","unstructured":"Lan, S., Fan, W., Yang, S., et al.: Physician scheduling problem in mobile cabin hospitals of china during covid-19 outbreak. Ann. Math. Artif. Intell. 91(2), 349\u2013372 (2023)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"9574_CR33","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TSC.2024.3517344","volume":"18","author":"CC Lin","year":"2025","unstructured":"Lin, C.C., Peng, Y.C., Chen, Z.Y.A., et al.: Crowdsourcing home healthcare service: Matching caretakers with caregivers for jointly rostering and routing. IEEE Trans. Serv. Comput. 18(1), 126\u2013139 (2025). https:\/\/doi.org\/10.1109\/TSC.2024.3517344","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"6","key":"9574_CR34","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1057\/jors.2010.42","volume":"62","author":"H Lin","year":"2011","unstructured":"Lin, H., Liao, C., Tseng, C.: An application of variable neighbourhood search to hospital call scheduling of infant formula promotion. Journal of the Operational Research Society 62(6), 949\u2013959 (2011)","journal-title":"Journal of the Operational Research Society"},{"key":"9574_CR35","doi-asserted-by":"crossref","unstructured":"Liogys, M., Zilinskas, A.: A variable neighbourhood search enhancement for the shift sequence based method of the personal scheduling in hospitals. In: International Conference on Information and Software Technologies, Springer, 15\u201323 (2012)","DOI":"10.1007\/978-3-642-33308-8_2"},{"issue":"3","key":"9574_CR36","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1016\/j.ejor.2011.12.016","volume":"218","author":"Z L\u00fc","year":"2012","unstructured":"L\u00fc, Z., Hao, J.K.: Adaptive neighborhood search for nurse rostering. Eur. J. Oper. Res. 218(3), 865\u2013876 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"9574_CR37","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1016\/j.cor.2010.12.012","volume":"38","author":"B Maenhout","year":"2011","unstructured":"Maenhout, B., Vanhoucke, M.: An evolutionary approach for the nurse rerostering problem. Computers & Operations Research 38(10), 1400\u20131411 (2011)","journal-title":"Computers & Operations Research"},{"issue":"16","key":"9574_CR38","doi-asserted-by":"publisher","first-page":"6674","DOI":"10.1016\/j.eswa.2013.06.019","volume":"40","author":"S Martin","year":"2013","unstructured":"Martin, S., Ouelhadj, D., Smet, P., et al.: Cooperative search for fair nurse rosters. Expert Syst. Appl. 40(16), 6674\u20136683 (2013)","journal-title":"Expert Syst. Appl."},{"issue":"11","key":"9574_CR39","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research 24(11), 1097\u20131100 (1997). https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Computers & Operations Research"},{"issue":"1","key":"9574_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orhc.2013.03.003","volume":"2","author":"R M\u2019Hallah","year":"2013","unstructured":"M\u2019Hallah, R., Alkhabbaz, A.: Scheduling of nurses: A case study of a kuwaiti health care unit. Operations Research for Health Care 2(1), 1\u201319 (2013). https:\/\/doi.org\/10.1016\/j.orhc.2013.03.003","journal-title":"Operations Research for Health Care"},{"key":"9574_CR41","doi-asserted-by":"crossref","unstructured":"Oueida, S.: Modeling a New Computer Framework for Managing Healthcare Organizations: Balancing and Optimizing Patient Satisfaction, Owner Satisfaction, and Medical Resources. Productivity Press (2020)","DOI":"10.4324\/9781003027836"},{"key":"9574_CR42","unstructured":"Page, M.J., McKenzie, J.E., Bossuyt, P.M., et\u00a0al.: The prisma 2020 statement: an updated guideline for reporting systematic reviews. bmj 372 (2021)"},{"key":"9574_CR43","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ins.2019.08.017","volume":"507","author":"J Pei","year":"2020","unstructured":"Pei, J., Mladenovi\u0107, N., Uro\u0161evi\u0107, D., et al.: Solving the traveling repairman problem with profits: A novel variable neighborhood search approach. Inf. Sci. 507, 108\u2013123 (2020)","journal-title":"Inf. Sci."},{"issue":"11","key":"9574_CR44","doi-asserted-by":"publisher","first-page":"2396","DOI":"10.1080\/01605682.2020.1792365","volume":"72","author":"M Polnik","year":"2021","unstructured":"Polnik, M., Riccardi, A., Akartunal\u0131, K.: A multistage optimisation algorithm for the large vehicle routing problem with time windows and synchronised visits. Journal of the Operational Research Society 72(11), 2396\u20132411 (2021)","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"9574_CR45","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1002\/nav.22044","volume":"69","author":"H Qiu","year":"2022","unstructured":"Qiu, H., Wang, D., Yin, Y., et al.: An exact solution method for home health care scheduling with synchronized services. Naval Research Logistics (NRL) 69(5), 715\u2013733 (2022)","journal-title":"Naval Research Logistics (NRL)"},{"key":"9574_CR46","doi-asserted-by":"crossref","unstructured":"Qu, R., He, F.: A hybrid constraint programming approach for nurse rostering problems. In: International Conference on Innovative Techniques and Applications of Artificial Intelligence, Springer, 211\u2013224 (2008)","DOI":"10.1007\/978-1-84882-215-3_16"},{"issue":"2","key":"9574_CR47","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.ejor.2016.09.030","volume":"258","author":"E Rahimian","year":"2017","unstructured":"Rahimian, E., Akartunal\u0131, K., Levine, J.: A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems. Eur. J. Oper. Res. 258(2), 411\u2013423 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9574_CR48","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.future.2009.01.004","volume":"25","author":"V Roshanaei","year":"2009","unstructured":"Roshanaei, V., Naderi, B., Jolai, F., et al.: A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Futur. Gener. Comput. Syst. 25(6), 654\u2013661 (2009)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"9574_CR49","doi-asserted-by":"crossref","unstructured":"Shahidin, A.M., Said, M.S.M., Said, N.H.M., et\u00a0al.: Developing optimal nurses work schedule using integer programming. In: AIP Conference Proceedings, AIP Publishing (2017)","DOI":"10.1063\/1.4995863"},{"key":"9574_CR50","doi-asserted-by":"crossref","unstructured":"Sharif, E., Ayob, M., Hadwan, M.: Hybridization of heuristic approach with variable neighborhood descent search to solve nurse rostering problem at universiti kebangsaan malaysia medical centre (ukmmc). In: 2011 3rd Conference on Data Mining and Optimization (DMO), IEEE, 178\u2013183 (2011)","DOI":"10.1109\/DMO.2011.5976524"},{"issue":"1","key":"9574_CR51","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2015.08.025","volume":"249","author":"P Smet","year":"2016","unstructured":"Smet, P., Brucker, P., De Causmaecker, P., et al.: Polynomially solvable personnel rostering problems. Eur. J. Oper. Res. 249(1), 67\u201375 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9574_CR52","doi-asserted-by":"publisher","first-page":"278","DOI":"10.3390\/a6020278","volume":"6","author":"IP Solos","year":"2013","unstructured":"Solos, I.P., Tassopoulos, I.X., Beligiannis, G.N.: A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem. Algorithms 6(2), 278\u2013308 (2013). https:\/\/doi.org\/10.3390\/a6020278","journal-title":"Algorithms"},{"key":"9574_CR53","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.cor.2015.02.009","volume":"60","author":"IX Tassopoulos","year":"2015","unstructured":"Tassopoulos, I.X., Solos, I.P., Beligiannis, G.N.: A two-phase adaptive variable neighborhood approach for nurse rostering. Computers & operations research 60, 150\u2013169 (2015)","journal-title":"Computers & operations research"},{"key":"9574_CR54","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1007\/s11590-014-0788-9","volume":"11","author":"R Todosijevi\u0107","year":"2017","unstructured":"Todosijevi\u0107, R., Mjirda, A., Mladenovi\u0107, M., et al.: A general variable neighborhood search variants for the travelling salesman problem with draft limits. Optimization Letters 11, 1047\u20131056 (2017)","journal-title":"Optimization Letters"},{"issue":"6","key":"9574_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-015-0867-6","volume":"11","author":"R Todosijevi\u0107","year":"2017","unstructured":"Todosijevi\u0107, R., Uro\u0161evi\u0107, D., Mladenovic, N., et al.: A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optimization Letters 11(6), 1\u201313 (2017). https:\/\/doi.org\/10.1007\/s11590-015-0867-6","journal-title":"Optimization Letters"},{"issue":"2","key":"9574_CR56","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1080\/01605682.2017.1421853","volume":"70","author":"M Tohidi","year":"2019","unstructured":"Tohidi, M., Kazemi Zanjani, M., Contreras, I.: Integrated physician and clinic scheduling in ambulatory polyclinics. Journal of the Operational Research Society 70(2), 177\u2013191 (2019)","journal-title":"Journal of the Operational Research Society"},{"issue":"7","key":"9574_CR57","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1057\/jors.2010.73","volume":"62","author":"S Vlah","year":"2011","unstructured":"Vlah, S., Luka\u010d, Z., Pacheco, J.: Use of vns heuristics for scheduling of patients in hospital. Journal of the Operational Research Society 62(7), 1227\u20131238 (2011)","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"9574_CR58","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10951-012-0278-9","volume":"15","author":"S Vlah Jeri\u0107","year":"2012","unstructured":"Vlah Jeri\u0107, S., Figueira, J.R.: Multi-objective scheduling and a resource allocation problem in hospitals. J. Sched. 15(5), 513\u2013535 (2012)","journal-title":"J. Sched."},{"key":"9574_CR59","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.cor.2018.12.014","volume":"104","author":"TI Wickert","year":"2019","unstructured":"Wickert, T.I., Smet, P., Vanden Berghe, G.: The nurse rerostering problem: Strategies for reconstructing disrupted schedules. Computers & Operations Research 104, 319\u2013337 (2019). https:\/\/doi.org\/10.1016\/j.cor.2018.12.014","journal-title":"Computers & Operations Research"},{"key":"9574_CR60","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Gong, X.: Solving real life nurse rostering problem in a local hospital based on spreadsheet. In: Proceedings of the 2020 4th International Conference on Electronic Information Technology and Computer Engineering, 959\u2013964 (2020)","DOI":"10.1145\/3443467.3443887"},{"key":"9574_CR61","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cie.2017.05.027","volume":"110","author":"Z Zheng","year":"2017","unstructured":"Zheng, Z., Liu, X., Gong, X.: A simple randomized variable neighbourhood search for nurse rostering. Computers & Industrial Engineering 110, 165\u2013174 (2017)","journal-title":"Computers & Industrial Engineering"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09574-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-025-09574-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09574-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T14:21:44Z","timestamp":1773066104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-025-09574-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,18]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["9574"],"URL":"https:\/\/doi.org\/10.1007\/s10732-025-09574-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,18]]},"assertion":[{"value":"21 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This literature review is based solely on previously published sources and does not involve human or animal subjects. Therefore, ethical approval was not required. All sources are appropriately cited, and the study complies with academic research ethics.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Statement"}}],"article-number":"2"}}