{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T17:18:32Z","timestamp":1725643112336},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642272417"},{"type":"electronic","value":"9783642272424"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-27242-4_4","type":"book-chapter","created":{"date-parts":[[2011,12,13]],"date-time":"2011-12-13T12:55:15Z","timestamp":1323780915000},"page":"27-37","source":"Crossref","is-referenced-by-count":18,"title":["Nurse Rostering Using Modified Harmony Search Algorithm"],"prefix":"10.1007","author":[{"given":"Mohammed A.","family":"Awadallah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahamad Tajudin","family":"Khader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Azmi","family":"Al-Betar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaju La\u2019aro","family":"Bolaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U. Aickelin","year":"2004","unstructured":"Aickelin, U., Dowsland, K.: An indirect genetic algorithm for a nurse-scheduling problem. Computers & Operations Research\u00a031(5), 76\u2013778 (2004)","journal-title":"Computers & Operations Research"},{"key":"4_CR2","unstructured":"Al-Betar, M., Khader, A.: A hybrid harmony search for university course timetabling. In: Proceedings of the 4nd Multidisciplinary Conference on Scheduling: Theory and Applications (MISTA 2009), Dublin, Ireland, pp. 10\u201312 (August 2009)"},{"key":"4_CR3","unstructured":"Al-Betar, M., Khader, A.: A harmony search algorithm for university course timetabling. Annals of Operations Research, 1\u201329 (2008)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Al-Betar, M., Khader, A., Nadi, F.: 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\u20131210. ACM (2010)","DOI":"10.1145\/1830483.1830702"},{"issue":"9","key":"4_CR5","doi-asserted-by":"publisher","first-page":"2687","DOI":"10.1016\/j.amc.2010.03.114","volume":"216","author":"B. Alatas","year":"2010","unstructured":"Alatas, B.: Chaotic harmony search algorithms. Applied Mathematics and Computation\u00a0216(9), 2687\u20132699 (2010)","journal-title":"Applied Mathematics and Computation"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Bilgin, B., De Causmaecker, P., Rossie, B., Vanden Berghe, G.: Local search neighbourhoods for dealing with a novel nurse rostering model. Annals of Operations Research, 1\u201325 (2011)","DOI":"10.1007\/s10479-010-0804-0"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0377-2217(94)00063-I","volume":"86","author":"M. Brusco","year":"1995","unstructured":"Brusco, M., Jacobs, L.: Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations. European Journal of Operational Research\u00a086(2), 249\u2013261 (1995)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","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.: A memetic approach to the nurse rostering problem. Applied Intelligence\u00a015(3), 199\u2013214 (2001)","journal-title":"Applied Intelligence"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","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.: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research\u00a0188(2), 330\u2013341 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1057\/jors.2009.118","volume":"61","author":"E. Burke","year":"2009","unstructured":"Burke, E., Curtois, T., Qu, R., Berghe, G.: A scatter search methodology for the nurse rostering problem. Journal of the Operational Research Society\u00a061(11), 1667\u20131679 (2009)","journal-title":"Journal of the Operational Research Society"},{"issue":"6","key":"4_CR11","doi-asserted-by":"publisher","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.: The state of the art of nurse rostering. Journal of Scheduling\u00a07(6), 441\u2013499 (2004)","journal-title":"Journal of Scheduling"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Burke, E., De Causmaecker, P., Vanden Berghe, G.: A hybrid tabu search algorithm for the nurse rostering problem. Simulated Evolution and Learning, 187\u2013194 (1999)","DOI":"10.1007\/3-540-48873-1_25"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","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.: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. European Journal of Operational Research\u00a0203(2), 484\u2013493 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","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.: Nurse rostering problems - a bibliographic survey. European Journal of Operational Research\u00a0151(3), 447\u2013460 (2003)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1080\/03052150500467430","volume":"38","author":"Z. Geem","year":"2006","unstructured":"Geem, Z.: Optimal cost design of water distribution networks using harmony search. Engineering Optimization\u00a038(3), 259\u2013277 (2006)","journal-title":"Engineering Optimization"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Geem, Z.: Harmony search applications in industry. Soft Computing Applications in Industry, 117\u2013134 (2008)","DOI":"10.1007\/978-3-540-77465-5_6"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"Z. Geem","year":"2001","unstructured":"Geem, Z., Kim, J., Loganathan, G.: A new heuristic optimization algorithm: harmony search. Simulation\u00a076(2), 60\u201368 (2001)","journal-title":"Simulation"},{"issue":"12","key":"4_CR18","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.3844\/ajassp.2005.1552.1557","volume":"2","author":"Z. Geem","year":"2005","unstructured":"Geem, Z., Lee, K., Park, Y.: Application of harmony search to vehicle routing. American Journal of Applied Sciences\u00a02(12), 1552\u20131557 (2005)","journal-title":"American Journal of Applied Sciences"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Geem, Z., Sim, K.: Parameter-setting-free harmony search algorithm. Applied Mathematics and Computation, 3881\u20133889 (2010)","DOI":"10.1016\/j.amc.2010.09.049"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Geem, Z., Tseng, C., Park, Y.: Harmony search for generalized orienteering problem: best touring in china. Advances in Natural Computation, 741\u2013750 (2005)","DOI":"10.1007\/11539902_91"},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.cor.2005.03.018","volume":"34","author":"W. Gutjahr","year":"2007","unstructured":"Gutjahr, W., Rauner, M.: An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria. Computers & Operations Research\u00a034(3), 642\u2013666 (2007)","journal-title":"Computers & Operations Research"},{"issue":"5-6","key":"4_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.compstruc.2009.01.003","volume":"87","author":"A. Kaveh","year":"2009","unstructured":"Kaveh, A., Talatahari, S.: Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures. Computers & Structures\u00a087(5-6), 267\u2013283 (2009)","journal-title":"Computers & Structures"},{"issue":"36-38","key":"4_CR23","doi-asserted-by":"publisher","first-page":"3902","DOI":"10.1016\/j.cma.2004.09.007","volume":"194","author":"K. Lee","year":"2005","unstructured":"Lee, K., Geem, Z.: A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Computer Methods in Applied Mechanics and Engineering\u00a0194(36-38), 3902\u20133933 (2005)","journal-title":"Computer Methods in Applied Mechanics and Engineering"},{"issue":"7","key":"4_CR24","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1080\/03052150500211895","volume":"37","author":"K. Lee","year":"2005","unstructured":"Lee, K., Geem, Z., Lee, S., Bae, K.: The harmony search heuristic algorithm for discrete structural optimization. Engineering Optimization\u00a037(7), 663\u2013684 (2005)","journal-title":"Engineering Optimization"},{"issue":"4","key":"4_CR25","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10732-007-9013-7","volume":"13","author":"B. Maenhout","year":"2007","unstructured":"Maenhout, B., Vanhoucke, M.: An electromagnetic meta-heuristic for the nurse scheduling problem. Journal of Heuristics\u00a013(4), 359\u2013385 (2007)","journal-title":"Journal of Heuristics"},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1016\/j.amc.2006.11.033","volume":"188","author":"M. Mahdavi","year":"2007","unstructured":"Mahdavi, M., Fesanghary, M., Damangir, E.: An improved harmony search algorithm for solving optimization problems. Applied Mathematics and Computation\u00a0188(2), 1567\u20131579 (2007)","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"4_CR27","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/S0377-2217(97)00006-4","volume":"104","author":"H. Millar","year":"1998","unstructured":"Millar, H., Kiragu, M.: Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. European Journal of Operational Research\u00a0104(3), 582\u2013592 (1998)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"4_CR28","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/03052150903104366","volume":"42","author":"Q. Pan","year":"2010","unstructured":"Pan, Q., Suganthan, P., Liang, J., Tasgetiren, M.: A local-best harmony search algorithm with dynamic subpopulations. Engineering Optimization\u00a042(2), 101\u2013117 (2010)","journal-title":"Engineering Optimization"},{"issue":"3","key":"4_CR29","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1016\/j.amc.2010.01.088","volume":"216","author":"Q. Pan","year":"2010","unstructured":"Pan, Q., Suganthan, P., Tasgetiren, M., Liang, J.: A self-adaptive global best harmony search algorithm for continuous optimization problems. Applied Mathematics and Computation\u00a0216(3), 830\u2013848 (2010)","journal-title":"Applied Mathematics and Computation"},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-61794-9_51","volume-title":"Practice and Theory of Automated Timetabling","author":"A. Wren","year":"1996","unstructured":"Wren, A.: Scheduling, Timetabling and Rosteringa Special Relationship? In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol.\u00a01153, pp. 46\u201375. Springer, Heidelberg (1996)"},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"Zhao, S., Suganthan, P., Pan, Q., Tasgetiren, M.: Dynamic multi-swarm particle swarm optimizer with harmony search. Expert Systems with Applications, 3735\u20133742 (2010)","DOI":"10.1016\/j.eswa.2010.09.032"}],"container-title":["Lecture Notes in Computer Science","Swarm, Evolutionary, and Memetic Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27242-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T21:13:54Z","timestamp":1561065234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27242-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642272417","9783642272424"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27242-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}