| Article ID: | iaor2012876 |
| Volume: | 194 |
| Issue: | 1 |
| Start Page Number: | 33 |
| End Page Number: | 57 |
| Publication Date: | Apr 2012 |
| Journal: | Annals of Operations Research |
| Authors: | Vanden Berghe Greet, Causmaecker Patrick, Bilgin Burak, Rossie Benot |
| Keywords: | scheduling, heuristics: local search |
A novel nurse rostering model is developed to represent real world problem instances more accurately. The proposed model is generic in the sense that it allows modelling of essentially different problem instances. Novel local search neighbourhoods are implemented to take advantage of the problem properties represented by the model. These neighbourhoods are used in a variable neighbourhood search and in an adaptive large neighbourhood search algorithm. The performance of the solution method is evaluated empirically on real world data. The proposed model is open to further extensions for covering personnel planning problems in different sectors and countries.