New approaches to nurse rostering benchmark instances

详细信息    查看全文

• 作者：Edmund K. Burke^a ; ^{e.k.burke@stir.ac.uk" class="auth_mail} ; Tim Curtois^b ; ^{tim.curtois@nottingham.ac.uk" class="auth_mail}
• 关键词：Staff scheduling ; Nurse rostering ; Branch and price ; Ejection chain
• 刊名：European Journal of Operational Research
• 出版年：16 August, 2014
• 年：2014
• 卷：237
• 期：1
• 页码：71-81
• 全文大小：2093 K

文摘

This paper presents the results of developing a branch and price algorithm and an ejection chain method for nurse rostering problems. The approach is general enough to be able to apply it to a wide range of benchmark nurse rostering instances. The majority of the instances are real world applications. They have been collected from a variety of sources including industrial collaborators, other researchers and various publications. The results of entering these algorithms in the 2010 International Nurse Rostering Competition are also presented and discussed. In addition, incorporated within both algorithms is a dynamic programming method which we present. The algorithm contains a number of heuristics and other features which make it very effective on the broad rostering model introduced.