A scatter search methodology for the nurse rostering problem

被引:53
作者
Burke, E. K.
Curtois, T. [1 ]
Qu, R.
Vanden Berghe, G. [2 ,3 ]
机构
[1] Univ Nottingham, Sch Comp Sci, Nottingham NG8 1BB, England
[2] KaHo St Lieven, Ghent, Belgium
[3] Katholieke Univ Leuven, Kortrijk, Belgium
基金
英国工程与自然科学研究理事会;
关键词
nurse rostering; scatter search; heuristics; NEIGHBORHOOD SEARCH; SCHEDULING PROBLEM; ALGORITHM;
D O I
10.1057/jors.2009.118
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The benefits of automating the nurse scheduling process in hospitals include reducing the planning workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and to attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce will lead to higher productivity, increased quality of patient service and a better level of healthcare. This paper presents a scatter search approach for the problem of automatically creating nurse rosters. Scatter search is an evolutionary algorithm, which has been successfully applied across a number of problem domains. To adapt and apply scatter search to nurse rostering, it was necessary to develop novel implementations of some of scatter search's subroutines. The algorithm was then tested on publicly available real-world benchmark instances and compared against previously published approaches. The results show the proposed algorithm is a robust and effective method on a wide variety of real-world instances. Journal of the Operational Research Society (2010) 61, 1667-1679. doi: 10.1057/jors.2009.118 Published online 4 November 2009
引用
收藏
页码:1667 / 1679
页数:13
相关论文
共 39 条
[31]   A tabu scatter search metaheuristic for the arc routing problem [J].
Greistorfer, P .
COMPUTERS & INDUSTRIAL ENGINEERING, 2003, 44 (02) :249-266
[32]  
Jan A, 2000, IEEE C EVOL COMPUTAT, P196, DOI 10.1109/CEC.2000.870295
[33]  
Jaszkiewicz A., 1997, Foundations of Computing and Decision Sciences, V22, P169
[34]   A generalized linear programming model for nurse scheduling [J].
Jaumard, B ;
Semet, F ;
Vovor, T .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (01) :1-18
[35]  
Laguna M., 2003, SCATTER SEARCH METHO
[36]  
Maenhout B, 2006, LECT NOTES COMPUT SC, V3906, P159
[37]  
Marti R., 2000, COMPUTING TOOLS MODE, P215, DOI DOI 10.1007/978-1-4615-4567-5_12
[38]   Modelling and solving employee timetabling problems [J].
Meisels, A ;
Schaerf, A .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2003, 39 (1-2) :41-59
[39]  
Meyer auf'm., 2000, Selected papers from the third international conference on practice and theory of automated timetabling - Lecture Notes in Computer Science, V2079, P191