{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:09:43Z","timestamp":1768262983168,"version":"3.49.0"},"reference-count":77,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,10,24]],"date-time":"2015-10-24T00:00:00Z","timestamp":1445644800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00521-015-2076-8","type":"journal-article","created":{"date-parts":[[2015,10,24]],"date-time":"2015-10-24T21:44:41Z","timestamp":1445723081000},"page":"463-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Hybridization of harmony search with hill climbing for highly constrained nurse rostering problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Mohammed A.","family":"Awadallah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahamad Tajudin","family":"Khader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaju La\u2019aro","family":"Bolaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmud","family":"Alkoffash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,24]]},"reference":[{"issue":"1","key":"2076_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-010-0769-z","volume":"194","author":"M Al-Betar","year":"2012","unstructured":"Al-Betar M, Khader A (2012) A harmony search algorithm for university course timetabling. Ann Oper Res 194(1):3\u201331","journal-title":"Ann Oper Res"},{"issue":"10","key":"2076_CR2","doi-asserted-by":"crossref","first-page":"6095","DOI":"10.1016\/j.amc.2011.11.095","volume":"218","author":"M Al-Betar","year":"2011","unstructured":"Al-Betar M, Doush I, Khader A, Awadallah M (2011) Novel selection schemes for harmony search. Appl Math Comput 218(10):6095\u20136117","journal-title":"Appl Math Comput"},{"issue":"1","key":"2076_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-013-1500-7","volume":"218","author":"M Al-Betar","year":"2014","unstructured":"Al-Betar M, Khader A, Doush I (2014) Memetic techniques for examination timetabling. Ann Oper Res 218(1):23\u201350","journal-title":"Ann Oper Res"},{"issue":"5","key":"2076_CR4","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1109\/TSMCC.2011.2174356","volume":"42","author":"MA Al-Betar","year":"2012","unstructured":"Al-Betar MA, Khader AT, Zaman M (2012) University course timetabling using a hybrid harmony search metaheuristic algorithm. IEEE Trans Syst Man Cybern Part C Appl Rev 42(5):664\u2013681","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"key":"2076_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-81-322-1038-2_24","volume-title":"Proceedings of seventh international conference on bio-inspired computing: theories and applications (BIC-TA 2012), advances in intelligent systems and computing","author":"MA Al-Betar","year":"2013","unstructured":"Al-Betar MA, Ahmad ON, Khader AT, Awadallah MA (2013a) Incorporating great deluge with harmony search for global optimization problems. In: Bansal JC, Singh PK, Deep K, Pant M, Nagar A (eds) Proceedings of seventh international conference on bio-inspired computing: theories and applications (BIC-TA 2012), advances in intelligent systems and computing, vol 201. Springer, India, pp 275\u2013286. doi: 10.1007\/978-81-322-1038-2_24"},{"key":"2076_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2013\/139464","volume":"2013","author":"MA Al-Betar","year":"2013","unstructured":"Al-Betar MA, Khader AT, Awadallah MA, Alawan MH, Zaqaibeh B (2013) Cellular harmony search for optimization problems. J Appl Math 2013:1\u201320. doi: 10.1155\/2013\/139464","journal-title":"J Appl Math"},{"issue":"22","key":"2076_CR7","doi-asserted-by":"crossref","first-page":"10,753","DOI":"10.1016\/j.amc.2013.04.053","volume":"219","author":"MA Al-Betar","year":"2013","unstructured":"Al-Betar MA, Khader AT, Geem ZW, Doush IA, Awadallah MA (2013c) An analysis of selection methods in memory consideration for harmony search. Appl Math Comput 219(22):10,753\u201310,767","journal-title":"Appl Math Comput"},{"issue":"4","key":"2076_CR8","doi-asserted-by":"crossref","first-page":"2026","DOI":"10.1016\/j.eswa.2014.10.008","volume":"42","author":"MA Al-Betar","year":"2015","unstructured":"Al-Betar MA, Awadallah MA, Khader AT, Abdalkareem ZA (2015) Island-based harmony search for optimization problems. Expert Syst Appl 42(4):2026\u20132035","journal-title":"Expert Syst Appl"},{"issue":"1","key":"2076_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10462-010-9201-y","volume":"36","author":"O Alia","year":"2011","unstructured":"Alia O, Mandava R (2011) The variants of the harmony search algorithm: an overview. Artif Intell Rev 36(1):49\u201368","journal-title":"Artif Intell Rev"},{"key":"2076_CR10","doi-asserted-by":"crossref","unstructured":"Anwar K, Awadallah MA, Khader AT, Al-Betar MA (2014) Hyper-heuristic approach for solving nurse rostering problem. In: 2014 IEEE symposium on computational intelligence in ensemble learning (CIEL), pp 1\u20136","DOI":"10.1109\/CIEL.2014.7015743"},{"key":"2076_CR11","doi-asserted-by":"publisher","unstructured":"Asaju LB, Awadallah MA, Al-Betar MA, Khader AT (2015) Solving nurse rostering problem using artificial bee colony algorithm. In: ICIT 2015 the 7th international conference on information technology, 32\u201338. doi: 10.15849\/icit.2015.0005","DOI":"10.15849\/icit.2015.0005"},{"key":"2076_CR12","doi-asserted-by":"crossref","unstructured":"Awadallah M, Khader A, Al-Betar M, Bolaji A (2011a) Nurse rostering using modified harmony search algorithm. In: Panigrahi B, Suganthan P, Das S, Satapathy S (eds) Swarm, evolutionary, and memetic computing, vol 7077., Lecture notes in computer science. Springer, Berlin Heidelberg, pp 27\u201337","DOI":"10.1007\/978-3-642-27242-4_4"},{"key":"2076_CR13","doi-asserted-by":"crossref","unstructured":"Awadallah M, Khader A, Al-Betar M, Bolaji A (2011b) Nurse scheduling using harmony search. In: Sixth international conference on bio-inspired computing: theories and applications (BIC-TA), 2011, pp 58\u201363","DOI":"10.1109\/BIC-TA.2011.75"},{"issue":"2","key":"2076_CR14","doi-asserted-by":"crossref","first-page":"22","DOI":"10.4018\/jncr.2012040102","volume":"3","author":"M Awadallah","year":"2012","unstructured":"Awadallah M, Khader A, Al-Betar M, Bolaji A (2012a) Harmony search with greedy shuffle for nurse rostering. Int J Nat Comput Res (IJNCR) 3(2):22\u201342","journal-title":"Int J Nat Comput Res (IJNCR)"},{"key":"2076_CR15","doi-asserted-by":"crossref","unstructured":"Awadallah M, Khader A, Al-Betar M, Woon P (2012b) Office-space-allocation problem using harmony search algorithm. In: Huang T, Zeng Z, Li C, Leung C (eds) Neural information processing, vol 7664., lecture notes in computer science. Springer, Berlin, pp 365\u2013374","DOI":"10.1007\/978-3-642-34481-7_45"},{"issue":"2","key":"2076_CR16","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.jksuci.2012.10.004","volume":"25","author":"M Awadallah","year":"2013","unstructured":"Awadallah M, Khader A, Al-Betar M, Bolaji A (2013a) Global best harmony search with a new pitch adjustment designed for nurse rostering. J King Saud Univ Comput Inf Sci 25(2):145\u2013162","journal-title":"J King Saud Univ Comput Inf Sci"},{"issue":"3","key":"2076_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217595914500146","volume":"31","author":"M Awadallah","year":"2014","unstructured":"Awadallah M, Khader A, Al-Betar M, Bolaji A (2014) Harmony search with novel selection methods in memory consideration for nurse rostering problem. Asia Pac J Oper Res 31(3):1\u201339. doi: 10.1142\/S0217595914500146","journal-title":"Asia Pac J Oper Res"},{"key":"2076_CR18","doi-asserted-by":"crossref","unstructured":"Awadallah MA, Khader AT, Al-Betar MA, Bolaji AL (2013) Hybrid harmony search for nurse rostering problems. 2013 IEEE Symposium on computational intelligence in scheduling (SCIS) pp 60\u201367","DOI":"10.1109\/SCIS.2013.6613253"},{"issue":"3","key":"2076_CR19","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0305-0548(03)00249-1","volume":"32","author":"M Azaiez","year":"2005","unstructured":"Azaiez M, Al Sharif S (2005) A 0\u20131 goal programming model for nurse scheduling. Comput Oper Res 32(3):491\u2013508","journal-title":"Comput Oper Res"},{"issue":"4","key":"2076_CR20","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TEVC.2009.2033583","volume":"14","author":"R Bai","year":"2010","unstructured":"Bai R, Burke E, Kendall G, Li J, McCollum B (2010) A hybrid evolutionary approach to the nurse rostering problem. IEEE Trans Evolut Comput 14(4):580\u2013590","journal-title":"IEEE Trans Evolut Comput"},{"issue":"2","key":"2076_CR21","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ejor.2003.06.046","volume":"164","author":"J Bard","year":"2005","unstructured":"Bard J, Purnomo H (2005) Preference scheduling for nurses using column generation. Eur J Oper Res 164(2):510\u2013534","journal-title":"Eur J Oper Res"},{"issue":"12","key":"2076_CR22","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1057\/palgrave.jors.2602304","volume":"58","author":"G Beddoe","year":"2006","unstructured":"Beddoe G, Petrovic S (2006) Enhancing case-based reasoning for personnel rostering with selected tabu search concepts. J Oper Res Soc 58(12):1586\u20131598","journal-title":"J Oper Res Soc"},{"issue":"3","key":"2076_CR23","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10732-011-9192-0","volume":"18","author":"B Bilgin","year":"2012","unstructured":"Bilgin B, Demeester P, Misir M, Vancroonenburg W, Vanden Berghe G (2012) One hyper-heuristic approach to two timetabling problems in health care. J Heuristics 18(3):401\u2013434","journal-title":"J Heuristics"},{"issue":"3","key":"2076_CR24","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E Burke","year":"2001","unstructured":"Burke E, Cowling P, De Causmaecker P, Berghe G (2001a) A memetic approach to the nurse rostering problem. Appl Intell 15(3):199\u2013214","journal-title":"Appl Intell"},{"issue":"6","key":"2076_CR25","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E Burke","year":"2004","unstructured":"Burke E, De Causmaecker P, Berghe G, Van Landeghem H (2004a) The state of the art of nurse rostering. J Sched 7(6):441\u2013499","journal-title":"J Sched"},{"key":"2076_CR26","first-page":"153","volume-title":"Metaheuristics: computer decision-making, chapter 7","author":"E Burke","year":"2004","unstructured":"Burke E, De Causmaecker P, Petrovic S, Berghe GV (2004b) Variable neighbourhood search for nurse rostering problems. In: Resende MGC, de Sousa JP, Viana A (eds) Metaheuristics: computer decision-making, chapter 7. Kluwer Academic Publishers, Norwell, pp 153\u2013172"},{"issue":"2","key":"2076_CR27","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/j.ejor.2007.04.030","volume":"188","author":"E Burke","year":"2008","unstructured":"Burke E, Curtois T, Post G, Qu R, Veltman B (2008) A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur J Oper Res 188(2):330\u2013341","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2076_CR28","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.ejor.2009.07.036","volume":"203","author":"E Burke","year":"2010","unstructured":"Burke E, Li J, Qu R (2010) A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. Eur J Oper Res 203(2):484\u2013493","journal-title":"Eur J Oper Res"},{"issue":"1","key":"2076_CR29","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10479-009-0590-8","volume":"196","author":"E Burke","year":"2012","unstructured":"Burke E, Li J, Qu R (2012) A pareto-based search methodology for multi-objective nurse scheduling. Ann Oper Res 196(1):91\u2013109","journal-title":"Ann Oper Res"},{"issue":"1","key":"2076_CR30","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ejor.2014.01.039","volume":"237","author":"EK Burke","year":"2014","unstructured":"Burke EK, Curtois T (2014) New approaches to nurse rostering benchmark instances. Eur J Oper Res 237(1):71\u201381","journal-title":"Eur J Oper Res"},{"issue":"3","key":"2076_CR31","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(03)00021-3","volume":"151","author":"B Cheang","year":"2003","unstructured":"Cheang B, Li H, Lim A, Rodrigues B (2003) Nurse rostering problems-a bibliographic survey. Eur J Oper Res 151(3):447\u2013460","journal-title":"Eur J Oper Res"},{"issue":"3","key":"2076_CR32","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"Jorne V Bergh Den","year":"2013","unstructured":"Den Bergh Jorne V, Bruecker Philippe D, Erik D, Boeck Liesje D (2013) Personnel scheduling: a literature review. Eur J Oper Res 226(3):367\u2013385","journal-title":"Eur J Oper Res"},{"issue":"2\u20133","key":"2076_CR33","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"K Dowsland","year":"1998","unstructured":"Dowsland K (1998) Nurse scheduling with tabu search and strategic oscillation. Eur J Oper Res 106(2\u20133):393\u2013407","journal-title":"Eur J Oper Res"},{"key":"2076_CR34","doi-asserted-by":"crossref","unstructured":"Gao XZ, Jokinen T, Wang X, Ovaska S, Arkkio A (2010) A new harmony search method in optimal wind generator design. In: 2010 XIX international conference on electrical machines (ICEM). Rome, pp 1\u20136","DOI":"10.1109\/ICELMACH.2010.5608219"},{"key":"2076_CR35","doi-asserted-by":"crossref","unstructured":"Geem Z (2005) Harmony search in water pump switching problem. In: Wang L, Chen K, Ong Y (eds) Advances in natural computation, vol 3612., lecture notes in computer science. Springer, Berlin, pp 751\u2013760","DOI":"10.1007\/11539902_92"},{"issue":"3","key":"2076_CR36","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/03052150500467430","volume":"38","author":"Z Geem","year":"2006","unstructured":"Geem Z (2006) Optimal cost design of water distribution networks using harmony search. Eng Optim 38(3):259\u2013277","journal-title":"Eng Optim"},{"key":"2076_CR37","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-540-77465-5_6","volume-title":"Soft computing applications in industry, studies in fuzziness and soft computing","author":"Z Geem","year":"2008","unstructured":"Geem Z (2008a) Harmony search applications in industry. In: Prasad B (ed) Soft computing applications in industry, studies in fuzziness and soft computing, vol 226. Springer, Berlin, pp 117\u2013134"},{"issue":"1","key":"2076_CR38","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.amc.2007.09.049","volume":"199","author":"Z Geem","year":"2008","unstructured":"Geem Z (2008b) Novel derivative of harmony search algorithm for discrete design variables. Appl Math Comput 199(1):223\u2013230","journal-title":"Appl Math Comput"},{"issue":"2","key":"2076_CR39","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"Z Geem","year":"2001","unstructured":"Geem Z, Kim J, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60\u201368","journal-title":"Simulation"},{"issue":"12","key":"2076_CR40","doi-asserted-by":"crossref","first-page":"1552","DOI":"10.3844\/ajassp.2005.1552.1557","volume":"2","author":"Z Geem","year":"2005","unstructured":"Geem Z, Lee K, Park Y (2005a) Application of harmony search to vehicle routing. Am J Appl Sci 2(12):1552\u20131557","journal-title":"Am J Appl Sci"},{"key":"2076_CR41","first-page":"741","volume-title":"Advances in natural computation, vol 3612, lecture notes in computer science","author":"Z Geem","year":"2005","unstructured":"Geem Z, Tseng CL, Park Y (2005b) Harmony search for generalized orienteering problem: best touring in china. In: Wang L, Chen K, Ong Y (eds) Advances in natural computation, vol 3612, lecture notes in computer science. Springer, Berlin, pp 741\u2013750"},{"key":"2076_CR42","unstructured":"Geem ZW, Kim JH (2014) Wastewater treatment optimization for fish migration using harmony search. Math Prob Eng 2014"},{"issue":"8","key":"2076_CR43","doi-asserted-by":"crossref","first-page":"3881","DOI":"10.1016\/j.amc.2010.09.049","volume":"217","author":"ZW Geem","year":"2010","unstructured":"Geem ZW, Sim KB (2010) Parameter-setting-free harmony search algorithm. Appl Math Comput 217(8):3881\u20133889","journal-title":"Appl Math Comput"},{"issue":"3","key":"2076_CR44","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","volume":"34","author":"W Gutjahr","year":"2007","unstructured":"Gutjahr W, Rauner M (2007) An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Comput Oper Res 34(3):642\u2013666","journal-title":"Comput Oper Res"},{"key":"2076_CR45","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.ins.2012.12.025","volume":"233","author":"M Hadwan","year":"2013","unstructured":"Hadwan M, Ayob M, Sabar NR, Qu R (2013) A harmony search algorithm for nurse rostering problems. Inf Sci 233:126\u2013140","journal-title":"Inf Sci"},{"issue":"1","key":"2076_CR46","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10479-012-1062-0","volume":"218","author":"S Haspeslagh","year":"2014","unstructured":"Haspeslagh S, DeCausmaecker P, Schaerf A, Stlevik M (2014) The first international nurse rostering competition 2010. Ann Oper Res 218(1):221\u2013236. doi: 10.1007\/s10479-012-1062-0","journal-title":"Ann Oper Res"},{"key":"2076_CR47","unstructured":"Hofe H (1997) Conplan\/siedaplan: Personnel assignment as a problem of hierarchical constraint satisfaction. In: Proceedings of the 3rd international conference on practical applications of constraint technologies (PACT-97), vol\u00a097, pp 257\u2013271"},{"issue":"3\u20134","key":"2076_CR48","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1007\/s00521-013-1536-2","volume":"25","author":"H Huang","year":"2014","unstructured":"Huang H, Lin W, Lin Z, Hao Z, Lim A (2014) An evolutionary algorithm based on constraint set partitioning for nurse rostering problems. Neural Comput Appl 25(3\u20134):703\u2013715","journal-title":"Neural Comput Appl"},{"key":"2076_CR49","doi-asserted-by":"publisher","unstructured":"Inbarani H, Bagyamathi M, Azar A (2015) A novel hybrid feature selection method based on rough set and improved harmony search. Neural Comput Appl 1\u201322. doi: 10.1007\/s00521-015-1840-0","DOI":"10.1007\/s00521-015-1840-0"},{"issue":"3","key":"2076_CR50","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/s10729-008-9087-2","volume":"12","author":"ML Grano De","year":"2009","unstructured":"De Grano ML, Medeiros D, Eitel D (2009) Accommodating individual preferences in nurse scheduling via auctions and optimization. Health Care Manag Sci 12(3):228\u2013242","journal-title":"Health Care Manag Sci"},{"key":"2076_CR51","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/978-3-540-79438-7_7","volume-title":"Adaptive and multilevel metaheuristics, studies in computational intelligence","author":"D Landa-silva","year":"2008","unstructured":"Landa-silva D, Le K (2008) A simple evolutionary algorithm with self-adaptation for multi-objective nurse scheduling. In: Cotta C, Sevaux M, Srensen K (eds) Adaptive and multilevel metaheuristics, studies in computational intelligence, vol 136. Springer, Berlin, pp 133\u2013155"},{"issue":"36\u201338","key":"2076_CR52","doi-asserted-by":"crossref","first-page":"3902","DOI":"10.1016\/j.cma.2004.09.007","volume":"194","author":"K Lee","year":"2005","unstructured":"Lee K, Geem Z (2005) A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput Methods Appl Mech Eng 194(36\u201338):3902\u20133933","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"7","key":"2076_CR53","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1080\/03052150500211895","volume":"37","author":"K Lee","year":"2005","unstructured":"Lee K, Geem Z, Lee S, Bae K (2005) The harmony search heuristic algorithm for discrete structural optimization. Eng Optim 37(7):663\u2013684","journal-title":"Eng Optim"},{"key":"2076_CR54","unstructured":"Li J, Aickelin U (2003) A Bayesian optimization algorithm for the nurse scheduling problem. In: Proceedings of the IEEE Congress on evolutionary computation (CEC 2003), Canberra, Australia, vol\u00a03, pp 2149\u20132156"},{"issue":"3","key":"2076_CR55","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1016\/j.ejor.2011.12.016","volume":"218","author":"Z L\u00fc","year":"2011","unstructured":"L\u00fc Z, Hao J (2011) Adaptive neighborhood search for nurse rostering. Eur J Oper Res 218(3):865\u2013876","journal-title":"Eur J Oper Res"},{"issue":"4","key":"2076_CR56","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10732-007-9013-7","volume":"13","author":"B Maenhout","year":"2007","unstructured":"Maenhout B, Vanhoucke M (2007) An electromagnetic meta-heuristic for the nurse scheduling problem. J Heuristics 13(4):359\u2013385","journal-title":"J Heuristics"},{"issue":"8","key":"2076_CR57","doi-asserted-by":"crossref","first-page":"1818","DOI":"10.1016\/j.engappai.2013.05.008","volume":"26","author":"D Manjarres","year":"2013","unstructured":"Manjarres D, Landa-Torres I, Gil-Lopez S, Del Ser J, Bilbao M, Salcedo-Sanz S, Geem Z (2013) A survey on applications of the harmony search algorithm. Eng Appl Artif Intell 26(8):1818\u20131831","journal-title":"Eng Appl Artif Intell"},{"key":"2076_CR58","unstructured":"Mason A, Smith M (1998) A nested column generator for solving rostering problems with integer programming. In: Caccetta LSPLYJL, SPLYJL Teo KL, V R (eds) International conference on optimisation: techniques and applications. Citeseer, pp 827\u2013834"},{"issue":"3","key":"2076_CR59","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/S0377-2217(97)00006-4","volume":"104","author":"H Millar","year":"1998","unstructured":"Millar H, Kiragu M (1998) Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. Eur J Oper Res 104(3):582\u2013592","journal-title":"Eur J Oper Res"},{"issue":"3","key":"2076_CR60","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.cor.2005.03.019","volume":"34","author":"M Moz","year":"2007","unstructured":"Moz M, Vaz Pato M (2007) A genetic algorithm approach to a nurse rerostering problem. Comput Oper Res 34(3):667\u2013691","journal-title":"Comput Oper Res"},{"key":"2076_CR61","doi-asserted-by":"publisher","unstructured":"Nekkaa M, Boughaci D (2015) Hybrid harmony search combined with stochastic local search for feature selection. Neural Process Lett pp 1\u201322. doi: 10.1007\/s11063-015-9450-5","DOI":"10.1007\/s11063-015-9450-5"},{"key":"2076_CR62","unstructured":"Nonobe K (2010) Inrc2010: An approach using a general constraint optimization solver. Tech. rep., INRC2010 ( http:\/\/www.kuleuven-kortrijk.be\/nrpcompetition )"},{"issue":"2","key":"2076_CR63","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0377-2217(97)00294-4","volume":"106","author":"K Nonobe","year":"1998","unstructured":"Nonobe K, Ibaraki T (1998) A tabu search approach to the constraint satisfaction problem as a general problem solver. Eur J Oper Res 106(2):599\u2013623","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2076_CR64","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.amc.2007.09.004","volume":"198","author":"M Omran","year":"2008","unstructured":"Omran M, Mahdavi M (2008) Global-best harmony search. Appl Math Comput 198(2):643\u2013656","journal-title":"Appl Math Comput"},{"key":"2076_CR65","doi-asserted-by":"crossref","unstructured":"Osogami T, Imai H (2000) Classification of various neighborhood operations for the nurse scheduling problem. In: Goos G, Hartmanis J, Leeuwen J, Lee D, Teng SH (eds) Algorithms and computation, vol 1969., lecture notes in computer science. Springer, Berlin pp 72\u201383","DOI":"10.1007\/3-540-40996-3_7"},{"key":"2076_CR66","first-page":"482","volume-title":"Proceedings of the 20th international conference on computer and information sciences, ISCIS\u201905","author":"E \u00d6zcan","year":"2005","unstructured":"\u00d6zcan E (2005) Memetic algorithms for nurse rostering. Proceedings of the 20th international conference on computer and information sciences, ISCIS\u201905, vol 3733. Springer, Berlin, pp 482\u2013492"},{"key":"2076_CR67","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/978-1-84882-215-3_16","volume-title":"Applications and innovations in intelligent systems XVI","author":"R Qu","year":"2009","unstructured":"Qu R, He F (2009) A hybrid constraint programming approach for nurse rostering problems. In: Allen T, Ellis R, Petridis M (eds) Applications and innovations in intelligent systems XVI. Springer, London, pp 211\u2013224"},{"key":"2076_CR68","unstructured":"Rizzato D, Constantino A, Luiz\u00a0de Melo E, Landa-Silva D, W R (2010) Heuristic algorithm based on multi-assignment problems for nurse rostering problem. Tech. rep., INRC2010 ( http:\/\/www.kuleuven-kortrijk.be\/nrpcompetition )"},{"key":"2076_CR69","doi-asserted-by":"publisher","unstructured":"Santos H, Toffolo T, Gomes R, Ribas S (2014) Integer programming techniques for the nurse rostering problem. Ann Oper Res pp 1\u201327. doi: 10.1007\/s10479-014-1594-6","DOI":"10.1007\/s10479-014-1594-6"},{"key":"2076_CR70","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.ins.2013.10.012","volume":"258","author":"SS Shreem","year":"2014","unstructured":"Shreem SS, Abdullah S, Nazri MZA (2014) Hybridising harmony search with a Markov blanket for gene selection problems. Inf Sci 258:108\u2013121","journal-title":"Inf Sci"},{"key":"2076_CR71","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.cor.2015.02.009","volume":"60","author":"IX Tassopoulos","year":"2015","unstructured":"Tassopoulos IX, Solos IP, Beligiannis GN (2015) A two-phase adaptive variable neighborhood approach for nurse rostering. Comput Oper Res 60:150\u2013169. doi: 10.1016\/j.cor.2015.02.009","journal-title":"Comput Oper Res"},{"issue":"2","key":"2076_CR72","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.ejor.2011.12.042","volume":"219","author":"C Valouxis","year":"2012","unstructured":"Valouxis C, Gogos C, Goulas G, Alefragis P, Housos E (2012) A systematic two phase approach for the nurse rostering problem. Eur J Oper Res 219(2):425\u2013433","journal-title":"Eur J Oper Res"},{"issue":"4","key":"2076_CR73","doi-asserted-by":"crossref","first-page":"2826","DOI":"10.1016\/j.eswa.2009.09.008","volume":"37","author":"CM Wang","year":"2010","unstructured":"Wang CM, Huang YF (2010) Self-adaptive harmony search algorithm for optimization. Expert Syst Appl 37(4):2826\u20132837","journal-title":"Expert Syst Appl"},{"issue":"1","key":"2076_CR74","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1504\/IJBIC.2009.022776","volume":"1","author":"X Wang","year":"2009","unstructured":"Wang X, Gao XZ, Ovaska SJ (2009) Fusion of clonal selection algorithm and harmony search method in optimisation of fuzzy classification systems. Int J Bio Inspir Comput 1(1):80\u201388","journal-title":"Int J Bio Inspir Comput"},{"issue":"1","key":"2076_CR75","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ins.2011.12.035","volume":"196","author":"P Yadav","year":"2012","unstructured":"Yadav P, Kumar R, Panda S, Chang C (2012) An intelligent tuned harmony search algorithm for optimisation. Inf Sci 196(1):47\u201372","journal-title":"Inf Sci"},{"issue":"10","key":"2076_CR76","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1016\/j.jss.2010.04.070","volume":"83","author":"D Zou","year":"2010","unstructured":"Zou D, Gao L, Li S, Wu J, Wang X (2010) A novel global harmony search algorithm for task assignment problem. J Syst Softw 83(10):1678\u20131688","journal-title":"J Syst Softw"},{"issue":"4","key":"2076_CR77","doi-asserted-by":"crossref","first-page":"4642","DOI":"10.1016\/j.eswa.2010.09.120","volume":"38","author":"D Zou","year":"2011","unstructured":"Zou D, Gao L, Li S, Wu J (2011) An effective global harmony search algorithm for reliability problems. Expert Syst Appl 38(4):4642\u20134648","journal-title":"Expert Syst Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-2076-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-015-2076-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-2076-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-015-2076-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T03:53:06Z","timestamp":1748663586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-015-2076-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,24]]},"references-count":77,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["2076"],"URL":"https:\/\/doi.org\/10.1007\/s00521-015-2076-8","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,24]]}}}