A Decomposition, Construction and Post-Processing Approach for Nurse Rostering

Brucker, Peter and Qu, Rong and Burke, Edmund and Post, Gerhard (2005) A Decomposition, Construction and Post-Processing Approach for Nurse Rostering. In: Multidisciplinary International Conference on Scheduling : Theory and Applications, Aug, 2005, New York.

[img] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (101kB)

Abstract

This paper presents our work on decomposing a specific nurse rostering problem by cyclically assigning blocks of shifts, which are designed considering both hard and soft constraints, to groups of nurses. The rest of the shifts are then assigned to the nurses to construct a schedule based on the one cyclically generated by blocks. The schedules obtained by decomposition and construction can be further improved by a variable neighborhood search. Significant results are obtained and compared with a genetic algorithm and a variable neighborhood search approach on a problem that was presented to us by our collaborator, ORTEC bv, The Netherlands. We believe that the approach has the potential to be further extended to solve a wider range of nurse rostering problems.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: nurse rostering problems, decomposition, variable neighborhood search
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Qu, Rong
Date Deposited: 12 Dec 2005
Last Modified: 09 Oct 2007 15:52
URI: http://eprints.nottingham.ac.uk/id/eprint/351

Actions (Archive Staff Only)

Edit View Edit View