{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:35:38Z","timestamp":1725881738850},"publisher-location":"Singapore","reference-count":41,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811034084"},{"type":"electronic","value":"9789811034091"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-981-10-3409-1_1","type":"book-chapter","created":{"date-parts":[[2017,3,9]],"date-time":"2017-03-09T13:13:41Z","timestamp":1489065221000},"page":"3-18","source":"Crossref","is-referenced-by-count":1,"title":["A Heuristic Framework for Priority Based Nurse Scheduling"],"prefix":"10.1007","author":[{"given":"Paramita","family":"Sarkar","sequence":"first","affiliation":[]},{"given":"Rituparna","family":"Chaki","sequence":"additional","affiliation":[]},{"given":"Ditipriya","family":"Sinha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,10]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Burke, K.E., Li, J., Qu, R.: Pareto-based optimization for multi-objective nurse scheduling. In: Boros, E. (ed.) Annals of Operation Research, vol. 196, no. 1, pp. 91\u2013109. Springer, US (2012). doi: 10.1007\/s10479-009-0590-8","DOI":"10.1007\/s10479-009-0590-8"},{"key":"1_CR2","unstructured":"Sarkar, P., Bhattacharya, U., Chaki, R., Sinha, D.: A priority based nurse scheduling algorithm for continuous remote patient monitoring. In: 4th World Conference on Applied Sciences, Engineering and Technology, pp. 046\u2013053 (2015). ISBN 13: 978-81-930222-1-4"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Sarkar, P., Sinha, D.: An approach to continuous pervasive care of remote patients based on priority based assignment of nurse. In: Saeed, K., Sn\u00e1\u0161el, V. (eds.) 13th IFIP TC8 International Conference Computer Information Systems and Industrial Management, November 2014. CISIM 2014, LNCS 8838, pp. 327\u2013338. Springer ISBN 978-3-662-45236-3, Online ISBN 978-3-662-45237-0. doi: 10.1007\/978-3-662-45237-0_31.Print","DOI":"10.1007\/978-3-662-45237-0_31.Print"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"M\u00e9tivier, J.-P.,\u00a0Boizumault, P.,\u00a0Loudni, S.: Solving nurse rostering problems using soft global constraints. In: Gent, I.P. (eds.) CP 2009, LNCS, vol. 5732, pp. 73\u201387. Springer, Berlin, Heidelberg (2009). doi: 10.1007\/978-3-642-04244-7_9","DOI":"10.1007\/978-3-642-04244-7_9"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Moz, M., Pato, V.M.: A genetic algorithm approach to a nurse rerostering problem. Comput. Oper. Res. 34, 667\u2013691 (2007). doi: 10.1016\/j.cor.2005.03.019","DOI":"10.1016\/j.cor.2005.03.019"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Lim, J.G. et al.: Multi-objective nurse scheduling models with patient workload and nurse preferences. management. In: Bresciani, S. (ed.) vol. 2, no. 5, pp. 149\u2013160. Scientific and Academic Publishing, p-ISSN: 2162-9374 e-ISSN: 2162-8416 (2012). doi: 10.5923\/j.mm.20120205.03","DOI":"10.5923\/j.mm.20120205.03"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1097\/NNR.0b013e3181fff15d","volume":"60","author":"Alison M Trinkoff","year":"2011","unstructured":"Trinkoff, Alison M., et al.: Nurses\u2019 work schedule characteristics, nurse staffing, and patient mortality. Nurs. Res. 60(1), 1\u20138 (2011). doi: 10.1097\/NNR.0b013e3181fff15d . January\/February","journal-title":"Nurs. Res."},{"issue":"5","key":"1_CR8","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U Aickelin","year":"2004","unstructured":"Aickelin, U., Dowsland, A.K.: An indirect genetic algorithm for a nurse scheduling problem. Comput. Oper. Res. Elsevier. 31(5), 761\u2013778 (2004). doi: 10.1016\/S0305-0548(03)00034-0","journal-title":"Comput. Oper. Res. Elsevier."},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Dowsland, K.A., Thompson, J.M.: Solving a nurse scheduling problem with knapsacks, networks and tabu search. In: Crook, J.,\u00a0Archibald, T. (eds.) Journal of the Operational Research Society, vol. 51, no. 7, pp. 825\u2013833. Springer (2000). doi: 10.1057\/palgrave.jors.2600970","DOI":"10.1057\/palgrave.jors.2600970"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Miller, H., Pierskalla, P.W., Rath J.: Nurse Scheduling using Mathematical Programming, Operations Research, vol. 24, no. 5 (1976). doi: 10.1287\/opre.24.5.857","DOI":"10.1287\/opre.24.5.857"},{"key":"1_CR11","unstructured":"Warner, M., Prawda, J.A.: Mathematical programming model for scheduling nursing personnel in a hospital. Management Science, vol. 19, no. 4, pp. 411\u2013422 (1972). Application Series, Part 1. Published by:\u00a0INFORMS"},{"key":"1_CR12","unstructured":"Howell, J.P.: Cyclical scheduling of nursing personnel. Hospitals Pubmed. 40, 77\u201385 (1966)"},{"issue":"7\u20138","key":"1_CR13","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/S0305-0548(98)00019-7","volume":"25","author":"JE Beasley","year":"1998","unstructured":"Beasley, J.E., Cao, B.: A dynamic programming based algorithm for the crew scheduling problem. Comput. Oper. Res. Elsevier. 25(7\u20138), 567\u2013582 (1998). doi: 10.1016\/S0305-0548(98)00019-7","journal-title":"Comput. Oper. Res. Elsevier."},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(97)00330-5","volume":"107","author":"B Jaumard","year":"1998","unstructured":"Jaumard, B., Semet, F., Vovor, T.: A generalized linear programming model for nurse scheduling. Eur. J. Oper. Res. Elsevier. 107(1), 1\u201318 (1998). doi: 10.1016\/S0377-2217(97)00330-5","journal-title":"Eur. J. Oper. Res. Elsevier."},{"key":"1_CR15","unstructured":"Satheesh kumar, B., Naresh kumar, S., Kumaraghuru, S.: Linear programming applied to nurses shifting problems for six consecutive days per week. Int. J. Curr. Res. 6(03), 5862\u20135864. ISSN (Online): 2319-7064, March (2014)"},{"key":"1_CR16","unstructured":"Aickelin, U., White, P.: Building better nurse scheduling algorithms. In: Boros, E. (ed.) Annals of Operational Research, vol 128, no. 1, pp. 159\u2013177. Springer\u00a0(2004). p-SSN:\u00a00254-5330, e-ISSN:\u00a01572-9338"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Fan, N.,\u00a0Mujahid, S.,\u00a0Zhang, J.,\u00a0Georgiev, P.: Nurse scheduling problem: an integer programming model with a practical application. In: Paradalos, P.M. et al. (ed.) Systems Analysis Tools for Better Health Care Delivery, Springer Optimization and Its Applications, vol. 74,\u00a0pp. 65\u201398 (2012). doi: 10.1007\/978-1-4614-5094-8_5","DOI":"10.1007\/978-1-4614-5094-8_5"},{"key":"1_CR18","unstructured":"Choy, M., Cheong L.F.M.: A Flexible Integer Programming framework for Nurse Scheduling. CoRR (2012). http:\/\/dblp.uni-trier.de\/db\/journals\/corr\/corr1210.html#abs-1210-3652 . BibTeX key:journals\/corr\/abs-1210-3652"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Maenhout, B., Vanhoucke, M.: Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem. In: Burke, E. (eds.) Journal of Scheduling, vol. 13, no. 1,pp. 77\u201393. Springer, US (2010). doi: 10.1007\/s10951-009-0108-x","DOI":"10.1007\/s10951-009-0108-x"},{"key":"1_CR20","first-page":"41","volume":"5","author":"SJ Darmoni","year":"1995","unstructured":"Darmoni, S.J., et al.: Horoplan: computer-assisted nurse scheduling using constraint-based programming. J. Soc. Health Care Pubmed. 5, 41\u201354 (1995)","journal-title":"J. Soc. Health Care Pubmed."},{"issue":"1","key":"1_CR21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/4233.594027","volume":"1","author":"BMW Cheng","year":"1997","unstructured":"Cheng, B.M.W., Lee, J.H.M., Wu, J.C.K.: A nurse rostering system using constraint programming and redundant modeling. IEEE Trans. Inf. Technol. Biomed. 1(1), 44\u201354 (1997). 10.1.1.48.2749","journal-title":"IEEE Trans. Inf. Technol. Biomed."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Chung\u00a0Wong, G.Y.,\u00a0Chun, W.H.: Nurse rostering using constraint programming and meta-level reasoning. In: Hung, P.W.H., Hinde, C.J., Ali, M. (eds.) IEA\/AIE 2003, LNAI, pp. 712\u2013721 (2003)","DOI":"10.1007\/3-540-45034-3_72"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Santos, D., Fernandes, P., Lopes, H.C., Oliveira, E.: A weighted constraint optimization approach to the nurse scheduling problem. In: IEEE 18th International Conference on Computational Science and Engineering, pp.\u00a0233\u2013239 (2015). doi: 10.1109\/CSE.2015.46","DOI":"10.1109\/CSE.2015.46"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Constantino, A.A., Landa-Silva, D, Melo, E.L., Xavier de Mendonc, D.F., Rizzato, D.B., Rom\u02dcao, W.: A heuristic algorithm based on multi assignment procedures for nurse scheduling. In: Boros, E. (ed.) Journal, Annals of Operations Research, vol. 218, no. 1, pp. 165\u2013183. Springer, US (2014). doi: 10.1007\/s10479-013-1357-9","DOI":"10.1007\/s10479-013-1357-9"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Runarsson, T.P.,\u00a0Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4(3), 284\u2013294 (2000). doi: 10.1109\/4235.873238","DOI":"10.1109\/4235.873238"},{"issue":"4","key":"1_CR26","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TEVC.2009.2033583","volume":"14","author":"R Bai","year":"2010","unstructured":"Bai, R., Burke, K.E., Kendall, G., Li, J., McCollum, B.: A hybrid evolutionary approach to the nurse rostering problem. IEEE Trans. Evol. Comput. 14(4), 580\u2013590 (2010). doi: 10.1109\/TEVC.2009.2033583 . Aug","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Brucker, P., Burke Edmund, K., Curtois, T., Qu, R., Berghe, V.G.: A shift sequence based approach for nurse scheduling and a new benchmark dataset. In: Laguna, M. (ed.) Journal of Heuristics August 2010, vol. 16,\u00a0no. 4, pp. 559\u2013573. Springer (2010). doi: 10.1007\/s10732-008-9099-6","DOI":"10.1007\/s10732-008-9099-6"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Li, J., Aickelin, U.: Bayesian optimisation algorithm for nurse scheduling. In: Pelikan, M., Sastry, K., Cantu-Paz, E. (eds.) Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence), Chapter 17, pp. 315\u2013332. Springer (2006)","DOI":"10.1007\/978-3-540-34954-9_14"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Maenhout, B.,\u00a0Vanhoucke, M.: An electromagnetic meta-heuristic for the nurse scheduling problem. In: Laguna, M. (ed.) Journal of Heuristics, vol. 13,\u00a0no.\u00a04,\u00a0pp 359\u2013385.\u00a0Springer (2007) doi: 10.1007\/s10732-007-9013-7","DOI":"10.1007\/s10732-007-9013-7"},{"issue":"3","key":"1_CR30","first-page":"169","volume":"22","author":"A Jaszkiewicz","year":"1997","unstructured":"Jaszkiewicz, A.: A metaheuristic approach to multiple objective nurse scheduling. Found. Comput. Decis. Sci. 22(3), 169\u2013184 (1997)","journal-title":"Found. Comput. Decis. Sci."},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Leksakul, K., Phetsawat, S.: Nurse scheduling using genetic algorithm. hindawi publishing corporation. Math. Probl. Eng. Article ID 246543, 16 (2014). http:\/\/dx.doi.org\/10.1155\/2014\/246543","DOI":"10.1155\/2014\/246543"},{"issue":"3","key":"1_CR32","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.cor.2005.03.019","volume":"34","author":"M Moz","year":"2007","unstructured":"Moz, M., Pato, M.V.: A genetic algorithm approach to a nurse rerostering problem. Comput. Oper. Res. Elsevier. 34(3), 667\u2013691 (2007). doi: 10.1016\/j.cor.2005.03.019","journal-title":"Comput. Oper. Res. Elsevier."},{"issue":"1","key":"1_CR33","first-page":"53","volume":"8","author":"S-J Kim","year":"2014","unstructured":"Kim, S.-J., Ko, Y.-W., Uhmn, S., Kim, J.: A strategy to improve performance of genetic algorithm for nurse scheduling problem. Int. J. Soft. Eng. Appl. 8(1), 53\u201362 (2014). 10.14257\/Ijsela.14\/8.1.05","journal-title":"Int. J. Soft. Eng. Appl."},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"9506","DOI":"10.1016\/j.eswa.2008.11.049","volume":"36","author":"C Tsai","year":"2009","unstructured":"Tsai, C., Li, A.H.S.: A two-stage modeling with genetic algorithms for the nurse scheduling problem. Expert Syst. Appl. 36, 9506\u20139512 (2009). doi: 10.1016\/j.eswa.2008.11.049","journal-title":"Expert Syst. Appl."},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Moscato, P., Cotta, C.: A modern introduction to memetic algorithms. Chapter 6. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics, International Series in Operations Research and Management Science, vol. 146, pp. 141\u2013183. Springer, US (2010). doi: 10.1007\/978-1-4419-1665-56","DOI":"10.1007\/978-1-4419-1665-56"},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Burke, K.E., Li, J., Qu, R.: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. Eur. J. Oper. Res. Elsevier. 203(2), 484\u2013493 (2010). doi: 10.1016\/j.ejor.2009.07.036","DOI":"10.1016\/j.ejor.2009.07.036"},{"issue":"2","key":"1_CR37","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1109\/TSMCA.2012.2210404","volume":"43","author":"N Todorovic","year":"2013","unstructured":"Todorovic, N., Petrovic, S.: Bee colony optimization algorithm for nurse rostering. IEEE Trans. Syst. Man Cybern. Syst. 43(2), 467\u2013473 (2013). doi: 10.1109\/TSMCA.2012.2210404","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"1_CR38","unstructured":"Ghasemi, S., Sajadi, S.M., Vahdani, H.: Proposing a heuristic algorithm for the nurse scheduling in hospital emergency department (Case study: Shahid Beheshti Hospital). Int. J. Eng. Sci. 3(9), 85\u201393 (2014). ISSN: 2306-6474"},{"key":"1_CR39","unstructured":"Ko, Y.W., Kim, D.H., Jeong, M., Jeon, W., Uhmn, S., Kim, J.: An efficient method for nurse scheduling problem using simulated annealing. In: The 5th International Conference on Advanced Science and Technology, AST 2013, vol. 20, pp. 82\u201385. ASTL (2013)"},{"key":"1_CR40","unstructured":"Ko, Y.W., Kim, D.H., Jeong, M., Jeon, W., Uhmn, S., Kim J.: An improvement technique for simulated annealing and its application to nurse scheduling problem. Int. J. Soft. Eng. Appl. 7(4), 269\u2013277 (2013)"},{"key":"1_CR41","unstructured":"Stepanov, A.: On the Borel-Cantelli Lemma. Department of Mathematics, Izmir University of Economics, Turkey. AMS 2000 Subject Classification: 60G70, 62G30 (2000)"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computing and Systems for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-3409-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T14:32:21Z","timestamp":1568903541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-3409-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811034084","9789811034091"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-3409-1_1","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017]]}}}