|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||A Pareto-based search methodology for multi-objective nurse scheduling|
|Citation:||Burke E, Li J & Qu R (2012) A Pareto-based search methodology for multi-objective nurse scheduling, Annals of Operations Research, 196 (1), pp. 91-109.|
|Abstract:||In this paper, we propose a search technique for nurse scheduling, which deals with it as a multi-objective problem. For each nurse, we first randomly generate a set of legal shift patterns which satisfy all shift-related hard constraints. We then employ an adaptive heuristic to quickly find a solution with the least number of violations on the coverage-related hard constraint by assigning one of the available shift patterns of each nurse. Next, we apply a coverage repairing procedure to make the resulting solution feasible, by adding/removing any under-covered/over-covered shifts. Finally, to satisfy the soft constraints (or preferences), we present a simulated annealing based search method with the following two options: one with a weighted-sum evaluation function which encourages moves towards users' predefined preferences, and another one with a domination-based evaluation function which encourages moves towards a more diversified approximated Pareto set. Computational results demonstrate that the proposed technique is applicable to modern hospital environments.|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|Affiliation:||Deputy Principal's Office|
Computing Science and Mathematics
University of Nottingham
|A Pareto-based search methodology for multi-objective nurse scheduling.pdf||746.49 kB||Adobe PDF||Under Embargo until 31/12/2999 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependant on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.