{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T03:07:24Z","timestamp":1768532844167,"version":"3.49.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"8-9","license":[{"start":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T00:00:00Z","timestamp":1613001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T00:00:00Z","timestamp":1613001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Key Research and Development Projects in Anhui","award":["1804b06020377"],"award-info":[{"award-number":["1804b06020377"]}]},{"name":"Basic scientific research Projects in central colleges and Universities","award":["JZ2018HGTB0232"],"award-info":[{"award-number":["JZ2018HGTB0232"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72071057"],"award-info":[{"award-number":["72071057"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71922009"],"award-info":[{"award-number":["71922009"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71690230"],"award-info":[{"award-number":["71690230"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovative Research Groups of the National Natural Science Foundation of China","award":["71521001"],"award-info":[{"award-number":["71521001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10472-021-09727-5","type":"journal-article","created":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T23:02:45Z","timestamp":1613084565000},"page":"741-775","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A survey on the applications of variable neighborhood search algorithm in healthcare management"],"prefix":"10.1007","volume":"89","author":[{"given":"Shaowen","family":"Lan","sequence":"first","affiliation":[]},{"given":"Wenjuan","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Shanlin","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Nenad","family":"Mladenovic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,11]]},"reference":[{"key":"9727_CR1","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. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9727_CR2","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, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9727_CR3","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1109\/TITS.2017.2706720","volume":"19","author":"X Meng","year":"2018","unstructured":"Meng, X., Li, J., Dai, X., Dou, J.: Variable neighborhood search for a colored traveling salesman problem. IEEE Trans. Intell. Transp. Syst. 19, 1018\u20131026 (2018)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"9727_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","volume":"68","author":"S Hore","year":"2018","unstructured":"Hore, S., Chatterjee, A., Dewanji, A.: Improving variable neighborhood search to solve the traveling salesman problem. Appl. Soft Comput. J. 68, 83\u201391 (2018)","journal-title":"Appl. Soft Comput. J."},{"key":"9727_CR5","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.ejor.2012.01.036","volume":"220","author":"N Mladenovi\u0107","year":"2012","unstructured":"Mladenovi\u0107, N., Uro\u0161evi\u0107, D., Hanafi, S., Ili\u0107, A.: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem. Eur. J. Oper. Res. 220, 270\u2013285 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"9727_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2014.10.010","volume":"242","author":"O Polat","year":"2015","unstructured":"Polat, O., Kalayci, C.B., Kulak, O., G\u00fcnther, H.O.: A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit. Eur. J. Oper. Res. 242, 369\u2013382 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"9727_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.asoc.2018.11.029","volume":"75","author":"A Baniamerian","year":"2019","unstructured":"Baniamerian, A., Bashiri, M., Tavakkoli-Moghaddam, R.: Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking. Appl. Soft Comput. J. 75, 441\u2013460 (2019)","journal-title":"Appl. Soft Comput. J."},{"key":"9727_CR8","doi-asserted-by":"publisher","first-page":"105701","DOI":"10.1016\/j.asoc.2019.105701","volume":"84","author":"S Liu","year":"2019","unstructured":"Liu, S., Pei, J., Cheng, H., Liu, X., Pardalos, P.M.: Two-stage hybrid flow shop scheduling on parallel batching machines considering a job-dependent deteriorating effect and non-identical job sizes. Appl. Soft Comput. 84, 105701 (2019)","journal-title":"Appl. Soft Comput."},{"key":"9727_CR9","doi-asserted-by":"publisher","first-page":"102117","DOI":"10.1016\/j.omega.2019.102117","volume":"94","author":"X Wu","year":"2020","unstructured":"Wu, X., Che, A.: Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search. Omega. 94, 102117 (2020)","journal-title":"Omega."},{"key":"9727_CR10","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/s00291-011-0253-4","volume":"33","author":"A Trautsamwieser","year":"2011","unstructured":"Trautsamwieser, A., Gronalt, M., Hirsch, P.: Securing home health care in times of natural disasters. OR Spectr. 33, 787\u2013813 (2011)","journal-title":"OR Spectr."},{"key":"9727_CR11","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10732-010-9139-x","volume":"17","author":"A Riise","year":"2011","unstructured":"Riise, A., Burke, E.K.: Local search for the surgery admission planning problem. J. Heuristics. 17, 389\u2013414 (2011)","journal-title":"J. Heuristics"},{"key":"9727_CR12","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, 411\u2013423 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"9727_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.cor.2014.11.006","volume":"56","author":"L Talarico","year":"2015","unstructured":"Talarico, L., Meisel, F., S\u00f6rensen, K.: Ambulance routing for disaster response with patient groups. Comput. Oper. Res. 56, 120\u2013133 (2015)","journal-title":"Comput. Oper. Res."},{"key":"9727_CR14","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, 484\u2013493 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9727_CR15","first-page":"177","volume":"3","author":"M Souki","year":"2011","unstructured":"Souki, M.: Operating theatre scheduling with fuzzy durations. J. Appl. Oper. Res. 3, 177\u2013191 (2011)","journal-title":"J. Appl. Oper. Res."},{"key":"9727_CR16","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. Comput. Oper. Res. 60, 150\u2013169 (2015)","journal-title":"Comput. Oper. Res."},{"key":"9727_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.endm.2014.11.024","volume":"47","author":"B Issaoui","year":"2015","unstructured":"Issaoui, B., Zidi, I., Marcon, E., Ghedira, K.: New multi-objective approach for the home care service problem based on scheduling algorithms and variable neighborhood descent. Electron Notes Discrete Math. 47, 181\u2013188 (2015)","journal-title":"Electron Notes Discrete Math."},{"key":"9727_CR18","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"9727_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10729-013-9243-1","volume":"17","author":"DS Mankowska","year":"2014","unstructured":"Mankowska, D.S., Meisel, F., Bierwirth, C.: The home health care routing and scheduling problem with interdependent services. Health Care Manag. Sci. 17, 15\u201330 (2014)","journal-title":"Health Care Manag. Sci."},{"key":"9727_CR20","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.endm.2014.11.023","volume":"47","author":"R Aringhieri","year":"2015","unstructured":"Aringhieri, R., Landa, P., T\u00e0nfani, E.: Assigning surgery cases to operating rooms: a VNS approach for leveling ward beds occupancies. Electron Notes Discrete Math. 47, 173\u2013180 (2015)","journal-title":"Electron Notes Discrete Math."},{"key":"9727_CR21","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1016\/j.ejor.2013.04.040","volume":"230","author":"DT Wilson","year":"2013","unstructured":"Wilson, D.T., Hawe, G.I., Coates, G., Crouch, R.S.: A multi-objective combinatorial model of casualty processing in major incident response. Eur. J. Oper. Res. 230, 643\u2013655 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"9727_CR22","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.endm.2017.03.009","volume":"58","author":"S Frifita","year":"2017","unstructured":"Frifita, S., Masmoudi, M., Euchi, J.: General variable neighborhood search for home healthcare routing and scheduling problem with time windows and synchronized visits. Electron Notes Discrete Math. 58, 63\u201370 (2017)","journal-title":"Electron Notes Discrete Math."},{"key":"9727_CR23","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.amc.2015.11.073","volume":"276","author":"S Davari","year":"2016","unstructured":"Davari, S., Kilic, K., Naderi, S.: A heuristic approach to solve the preventive health care problem with budget and congestion constraints. Appl. Math. Comput. 276, 442\u2013453 (2016)","journal-title":"Appl. Math. Comput."},{"key":"9727_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s00170-013-5602-9","volume":"72","author":"R Rahmaniani","year":"2014","unstructured":"Rahmaniani, R., Rahmaniani, G., Jabbarzadeh, A.: Variable neighborhood search based evolutionary algorithm and several approximations for balanced location-allocation design problem. Int. J. Adv. Manuf. Technol. 72, 145\u2013159 (2014)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"9727_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.3166\/jds.19.225-252","volume":"19","author":"M Souki","year":"2010","unstructured":"Souki, M., Rebai, A.: Heuristics for the operating theatre planning and scheduling. J. Decis. Syst. 19, 225\u2013252 (2010)","journal-title":"J. Decis. Syst."},{"key":"9727_CR26","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. Comput. Oper. Res. 38, 1400\u20131411 (2011)","journal-title":"Comput. Oper. Res."},{"key":"9727_CR27","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., Vanden Berghe, G., \u00d6zcan, E.: Cooperative search for fair nurse rosters. Expert Syst. Appl. 40, 6674\u20136683 (2013)","journal-title":"Expert Syst. Appl."},{"key":"9727_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.omega.2016.08.008","volume":"70","author":"P Detti","year":"2017","unstructured":"Detti, P., Papalini, F., de Lara, G.Z.M.: A multi-depot dial-a-ride problem with heterogeneous vehicles and compatibility constraints in healthcare. Omega. 70, 1\u201314 (2017)","journal-title":"Omega."},{"key":"9727_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/net.20335","volume":"54","author":"SN Parragh","year":"2010","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F., Gandibleux, X.: A heuristic two-phase solution approach for the multi-objective dial-a-ride problem. Networks. 54, 227\u2013242 (2010)","journal-title":"Networks."},{"key":"9727_CR30","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cor.2016.07.020","volume":"77","author":"Y Molenbruch","year":"2017","unstructured":"Molenbruch, Y., Braekers, K., Caris, A., Vanden Berghe, G.: Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. Comput. Oper. Res. 77, 58\u201371 (2017)","journal-title":"Comput. Oper. Res."},{"key":"9727_CR31","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.cor.2014.06.001","volume":"51","author":"F Kocat\u00fcrk","year":"2014","unstructured":"Kocat\u00fcrk, F., \u00d6zpeynirci, \u00d6.: Variable neighborhood search for the pharmacy duty scheduling problem. Comput. Oper. Res. 51, 218\u2013226 (2014)","journal-title":"Comput. Oper. Res."},{"key":"9727_CR32","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. J. Oper. Res. Soc. 62, 1227\u20131238 (2011)","journal-title":"J. Oper. Res. Soc."},{"key":"9727_CR33","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10951-012-0278-9","volume":"15","author":"SV Jeri\u0107","year":"2012","unstructured":"Jeri\u0107, S.V., Figueira, J.R.: Multi-objective scheduling and a resource allocation problem in hospitals. J. Sched. 15, 513\u2013535 (2012)","journal-title":"J. Sched."},{"key":"9727_CR34","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","volume":"38","author":"M Schilde","year":"2011","unstructured":"Schilde, M., Doerner, K.F., Hartl, R.F.: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Comput. Oper. Res. 38, 1719\u20131730 (2011)","journal-title":"Comput. Oper. Res."},{"key":"9727_CR35","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., Della Croce, F., Salassa, F.: A variable neighborhood search based matheuristic for nurse rostering problems. Ann. Oper. Res. 218, 185\u2013199 (2014)","journal-title":"Ann. Oper. Res."},{"key":"9727_CR36","doi-asserted-by":"crossref","unstructured":"Burke, E., De Causmaecker, P., Petrovic, S., Vanden Berghe, G.: Variable neighborhood search for nurse rostering problems. Metaheuristics: Computer Decision-Making. 153\u2013172 (2003)","DOI":"10.1007\/978-1-4757-4137-7_7"},{"key":"9727_CR37","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.ejor.2009.06.003","volume":"202","author":"V Hemmelmayr","year":"2010","unstructured":"Hemmelmayr, V., Doerner, K.F., Hartl, R.F., Savelsbergh, M.W.P.: Vendor managed inventory for environments with stochastic product usage. Eur. J. Oper. Res. 202, 686\u2013695 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9727_CR38","first-page":"1","volume":"2012","author":"A Salehipour","year":"2012","unstructured":"Salehipour, A., Sepehri, M.M.: Exact and heuristic solutions to minimize Total waiting time in the blood products distribution problem. Adv. Oper. Res. 2012, 1\u201325 (2012)","journal-title":"Adv. Oper. Res."},{"key":"9727_CR39","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1287\/trsc.2015.0611","volume":"51","author":"A Lim","year":"2016","unstructured":"Lim, A., Zhang, Z., Qin, H.: Pickup and delivery service with manpower planning in Hong Kong public hospitals. Transp. Sci. 51, 688\u2013705 (2016)","journal-title":"Transp. Sci."},{"key":"9727_CR40","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. Comput. Ind. Eng. 110, 165\u2013174 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"9727_CR41","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10729-013-9262-y","volume":"17","author":"N Rego","year":"2014","unstructured":"Rego, N., Claro, J., Pinho de Sousa, J.: A hybrid approach for integrated healthcare cooperative purchasing and supply chain configuration. Health Care Manag. Sci. 17, 303\u2013320 (2014)","journal-title":"Health Care Manag. Sci."},{"key":"9727_CR42","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/net.21566","volume":"64","author":"A Trautsamwieser","year":"2014","unstructured":"Trautsamwieser, A., Hirsch, P.: A branch-Price-and-cut approach for solving the medium-term home health care planning problem. Networks. 64, 143\u2013159 (2014)","journal-title":"Networks."},{"key":"9727_CR43","first-page":"124","volume":"3","author":"A Trautsamwieser","year":"2011","unstructured":"Trautsamwieser, A., Hirsch, P.: Optimization of daily scheduling for home health care services. J. Appl. Oper. Res. 3, 124\u2013136 (2011)","journal-title":"J. Appl. Oper. Res."},{"key":"9727_CR44","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s00291-008-0134-7","volume":"31","author":"V Hemmelmayr","year":"2009","unstructured":"Hemmelmayr, V., Doerner, K.F., Hartl, R.F., Savelsbergh, M.W.P.: Delivery strategies for blood products supplies. OR Spectr. 31, 707\u2013725 (2009)","journal-title":"OR Spectr."},{"key":"9727_CR45","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10100-013-0305-8","volume":"23","author":"G Hiermann","year":"2013","unstructured":"Hiermann, G., Prandtstetter, M., Rendl, A., Puchinger, J., Raidl, G.R.: Metaheuristics for solving a multimodal home-healthcare scheduling problem. Cent. Eur. J. Oper. Res. 23, 89\u2013113 (2013)","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"9727_CR46","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., Qu, R., Veltman, B.: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur. J. Oper. Res. 188, 330\u2013341 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9727_CR47","doi-asserted-by":"crossref","unstructured":"Kergosien, Y., Ruiz, A., Soriano, P.: A routing problem for medical test sample collection in home health care services. Proceedings of the International Conference on Health Care Systems Engineering. 29\u201346 (2014)","DOI":"10.1007\/978-3-319-01848-5_3"},{"key":"9727_CR48","doi-asserted-by":"crossref","unstructured":"Souki, M., Youssef, S. B., Rebai, A.: Memetic algorithm for operating room admissions. In: International Conference on Computers & Industrial Engineering. 519\u2013524 (2009)","DOI":"10.1109\/ICCIE.2009.5223833"},{"key":"9727_CR49","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). 2011 3rd Conference on Data Mining and Optimization (DMO). 178\u2013183 (2011)","DOI":"10.1109\/DMO.2011.5976524"},{"key":"9727_CR50","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.cor.2016.05.013","volume":"84","author":"N Dellaert","year":"2017","unstructured":"Dellaert, N., Jeunet, J.: A variable neighborhood search algorithm for the surgery tactical planning problem. Comput. Oper. Res. 84, 216\u2013225 (2017)","journal-title":"Comput. Oper. Res."},{"key":"9727_CR51","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.endm.2017.03.005","volume":"58","author":"RAM Gomes","year":"2017","unstructured":"Gomes, R.A.M., Toffolo, T.A.M., Santos, H.G.: Variable neighborhood search accelerated column generation for the nurse rostering problem. Electron Notes Discrete Math. 58, 31\u201338 (2017)","journal-title":"Electron Notes Discrete Math."},{"key":"9727_CR52","doi-asserted-by":"publisher","first-page":"2866","DOI":"10.1016\/j.cor.2005.01.015","volume":"33","author":"S Bertels","year":"2006","unstructured":"Bertels, S., Fahle, T.: A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput. Oper. Res. 33, 2866\u20132890 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9727_CR53","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.ejor.2009.04.011","volume":"201","author":"B Cardoen","year":"2010","unstructured":"Cardoen, B., Demeulemeester, E., Beli\u00ebn, J.: Operating room planning and scheduling: a literature review. Eur. J. Oper. Res. 201, 921\u2013932 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9727_CR54","doi-asserted-by":"crossref","unstructured":"Zhu, S., Fan, W., Yang, S., Pei, J., Pardalos, P.M.: Operating room planning and surgical case scheduling: a review of literature. J. Comb. Optim. 37, 757\u2013805 (2019)","DOI":"10.1007\/s10878-018-0322-6"},{"key":"9727_CR55","first-page":"98","volume":"11","author":"M Hamid","year":"2018","unstructured":"Hamid, M., Barzinpour, F., Hamid, M., Mirzamohammadi, S.: A multi-objective mathematical model for nurse scheduling problem with hybrid DEA and augmented \u03b5 -constraint method: A case study. 14th Int. Ind. Eng. Conf. 11, 98\u2013108 (2018)","journal-title":"14th Int. Ind. Eng. Conf."},{"key":"9727_CR56","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1111\/itor.12282","volume":"24","author":"A Mjirda","year":"2017","unstructured":"Mjirda, A., Todosijevi\u0107, R., Hanafi, S., Hansen, P., Mladenovi\u0107, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24, 615\u2013633 (2017)","journal-title":"Int. Trans. Oper. Res."},{"key":"9727_CR57","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F Glover","year":"1996","unstructured":"Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discret. Appl. Math. 65, 223\u2013253 (1996)","journal-title":"Discret. Appl. Math."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09727-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-021-09727-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-021-09727-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T05:37:04Z","timestamp":1698644224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-021-09727-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,11]]},"references-count":57,"journal-issue":{"issue":"8-9","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["9727"],"URL":"https:\/\/doi.org\/10.1007\/s10472-021-09727-5","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,11]]},"assertion":[{"value":"3 January 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}