STORRE
STORRE: Stirling Online Research Repository
http://hdl.handle.net/1893/15763| Appears in Collections: | Computing Science and Mathematics Journal Articles |
| Peer Review Status: | Refereed |
| Title: | A shift sequence based approach for nurse scheduling and a new benchmark dataset |
| Author(s): | Brucker, Peter Burke, Edmund Curtois, Tim Qu, Rong Vanden Berghe, Greet |
| Contact Email: | e.k.burke@stir.ac.uk |
| Keywords: | Adaptive heuristic Benchmark Nurse rostering Shift sequence |
| Issue Date: | Aug-2010 |
| Date Deposited: | 3-Jul-2013 |
| Citation: | Brucker P, Burke E, Curtois T, Qu R & Vanden Berghe G (2010) A shift sequence based approach for nurse scheduling and a new benchmark dataset. Journal of Heuristics, 16 (4), pp. 559-573. https://doi.org/10.1007/s10732-008-9099-6 |
| Abstract: | 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 can further improve the constructed solutions for the benchmark problems tested. In addition, we introduce new benchmark nurse rostering datasets which are based upon real world data. The data sets represent a variety of real world constraints. The publication of this problem data to the research community is aimed at closing the gap between theory and practice in nurse scheduling research. One of the main objectives is to encourage more research on these data sets. |
| DOI Link: | 10.1007/s10732-008-9099-6 |
| 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. |
| Licence URL(s): | http://www.rioxx.net/licenses/under-embargo-all-rights-reserved |
| File | Description | Size | Format | |
|---|---|---|---|---|
| A shift sequence based approach for nurse scheduling and a new benchmark dataset.pdf | Fulltext - Published Version | 669.98 kB | Adobe PDF | Under Embargo until 3000-01-01 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 dependent 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.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.