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
相关论文
共 50 条
  • [42] Local search neighbourhoods for dealing with a novel nurse rostering model
    Bilgin, Burak
    De Causmaecker, Patrick
    Rossie, Benoit
    Vanden Berghe, Greet
    [J]. ANNALS OF OPERATIONS RESEARCH, 2012, 194 (01) : 33 - 57
  • [43] A hybrid scatter search heuristic for personalized crew rostering in the airline industry
    Maenhout, Broos
    Vanhoucke, Mario
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 206 (01) : 155 - 167
  • [44] Local search neighbourhoods for dealing with a novel nurse rostering model
    Burak Bilgin
    Patrick De Causmaecker
    Benoît Rossie
    Greet Vanden Berghe
    [J]. Annals of Operations Research, 2012, 194 : 33 - 57
  • [45] A variable neighborhood search based matheuristic for nurse rostering problems
    Federico Della Croce
    Fabio Salassa
    [J]. Annals of Operations Research, 2014, 218 : 185 - 199
  • [46] Nurse preference rostering using agents and iterated local search
    Michael, Chiaramonte
    Jeffery, Cochran
    David, Caswell
    [J]. ANNALS OF OPERATIONS RESEARCH, 2015, 226 (01) : 443 - 461
  • [47] A variable neighborhood search based matheuristic for nurse rostering problems
    Della Croce, Federico
    Salassa, Fabio
    [J]. ANNALS OF OPERATIONS RESEARCH, 2014, 218 (01) : 185 - 199
  • [48] Hyper-heuristic approach for solving Nurse Rostering Problem
    Anwar, Khairul
    Awadallah, Mohammed A.
    Khader, Ahamad Tajudin
    Al-Betar, Mohammed Azmi
    [J]. 2014 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN ENSEMBLE LEARNING (CIEL), 2014, : 48 - 53
  • [49] On Multi-Objective Optimization Heuristics for Nurse Rostering Problem
    Liogys, Mindaugas
    Zilinskas, Antanas
    [J]. BALTIC JOURNAL OF MODERN COMPUTING, 2014, 2 (01): : 32 - 44
  • [50] The nurse rostering problem: from operational research to organizational reality?
    Drake, Robert G.
    [J]. JOURNAL OF ADVANCED NURSING, 2014, 70 (04) : 800 - 810