|
|
Digital Library of the
European Council for Modelling and Simulation |
|
Title: |
Hierarchical Method For Nurse Rostering
Based On Granular Pre-Processing Of Constraints |
|
Authors: |
Geetha Baskaran, Andrzej
Bargiela, Rong Qu |
|
Published in:
|
(2009).ECMS
2009 Proceedings edited by J. Otamendi, A. Bargiela, J. L. Montes, L. M. Doncel
Pedrera. European Council for Modeling and
Simulation. doi:10.7148/2009 ISBN: 978-0-9553018-8-9 23rd
European Conference on Modelling and Simulation, Madrid, June
9-12, 2009 |
|
Citation
format: |
Baskaran, G., Bargiela,
A., & Qu, R. (2009). Hierarchical Method For
Nurse Rostering Based On Granular Pre-Processing Of
Constraints. ECMS 2009 Proceedings edited by J. Otamendi,
A. Bargiela, J. L. Montes, L. M. Doncel Pedrera (pp.
855-860). European Council for Modeling and Simulation. doi:10.7148/2009-0855-0860 |
|
DOI: |
http://dx.doi.org/10.7148/2009-0855-0860 |
|
Abstract: |
Nurse Rostering
problems represent a subclass of scheduling problems that are hard to solve.
Their complexity is due to the large solution spaces and the many objectives
and constraints that need to be fulfilled. In this study, we propose a
hierarchical method of granulation of problem domain through pre- processing
of constraints. A set of zero-cost patterns in the granulated search space
provides a basis for the generation of work schedules. Feasible schedules
calculated for week 1 are used to define zero-cost shift patterns that can be
deployed in week 2. These in turn are used for the generation of feasible
schedules for week 2. The process can be applied over the extended time
frame. We show that the granulation of the problem description in terms of
constraints and scheduling time frames leads to a more manageable computing
task. |
|
Full
text: |
|
