Nurse rostering with fatigue modelling Incorporating a validated sleep model with biological variations in nurse rostering

被引:0
|
作者
Klyve, Kjartan Kastet [1 ]
Senthooran, Ilankaikone [2 ]
Wallace, Mark [2 ]
机构
[1] Norwegian Univ Sci & Technol, Dept Ind Econ & Technol Management, Trondheim, Norway
[2] Monash Univ, Melbourne, Vic, Australia
关键词
Nurse rostering; Fatigue; Sleep; Mixed-Integer programming; Constraint programming; Large neighbourhood search; Operations research; WORK-RELATED FATIGUE; QUANTITATIVE MODEL; MATHEMATICAL-MODEL; PERFORMANCE; IMPAIRMENT; PREDICTION; CARE;
D O I
10.1007/s10729-022-09613-4
中图分类号
R19 [保健组织与事业(卫生事业管理)];
学科分类号
摘要
We use a real Nurse Rostering Problem and a validated model of human sleep to formulate the Nurse Rostering Problem with Fatigue. The fatigue modelling includes individual biologies, thus enabling personalised schedules for every nurse. We create an approximation of the sleep model in the form of a look-up table, enabling its incorporation into nurse rostering. The problem is solved using an algorithm that combines Mixed-Integer Programming and Constraint Programming with a Large Neighbourhood Search. A post-processing algorithm deals with errors, to produce feasible rosters minimising global fatigue. The results demonstrate the realism of protecting nurses from highly fatiguing schedules and ensuring the alertness of staff. We further demonstrate how minimally increased staffing levels enable lower fatigue, and find evidence to suggest biological complementarity among staff can be used to reduce fatigue. We also demonstrate how tailoring shifts to nurses' biology reduces the overall fatigue of the team, which means managers must grapple with the issue of fairness in rostering.
引用
收藏
页码:21 / 45
页数:25
相关论文
共 50 条
  • [41] A Greedy Constructive Approach for Nurse Rostering Problem
    Jamom, Mouna
    Ayob, Masri
    Hadwan, Mohammed
    2011 3RD CONFERENCE ON DATA MINING AND OPTIMIZATION (DMO), 2011, : 227 - 231
  • [42] The first international nurse rostering competition 2010
    Stefaan Haspeslagh
    Patrick De Causmaecker
    Andrea Schaerf
    Martin Stølevik
    Annals of Operations Research, 2014, 218 : 221 - 236
  • [43] A comparison of two approaches to nurse rostering problems
    Sanja Petrovic
    Greet Vanden Berghe
    Annals of Operations Research, 2012, 194 : 365 - 384
  • [44] Bee Colony Optimization Algorithm for Nurse Rostering
    Todorovic, Nikola
    Petrovic, Sanja
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2013, 43 (02): : 467 - 473
  • [45] A simple randomized variable neighbourhood search for nurse rostering
    Zheng, Ziran
    Liu, Xiyu
    Gong, Xiaoju
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 110 : 165 - 174
  • [46] Hybrid Harmony Search Algorithm for Nurse Rostering Problem
    Nie, Yabing
    Wang, Bing
    Zhang, Xianxia
    HARMONY SEARCH ALGORITHM, 2016, 382 : 109 - 120
  • [47] Roster evaluation based on classifiers for the nurse rostering problem
    Vaclavik, Roman
    Sucha, Premysl
    Hanzalek, Zdenek
    JOURNAL OF HEURISTICS, 2016, 22 (05) : 667 - 697
  • [48] A Time Predefined Variable Depth Search for Nurse Rostering
    Burke, Edmund K.
    Curtois, Timothy
    Qu, Rong
    Berghe, Greet Vanden
    INFORMS JOURNAL ON COMPUTING, 2013, 25 (03) : 411 - 419
  • [49] A hybrid tabu search algorithm for the nurse rostering problem
    Burke, E
    De Causmaecker, P
    Vanden Berghe, G
    SIMULATED EVOLUTION AND LEARNING, 1999, 1585 : 187 - 194
  • [50] A systematic two phase approach for the nurse rostering problem
    Valouxis, Christos
    Gogos, Christos
    Goulas, George
    Alefragis, Panayiotis
    Housos, Efthymios
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (02) : 425 - 433