A shift sequence based approach for nurse scheduling and a new benchmark dataset

This paper investigates an adaptive constructive method for solving nurse rostering problems. The constraints considered in the problems are categorised into three classes: those that are sequence related, those that are nurse schedule related and those that are roster related. We propose a decomposition approach to construct solutions that consists of two stages: 1) to construct high quality sequences for nurses by only considering the sequence constraints, and 2) to iteratively construct schedules for nurses and the overall rosters, based on the sequences built and considering the schedule and roster constraints. In the second stage of the schedule construction, nurses are ordered and selected adaptively according to the quality of the schedules they were assigned to in the last iteration. Greedy local search is carried out during and after the roster construction, in order to improve the (partial) rosters built. We show that the local search heuristic during the roster construction ...

• Type: Journal
• Year: 2010
• Where: HEURISTICS
• Authors: Peter Brucker, Edmund K. Burke, Timothy Curtois, Rong Qu, Greet Vanden Berghe
• Keywords: HEURISTICS 2010, Human Computer Interaction, Local Search, Nurse, Roster