View article

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 extensions in the form of additional constraints to deal with the incomplete information are necessary to achieve competitive results in this setting. Furthermore, we propose a local search framework based on a combination of Min-Conflict and Tabu search. We compare our solution approaches with the results obtained in the competiton.