arrow
Return

Integer programming model extensions for a multi-stage nurse rostering problem

delete2017-09-01
delete17
delete
OA
AI
F
Florian Mischek *
N
Nysret Musliu
DOI:10.1007/s10479-017-2623-zdelete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In the variant of the well studied nurse rostering problem proposed in the Second International Nurse Rostering Competition, multiple stages have to be solved sequentially which are dependent on each other. We propose an integer programming model for this problem and show that a set of newly developed extensions in the form of additional constraints to deal with the incomplete information can significantly improve the quality of the generated solutions. We compare our solution approaches with the results obtained in the competition and show that the extended model achieves results competitive with the competition finalists.
Keywords:
Nurse rostering
INRC-II
Integer programming
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Annals of Operations Research cover
Annals of Operations Research
IF:
4.5
Papers:
8.0K
Citations:
2.1W

Organization

T
Technische Universitat Wien
Scholars:
1.3W
Papers: 1.1W
Citations: 21