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

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...

Full description

Bibliographic Details
Main Authors: Brucker, Peter, Qu, Rong, Burke, Edmund, Post, Gerhard
Format: Conference or Workshop Item
Published: 2005
Subjects:
Online Access:https://eprints.nottingham.ac.uk/351/
_version_ 1848790397682188288
author Brucker, Peter
Qu, Rong
Burke, Edmund
Post, Gerhard
author_facet Brucker, Peter
Qu, Rong
Burke, Edmund
Post, Gerhard
author_sort Brucker, Peter
building Nottingham Research Data Repository
collection Online Access
description 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.
first_indexed 2025-11-14T18:11:58Z
format Conference or Workshop Item
id nottingham-351
institution University of Nottingham Malaysia Campus
institution_category Local University
last_indexed 2025-11-14T18:11:58Z
publishDate 2005
recordtype eprints
repository_type Digital Repository
spelling nottingham-3512020-05-04T20:30:43Z https://eprints.nottingham.ac.uk/351/ A Decomposition, Construction and Post-Processing Approach for Nurse Rostering Brucker, Peter Qu, Rong Burke, Edmund Post, Gerhard 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. 2005 Conference or Workshop Item PeerReviewed Brucker, Peter, Qu, Rong, 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. nurse rostering problems decomposition variable neighborhood search
spellingShingle nurse rostering problems
decomposition
variable neighborhood search
Brucker, Peter
Qu, Rong
Burke, Edmund
Post, Gerhard
A Decomposition, Construction and Post-Processing Approach for Nurse Rostering
title A Decomposition, Construction and Post-Processing Approach for Nurse Rostering
title_full A Decomposition, Construction and Post-Processing Approach for Nurse Rostering
title_fullStr A Decomposition, Construction and Post-Processing Approach for Nurse Rostering
title_full_unstemmed A Decomposition, Construction and Post-Processing Approach for Nurse Rostering
title_short A Decomposition, Construction and Post-Processing Approach for Nurse Rostering
title_sort decomposition, construction and post-processing approach for nurse rostering
topic nurse rostering problems
decomposition
variable neighborhood search
url https://eprints.nottingham.ac.uk/351/