Challenges for nurse rostering problem and opportunities in hospital logistics

• Autorzy: Simić D. , Simić S. , Milutinović D. , Djordjević J.
• Języki publikacji: EN

Abstrakty

EN

In the last 45 years nurse scheduling has received considerable attention in the research community. Nurse rostering can be described as a task of finding a duty roster for a set of nurses in such a way that the rosters comply with work regulations and meet the management’s requests. The objective varies from minimizing the costs of float nurses or minimizing under-staffing to maximizing the degree to which the nurses’ requests are met. In logistics, one aspect is optimization of the steady flow of materials through a network of transport links and storage nodes, and the other is, coordination of a sequence of resources, such as staffing and scheduling clinical resources. The period up to 2000 is characterized by using mathematical programming and objective functions to solve nurse rostering problem. In the period after 2000 the focus of researches aimed at solving nurse rostering and scheduling problem becomes implementation of meta-heuristics and multi-objective functions. The aim of this paper is to present the latest researches conducted in last ten years.

Słowa kluczowe

EN

nurse rostering problem; scheduling; healthcare; metaheuristics; logistic approach

PL

problem dyżurów pielęgniarskich; harmonogram; opieka zdrowotna; metaheurystyka; podejście logistyczne

• Wydawca: University of Silesia, Institute of Informatics, Computer Systems Department
• Czasopismo: Journal of Medical Informatics & Technologies
• Rocznik: 2014
• Tom: Vol. 23
• Strony: 195--202
• Opis fizyczny: Bibliogr. 20 poz., tab.

Twórcy

autor

Simić D.

• University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia

autor

Simić S.

• University of Novi Sad, Faculty of Medicine, Novi Sad, Serbia

autor

Milutinović D.

• University of Novi Sad, Faculty of Medicine, Novi Sad, Serbia

autor

Djordjević J.

• Oncology Institute of Vojvodina, Sremska Kamenica, Serbia

Bibliografia

• [1] AICKELIN U., Paul WHITE P., Building Better Nurse Scheduling Algorithms, Annals of Operations Research, 2004, Vol. 128, No. 1-4, pp. 159-177.
• [2] AYOB M., HADWAN M., NAZRI M. Z. A., AHMAD Z., Enhanced harmony search algorithm for nurse rostering problems, Journal of Applied Sciences, 2013, Vol. 13, No. 6, pp. 846-853.
• [3] BURKE E., DE CAUSMACKER P., BERGHE G. V., A hybrid tabu search algorithm for the nurse rostering problem, Simulated evolution and learning, Springer LNCS, 1999, Vol. 1585, pp. 187-194.
• [4] BURKE E., DE CAUSMACKER P, BERGHE G. V., VAN LANDEGHEM H., The state of the art of nurse rostering, Journal of scheduling, 2004, Vol. 7, No. 6, pp. 441-499.
• [5] CASTELLI M., SILVA S., MANZONI L., VANNESCHI L., Geometric selective harmony search, Information Sciences, 2014, Vol. 279, pp. 468-482.
• [6] CHANG H. J., Economics: The user’s guide, Pelican, London, 2014.
• [7] DOWSLAND K. A., Nurse scheduling with tabu search and strategic oscillation, European Journal of Operational Research, 1998, Vol. 106, No. 2-3, pp. 393-407.
• [8] HADWAN M., AYOB M., SABAR N. R., QU R., A harmony search algorithm for nurse rostering problems, Information Sciences, 2013, Vol. 233, pp. 126-140.
• [9] HEUS K., WEIL G., Constraint programming a nurse scheduling application, in: Proceedings of the Second International Conference on the Practical Application of Constraint Technology, 1996, pp. 115-127.
• [10] HUANG H., An evolutionary algorithm based on constraint set partitioning for nurse rostering problems, Neural Computing and Applications, 2014, Vol. 25, No. 3-4, pp. 703-715.
• [11] JAN A., YAMAMOTO M., OHUCHI A., Evolutionary algorithms for nurse scheduling problem. in: Proceedings of the 2000 Congress on Evolutionary Computation CEC00, pp. 196-203, Available from http://www.lania.mx/ ccoello/EMOO/jan00.ps.gz, 2000.
• [12] JELINEK R. C., KAVOIS J. A., Nurse staffing and scheduling: Past solutions and future directions, Journal of the Society for Health Systems, 1992, Vol. 3, No. 4, pp. 75-82.
• [13] MARTIN S., OUELHADJ D., SMET P., BERGHE G. V., O¨ ZCAN E., Cooperative search for fair nurse rosters, Expert Systems with Applications, 2013, Vol. 40, No. 16, pp. 6674-6683.
• [14] McCOLLUM B., SCHAERF A, PAECHTER B., McMULLAN P., LEWIS R., PARKES A. J., Di GASPERO L., QU R., BURKE E. K., Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition, INFORMS Journal on Computing, 2010, Vol. 22, No. 1, pp. 120-130.
• [15] MILLAR H., KIRAGU M., Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming, European Journal of Operational Research, 1998, Vol. 104, No. 3, pp. 582-592.
• [16] WARNER M., KELLER B. J., MARTEL S. H., Automated nurse scheduling, Journal of the Society for Health Systems, 1990, Vol. 2, No. 2, pp. 66-80.
• [17] http://www.cs.qub.ac.uk/itc2007/winner/ITC2007 Background Techreportv2.pdf
• [18] http://www.optaplanner.org/
• [19] http://www.scheduleanywhere.com/scheduling-software
• [20] http://www.shiftboard.com/