{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:34:07Z","timestamp":1781109247323,"version":"3.54.1"},"reference-count":42,"publisher":"IGI Global Scientific Publishing","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4,1]]},"abstract":"<p>In this paper, a hybridization of Harmony Search Algorithm (HSA) with a greedy shuffle move is proposed for Nurse Rostering Problem (NRP). NRP is a combinatorial optimization problem that is tackled by assigning a set of nurses with different skills and contracts to different types of shifts, over a pre-determined scheduling period. HSA is a population-based method which mimics the improvisation process that has been successfully applied for a wide range of optimization problems. The performance of HSA is enhanced by hybridizing it with a greedy shuffle move. The proposed method is evaluated using a dataset defined in first International Nurse Rostering Competition (INRC2010). The hybrid HSA obtained the best results of the comparative methods in four datasets.<\/p>","DOI":"10.4018\/jncr.2012040102","type":"journal-article","created":{"date-parts":[[2012,12,5]],"date-time":"2012-12-05T18:06:31Z","timestamp":1354730791000},"page":"22-42","source":"Crossref","is-referenced-by-count":7,"title":["Harmony Search with Greedy Shuffle for Nurse Rostering"],"prefix":"10.4018","volume":"3","author":[{"given":"Mohammed A.","family":"Awadallah","sequence":"first","affiliation":[{"name":"Universiti Sains Malaysia, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahamad Tajudin","family":"Khader","sequence":"additional","affiliation":[{"name":"Universiti Sains Malaysia, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"additional","affiliation":[{"name":"Universiti Sains Malaysia, Malaysia, & Jadara University, Jordan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Asaju La\u2019aro","family":"Bolaji","sequence":"additional","affiliation":[{"name":"Universiti Sains Malaysia, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jncr.2012040102-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2011.11.095"},{"key":"jncr.2012040102-1","unstructured":"Al-Betar, M. A., & Khader, A. (2009, August). A hybrid harmony search for university course timetabling. In Proceedings of the 4nd Multidisciplinary Conference on Scheduling: Theory and Applications, Dublin, Ireland (pp. 157-179)."},{"key":"jncr.2012040102-2","doi-asserted-by":"crossref","unstructured":"Al-Betar, M. A., Khader, A. T., & Nadi, F. (2010). Selection mechanisms in memory consideration for examination timetabling with harmony search. In Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation (pp. 1203-1210).","DOI":"10.1145\/1830483.1830702"},{"key":"jncr.2012040102-3","unstructured":"Al-Betar, M. A., Khader, A. T., & Thomas, J. J. (2010, August). A combination of metaheuristic components based on harmony search for the uncapacitated examination timetabling. In Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling, Belfast, Northern Ireland (pp. 57-80)."},{"key":"jncr.2012040102-4","first-page":"1","article-title":"University course timetabling using a hybrid harmony search metaheuristic algorithm.","volume":"99","author":"M. A.Al-Betar","year":"2012","journal-title":"IEEE Transactions on Systems, Man and Cybernetics. Part C, Applications and Reviews"},{"key":"jncr.2012040102-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.03.114"},{"key":"jncr.2012040102-6","doi-asserted-by":"crossref","unstructured":"Awadallah, M., Khader, A., Al-Betar, M., & Bolaji, A. (2011). Nurse rostering using modified harmony search algorithm. In B. K. Panigrahi, P. N. Suganthan, S. Das, & S. C. Satapathy (Eds.), Proceedings of the Second International Conference on Swarm, Evolutionary, and Memetic Computing (LNCS 7077, pp. 27-37).","DOI":"10.1007\/978-3-642-27242-4_4"},{"key":"jncr.2012040102-7","doi-asserted-by":"crossref","unstructured":"Awadallah, M. A., Khader, A. T., Al-Betar, M. A., & Bolaji, A. L. (2011). Nurse scheduling using harmony search. In Proceedings of the the Sixth International Conference Bio-Inspired Computing: Theories and Applications (pp. 58-63).","DOI":"10.1109\/BIC-TA.2011.75"},{"key":"jncr.2012040102-8","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00096-1"},{"issue":"1","key":"jncr.2012040102-9","first-page":"1","article-title":"Local search neighbourhoods for dealing with a novel nurse rostering model.","volume":"194","author":"B.Bilgin","year":"2011","journal-title":"Annals of Operations Research"},{"key":"jncr.2012040102-10","unstructured":"Bilgin, B., Demeester, P., Misir, M., Vancroonenburg, W., Vanden Berghe, G., & Wauters, T. (2010). A hyper-heuristic combined with a greedy shuffle approach to the nurse rostering competition. In Proceedings of the International Narcotics Research Conference, Malm\u00f6, Sweden. Retrieved from http:\/\/www.kuleuven-kortrijk.be\/nrpcompetition"},{"key":"jncr.2012040102-11","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"key":"jncr.2012040102-12","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)00063-I"},{"key":"jncr.2012040102-13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011291030731"},{"key":"jncr.2012040102-14","unstructured":"Burke, E. K., & Curtois, T. (2010). An ejection chain method and a branch and price algorithm applied to the instances of the first international nurse rostering competition. In Proceedings of the International Narcotics Research Conference, Malm\u00f6, Sweden. Retrieved from http:\/\/www.kuleuven-kortrijk.be\/nrpcompetition"},{"key":"jncr.2012040102-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.04.030"},{"key":"jncr.2012040102-16","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2009.118"},{"key":"jncr.2012040102-17","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000046076.75950.0b"},{"key":"jncr.2012040102-18","doi-asserted-by":"crossref","unstructured":"Burke, E. K., De Causmaecker, P., & Vanden Berghe, G. (1999). A hybrid tabu search algorithm for the nurse rostering problem. In Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning (pp. 187-194).","DOI":"10.1007\/3-540-48873-1_25"},{"key":"jncr.2012040102-19","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00391-4"},{"key":"jncr.2012040102-20","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00021-3"},{"key":"jncr.2012040102-21","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00281-6"},{"key":"jncr.2012040102-22","doi-asserted-by":"crossref","unstructured":"Fesanghary, M., Mahdavi, M., Minary-Jolandan, M., & Alizadeh, Y. (2008). Hybridizing harmony search algorithm with sequential quadratic programming for engineering optimization problems. Computer Methods in Applied Mechanics and Engineering, 197(33-40), 3080-3091.","DOI":"10.1016\/j.cma.2008.02.006"},{"key":"jncr.2012040102-23","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2008.03.019"},{"key":"jncr.2012040102-24","doi-asserted-by":"crossref","unstructured":"Geem, Z. W. (2005). Harmony search in water pump switching problem. In L. Wang, K. Chen, & Y. S. Ong (Eds.), Proceedings of the First International Conference on Advances in Natural Computation (LNCS 3612, pp. 445-445).","DOI":"10.1007\/11539902_92"},{"key":"jncr.2012040102-25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77465-5_6"},{"key":"jncr.2012040102-26","doi-asserted-by":"publisher","DOI":"10.1177\/003754970107600201"},{"key":"jncr.2012040102-27","doi-asserted-by":"publisher","DOI":"10.3844\/ajassp.2005.1552.1557"},{"key":"jncr.2012040102-28","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.09.049"},{"key":"jncr.2012040102-29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.03.018"},{"key":"jncr.2012040102-30","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2009.01.003"},{"key":"jncr.2012040102-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2004.09.007"},{"key":"jncr.2012040102-32","doi-asserted-by":"publisher","DOI":"10.1080\/03052150500211895"},{"key":"jncr.2012040102-33","unstructured":"Lu, Z., & Hao, J.-K. (2010). Adaptive local search for the first international nurse rostering competition. In Proceedings of the International Narcotics Research Conference, Malm\u00f6, Sweden. Retrieved from http:\/\/www.kuleuven-kortrijk.be\/nrpcompetition"},{"key":"jncr.2012040102-34","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-007-9013-7"},{"key":"jncr.2012040102-35","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2006.11.033"},{"key":"jncr.2012040102-36","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00006-4"},{"key":"jncr.2012040102-37","unstructured":"Nonobe, K. (2010). An approach using a general constraint optimization solver. In Proceedings of the International Narcotics Research Conference, Malm\u00f6, Sweden. Retrieved from http:\/\/www.kuleuven-kortrijk.be\/nrpcompetition"},{"key":"jncr.2012040102-38","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E. (2005). Memetic algorithms for nurse rostering. In P. Yolum, T. G\u00fcng\u00f6r, F. G\u00fcrgen, & C. \u00d6zturan (Eds.), Proceedings of the 20th International Symposium on Computer and Information Sciences (LNCS 3733, pp. 482-492).","DOI":"10.1007\/11569596_51"},{"key":"jncr.2012040102-39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.11.049"},{"key":"jncr.2012040102-40","unstructured":"Valouxis, C., Gogos, C., Goulas, G., Alefragis, P., & Housos, E. (2010). A systematic two phase approach for the Nurse Rostering problem. In Proceedings of the International Narcotics Research Conference, Malm\u00f6, Sweden. Retrieved from http:\/\/www.kuleuven-kortrijk.be\/nrpcompetition"},{"key":"jncr.2012040102-41","doi-asserted-by":"crossref","unstructured":"Wren, A. (1996). Scheduling, timetabling and rostering - A special relationship? In Proceedings of the First International Conference on Practice and Theory of Automated Timetabling (pp. 46-75).","DOI":"10.1007\/3-540-61794-9_51"}],"container-title":["International Journal of Natural Computing Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=73012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T14:12:51Z","timestamp":1654092771000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jncr.2012040102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,4,1]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"URL":"https:\/\/doi.org\/10.4018\/jncr.2012040102","relation":{},"ISSN":["1947-928X","1947-9298"],"issn-type":[{"value":"1947-928X","type":"print"},{"value":"1947-9298","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,1]]}}}