{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T23:45:00Z","timestamp":1781567100253,"version":"3.54.5"},"reference-count":47,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:00:00Z","timestamp":1369094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this contribution, a generic two-phase stochastic variable neighborhood approach is applied to nurse rostering problems. The proposed algorithm is used for creating feasible and efficient nurse rosters for many different nurse rostering cases. In order to demonstrate the efficiency and generic applicability of the proposed approach, experiments with real-world input data coming from many different nurse rostering cases have been conducted. The nurse rostering instances used have significant differences in nature, structure, philosophy and the type of hard and soft constraints. Computational results show that the proposed algorithm performs better than six different existing approaches applied to the same nurse rostering input instances using the same evaluation criteria. In addition, in all cases, it manages to reach the best-known fitness achieved in the literature, and in one case, it manages to beat the best-known fitness achieved till now.<\/jats:p>","DOI":"10.3390\/a6020278","type":"journal-article","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T14:22:12Z","timestamp":1369146132000},"page":"278-308","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A Generic Two-Phase Stochastic Variable Neighborhood Approach for Effectively Solving the Nurse Rostering Problem"],"prefix":"10.3390","volume":"6","author":[{"given":"Ioannis","family":"Solos","sequence":"first","affiliation":[{"name":"Department of Business Administration of Food and Agricultural Enterprises, University of Western Greece, G. Seferi 2, 30100, Agrinio, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ioannis","family":"Tassopoulos","sequence":"additional","affiliation":[{"name":"Department of Business Administration of Food and Agricultural Enterprises, University of Western Greece, G. Seferi 2, 30100, Agrinio, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6896-5218","authenticated-orcid":false,"given":"Grigorios","family":"Beligiannis","sequence":"additional","affiliation":[{"name":"Department of Business Administration of Food and Agricultural Enterprises, University of Western Greece, G. Seferi 2, 30100, Agrinio, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2013,5,21]]},"reference":[{"key":"ref_1","unstructured":"Cooper, T.B., and Kingston, J.H. (1995). The Complexity of Timetable Construction Problems, Basser Department of Computer Science, The University of Sidney. Technical Report No. 495."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0377-2217(03)00100-0","article-title":"Using tabu search with longer term memory and relaxation to create examination timetables","volume":"153","author":"White","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TSMCC.2010.2049200","article-title":"Genetic algorithms with guided and local search strategies for university course timetabling","volume":"41","author":"Yang","year":"2011","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","article-title":"The state of the art of nurse rostering","volume":"7","author":"Burke","year":"2004","journal-title":"J. Sched."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","article-title":"Personnel scheduling: A literature review","volume":"226","author":"Demeulemeester","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","article-title":"An indirect genetic algorithm for a nurse-scheduling problem","volume":"31","author":"Aickelin","year":"2004","journal-title":"Comput. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TEVC.2009.2033583","article-title":"A hybrid evolutionary approach to the nurse rostering problem","volume":"14","author":"Bai","year":"2010","journal-title":"Trans. Evolut. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1400","DOI":"10.1016\/j.cor.2010.12.012","article-title":"An evolutionary approach for the nurse rostering problem","volume":"38","author":"Maenhout","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_9","unstructured":"Burke, E., and Soubeiga, E. (2003, January 13\u201316). Scheduling Nurses Using a Tabu-search Hyperheuristic. Proceeding of the 1st Multidisciplinary International Scheduling Conference (MISTA 2003), Nottingham, UK."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Oughalime, A., Ismail, W.R., and Yeun, L.C. (2008, January 26\u201328). A Tabu Search Approach to the Nurse Scheduling Problem. Proceeding of the International Symposium on Information Tecnhology 2008 (ITSim 2008), Kuala Lumpur, Malaysia.","DOI":"10.1109\/ITSIM.2008.4631604"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10479-007-0202-4","article-title":"Solving the multi-objective nurse scheduling problem with a weighted cost function","volume":"155","author":"Parr","year":"2007","journal-title":"Ann. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Kundu, S., Mahato, M., Mahanty, B., and Acharyya, S. (2008, January 19\u201321). Comparative Performance of Simulated Annealing and Genetic Algorithm in Solving Nurse Scheduling Problem. Proceeding of the International Multi Conference on Engineers and Computer Sciences 2008 (IMECS 2008), Hong Kong.","DOI":"10.1109\/TENCON.2008.4766380"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Resende, M.C.G., and Pinho de Sousa, J. (2003). Metaheuristics: Computer Decision-Making, Kluwer Academic Publishers B.V.. Chapter 7.","DOI":"10.1007\/978-1-4757-4137-7"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","article-title":"A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem","volume":"188","author":"Burke","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1016\/j.ejor.2011.12.016","article-title":"Adaptive neighborhood search for nurse rostering","volume":"218","author":"Hao","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1057\/jors.2009.118","article-title":"A scatter search methodology for the nurse rostering problem","volume":"61","author":"Burke","year":"2010","journal-title":"J. Oper. Res. Soc."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/11730095_14","article-title":"New computational results for the nurse scheduling problem: A scatter search algorithm","volume":"3906","author":"Maenhout","year":"2006","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(03)00096-1","article-title":"A greedy-based neighborhood search approach to a nurse rostering problem","volume":"153","author":"Bellanti","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1057\/jors.2010.86","article-title":"Progress control in iterated local search for nurse rostering","volume":"62","author":"Burke","year":"2011","journal-title":"J. Oper. Res. Soc."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/978-3-642-12242-2_46","article-title":"Particle swarm optimization and the agent-based algorithm for a problem of staff scheduling","volume":"6025","author":"Gunther","year":"2010","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/11569596_51","article-title":"Memetic algorithms for nurse rostering","volume":"3733","author":"Ozcan","year":"2005","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","article-title":"An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria","volume":"34","author":"Gutjahr","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.48.3.444.12431","article-title":"Improvements and comparison of heuristics for solving the multisource Weber problem","volume":"48","author":"Brimberg","year":"2000","journal-title":"Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/S0377-2217(02)00884-6","article-title":"Solving the resource-constrained project scheduling problem by a variable neighborhood search","volume":"155","author":"Fleszar","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","article-title":"A variable neighborhood search for graph coloring","volume":"151","author":"Avanthay","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10732-010-9128-0","article-title":"Neighborhood analysis: A case study on curriculum-based course timetabling","volume":"17","author":"Hao","year":"2011","journal-title":"J. Heuristics"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/978-3-540-45157-0_17","article-title":"Multi-neighborhood local search with application to course timetabling","volume":"2740","author":"Schaerf","year":"2003","journal-title":"Lect. Notes Comput. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.ejor.2009.07.036","article-title":"A hybrid model of integer programming and variable neighborhood search for highly-constrained nurse rostering problems","volume":"203","author":"Burke","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2010.01.044","article-title":"Hybrid variable neighbourhood approaches to exam timetabling","volume":"206","author":"Burke","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","article-title":"Variable neighborhood decomposition search","volume":"7","author":"Hansen","year":"2001","journal-title":"J. Heuristics"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","article-title":"Variable neighbourhood search: Methods and applications","volume":"175","author":"Hansen","year":"2010","journal-title":"Ann. Oper. Res."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0933-3657(00)00062-2","article-title":"Hybrid optimization techniques for the workshift and rest assignment of nursing personnel","volume":"20","author":"Valouxis","year":"2000","journal-title":"Artif. Intell. Med."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A., and Rodrigues, B. (2003, January 9\u201312). A Hybrid AI Approach for Nurse Rostering Problem. Proceeding of the ACM Symposium on Applied Computing (SAC 2003), Melbourne, FL, USA.","DOI":"10.1145\/952532.952675"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10732-008-9099-6","article-title":"A shift sequence based approach for nurse scheduling and a new benchmark dataset","volume":"16","author":"Brucker","year":"2010","journal-title":"J. Heuristics"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1016\/j.cie.2008.07.016","article-title":"Medical doctor rostering problem in a hospital emergency department by means of genetic algorithms","volume":"56","author":"Puente","year":"2009","journal-title":"Comput. Ind. Eng."},{"key":"ref_36","first-page":"216","article-title":"Scheduling nurses using goal-programming techniques","volume":"13","author":"Musa","year":"1984","journal-title":"AIEE Trans."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/51.395324","article-title":"Constraint programming for nurse scheduling","volume":"14","author":"Weil","year":"1995","journal-title":"IEEE Eng. Med. Biol. Mag."},{"key":"ref_38","unstructured":"Automated employee scheduling benchmark instances. Available online: http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/."},{"key":"ref_39","unstructured":"Roster::Valouxis-1. Available online: http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/data\/solutions\/html\/Valouxis-1.Solution.20.html."},{"key":"ref_40","unstructured":"Leung, J. (2004). Handbook of Scheduling: Algorithms, Models and Performance Analysis, CRC Press. Chapter 44."},{"key":"ref_41","unstructured":"Roster::BCV-3.46.2. Available online: http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/data\/solutions\/html\/BCV-3.46.2.Solution.894.html."},{"key":"ref_42","unstructured":"Roster::BCV-4.13.1. Available online: http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/data\/solutions\/html\/BCV-4.13.1.Solution.10.html."},{"key":"ref_43","unstructured":"Roster::HED01. Available online: http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/data\/solutions\/html\/HED01.Solution.136.html."},{"key":"ref_44","unstructured":"Roster LLR. Available online: http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/data\/solutions\/html\/LLR.Solution.301.html."},{"key":"ref_45","unstructured":"Roster::Musa. Available online: http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/data\/solutions\/html\/Musa.Solution.175.html."},{"key":"ref_46","unstructured":"Roster::WHPP. Available online: http:\/\/www.cs.nott.ac.uk\/~tec\/NRP\/data\/solutions\/html\/WHPP.Solution.5.html."},{"key":"ref_47","unstructured":"Applying a stochastic variable neighborhood search algorithm on nurse rostering benchmark instances. Executables and results. Available online: http:\/\/www.deapt.uwg.gr\/nurse_rostering\/nurse_rostering.html."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/6\/2\/278\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:46:50Z","timestamp":1760219210000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/6\/2\/278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,21]]},"references-count":47,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,6]]}},"alternative-id":["a6020278"],"URL":"https:\/\/doi.org\/10.3390\/a6020278","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,21]]}}}