{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:37:06Z","timestamp":1773160626683,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T00:00:00Z","timestamp":1417564800000},"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":["J Med Syst"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10916-014-0160-8","type":"journal-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T06:25:39Z","timestamp":1418970339000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["The Nurse Scheduling Problem in Real-Life"],"prefix":"10.1007","volume":"39","author":[{"given":"Antoine","family":"Legrain","sequence":"first","affiliation":[]},{"given":"Hocine","family":"Bouarab","sequence":"additional","affiliation":[]},{"given":"Nadia","family":"Lahrichi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"160_CR1","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U Aickelin","year":"2004","unstructured":"Aickelin, U., and Dowsland, K.A., An indirect genetic algorithm for a nurse scheduling problem. Comput. Oper. Res. 31:761\u2013778, 2004.","journal-title":"Comput. Oper. Res."},{"key":"160_CR2","doi-asserted-by":"crossref","first-page":"1574","DOI":"10.1057\/palgrave.jors.2602308","volume":"58","author":"U Aickelin","year":"2007","unstructured":"Aickelin, U., Burke, E.K., Li, J., An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. J. Oper. Res. Soc. 58:1574\u20131585, 2007.","journal-title":"J. Oper. Res. Soc."},{"key":"160_CR3","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1080\/07408170590948468","volume":"37","author":"JF Bard","year":"2005","unstructured":"Bard, J.F., and Purnomo, H.W., Hospital-wide reactive scheduling of nurses with preference considerations. IIE Trans. 37:589\u2013608, 2005a.","journal-title":"IIE Trans."},{"key":"160_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10729-005-4141-9","volume":"31","author":"JF Bard","year":"2005","unstructured":"Bard, J.F., and Purnomo, H.W., Short-term nurse scheduling in response to daily fluctuations in supply and demand. Health Care Manag. Sci. 31:315\u2013324, 2005b.","journal-title":"Health Care Manag. Sci."},{"key":"160_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10951-006-0323-7","volume":"10","author":"JF Bard","year":"2007","unstructured":"Bard, J.F., and Purnomo, H.W., Cyclic preference scheduling of nurses using a lagrangian-based heuristic. J. Sched. 10:5\u201323, 2007.","journal-title":"J. Sched."},{"key":"160_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0038-0121(96)00010-9","volume":"30","author":"I Berrada","year":"1996","unstructured":"Berrada, I., Ferland, J.A., Michelon, P., A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio Econ. Plan. Sci. 30:183\u2013193, 1996.","journal-title":"Socio Econ. Plan. Sci."},{"key":"160_CR7","first-page":"1","volume":"18","author":"EK Burke","year":"2004","unstructured":"Burke, E.K., De Causmaecker, P., Vanden Berghe, G., Novel meta-heuristic approaches to nurse rostering problems in belgian hospitals. Handb. Sched. algorithm. model. Perform. Anal. 18:1\u201344, 2004.","journal-title":"Handb. Sched. algorithm. model. Perform. Anal."},{"key":"160_CR8","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1080\/08839510600903841","volume":"20","author":"EK Burke","year":"2006","unstructured":"Burke, E.K., De Causmaecker, P., Petrovic, S., Vanden Berghe, G., Metaheuristics for handling time interval coverage constraint in nurse scheduling. Appl. Artif. Intell. 20:743\u2013766, 2006.","journal-title":"Appl. Artif. Intell."},{"key":"160_CR9","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1057\/jors.2009.118","volume":"61","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Curtois, T., Qu, R., Vanden Berghe, G., A scatter search methodology for the nurse rostering problem. J. Oper. Res. Soc. 61:1667\u20131679, 2010.","journal-title":"J. Oper. Res. Soc."},{"key":"160_CR10","first-page":"148","volume":"3","author":"AR Clark","year":"2011","unstructured":"Clark, A.R., and Walker, H., Nurse rescheduling with shift preferences and minimal disruption. J. Appl. Oper. Res. 3:148\u2013162, 2011.","journal-title":"J. Appl. Oper. Res."},{"key":"160_CR11","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1057\/palgrave.jors.2600970","volume":"51","author":"KA Dowsland","year":"2000","unstructured":"Dowsland, K.A., and Thompson, J.M., Solving a nurse scheduling problem with knapsacks, networks and tabu search. J. Oper. Res. Soc. 51:825\u2013833, 2000.","journal-title":"J. Oper. Res. Soc."},{"key":"160_CR12","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1023\/A:1011392328632","volume":"7","author":"JA Ferland","year":"2001","unstructured":"Ferland, J.A., Berrada, I., Nabli, I., Ahiod, B., Michelon, P., Gascon, V., Gagn\u00e9, E., Generalized assignment type goal programming problem: Application to nurse scheduling. J. Heuristics 7:391\u2013413, 2001.","journal-title":"J. Heuristics"},{"key":"160_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., and Laguna, M., Tabu Search. Boston: Kluwer Academic Publishers, 1997."},{"key":"160_CR14","unstructured":"IBM Ilog cplex optimization studio (2014). http:\/\/www-03.ibm.com\/software\/products\/en\/ibmilogcpleoptistud\/"},{"issue":"4","key":"160_CR15","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1287\/inte.1070.0291","volume":"37","author":"DL Kellogg","year":"2007","unstructured":"Kellogg, D.L., and Walczak, S., Nurse scheduling: from academia to implementation or not Interfaces 37(4):355\u2013369, 2007.","journal-title":"Interfaces"},{"key":"160_CR16","unstructured":"Maenhout, B., and Vanhoucke, M., New computational results for the nurse scheduling problem: a scatter search algorithm. In: Evolutionary Computation in Combinatorial Optimization, pp. 159\u2013170: Springer, 2006."},{"key":"160_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10732-007-9013-7","volume":"13","author":"B Maenhout","year":"2007","unstructured":"Maenhout, B., and Vanhoucke, M., An electromagnetic meta-heuristic for the nurse scheduling problem. J. Heuristics 13:359\u2013385, 2007.","journal-title":"J. Heuristics"},{"key":"160_CR18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0933-3657(00)00062-2","volume":"20","author":"C Valouxis","year":"2000","unstructured":"Valouxis, C., and Housos, E., Hybrid optimization techniques for the workshift and rest assignment of nursing personnel. Artif. Intell. Med. 20:155\u2013175, 2000.","journal-title":"Artif. Intell. Med."},{"key":"160_CR19","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.ejor.2012.11.029","volume":"226","author":"J Bergh Van den","year":"2013","unstructured":"Van den Bergh, J., Jeroen, B., Bruecker Philippe, D., Erik, D., Boeck Liesje, D., Personnel scheduling: A literature review. Eur. J. Oper. Res. 226:367\u2013385, 2013.","journal-title":"Eur. J. Oper. Res."},{"key":"160_CR20","first-page":"239","volume":"24","author":"JM Welton","year":"2006","unstructured":"Welton, J.M., Fisher, M.H., DeGrace, S., Zone-Smith, L., Hospital nursing costs, billing, and reimbursement. Nurs. Econ. 24:239\u201345, 2006.","journal-title":"Nurs. Econ."},{"key":"160_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.cor.2014.05.018","volume":"51","author":"T Wong","year":"2014","unstructured":"Wong, T., Xu, M., Chin, K., A two-stage heuristic approach for nurse scheduling problem: A case study in an emergency department. Comput. Oper. Res. 51:99\u2013110, 2014.","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"160_CR22","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10916-010-9494-z","volume":"36","author":"E Yilmaz","year":"2012","unstructured":"Yilmaz, E., A mathematical programming model for scheduling of nurses\u2019 labor shifts. J. Med. Syst. 36(2): 491\u2013496 , 2012.","journal-title":"J. Med. Syst."}],"container-title":["Journal of Medical Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10916-014-0160-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10916-014-0160-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10916-014-0160-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T04:50:54Z","timestamp":1559451054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10916-014-0160-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["160"],"URL":"https:\/\/doi.org\/10.1007\/s10916-014-0160-8","relation":{},"ISSN":["0148-5598","1573-689X"],"issn-type":[{"value":"0148-5598","type":"print"},{"value":"1573-689X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,3]]},"article-number":"160"}}