A hybrid tabu search algorithm for the nurse rostering problem

Citation

Burke E, De Causmaecker P & Vanden Berghe G (1999) A hybrid tabu search algorithm for the nurse rostering problem. In: McKay B, Yao X, Newton C, Kim J & Furuhashi T (eds.) Simulated Evolution and Learning: Second Asia-Pacific Conference on Simulated Evolution and Learning, SEAL’98 Canberra, Australia, November 24–27, 1998 Selected Papers. Lecture Notes in Computer Science, 1585. Second Asia-Pacific Conference on Simulated Evolution and Learning, SEAL’98, Canberra, Australia, 24.11.1998-27.11.1998. Berlin Heidelberg: Springer, pp. 187-194. http://link.springer.com/chapter/10.1007%2F3-540-48873-1_25; https://doi.org/10.1007/3-540-48873-1_25

Abstract
This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research were applied) tackled manually. The problem basically concerns the assignment of duties to a set of people with different qualifications, work regulations and preferences. Constraint programming and linear programming techniques can produce feasible solutions for this problem. However, the reality in Belgian hospitals forced us to use heuristics to deal with the over constrained schedules. An important reason for this decision is the calculation time, which the users prefer to reduce. The algorithms presented in this paper are a commercial nurse rostering product developed for the Belgian hospital market, entitled Plane.

Keywords
nurse rostering; personnel scheduling; tabu search