Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrucker, Peter-
dc.contributor.authorBurke, Edmund-
dc.contributor.authorCurtois, Tim-
dc.contributor.authorQu, Rong-
dc.contributor.authorVanden, Berghe Greet-
dc.description.abstractThis 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.en_UK
dc.relationBrucker 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.-
dc.rightsThe 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.-
dc.subjectAdaptive heuristicen_UK
dc.subjectNurse rosteringen_UK
dc.subjectShift sequenceen_UK
dc.titleA shift sequence based approach for nurse scheduling and a new benchmark dataseten_UK
dc.typeJournal Articleen_UK
dc.rights.embargoreasonThe publisher does not allow this work to be made publicly available in this Repository therefore there is an embargo on the full text of the work.-
dc.citation.jtitleJournal of Heuristics-
dc.type.statusPublisher version (final published refereed version)-
dc.contributor.affiliationUniversity of Osnabrück, Germany-
dc.contributor.affiliationComputing Science and Mathematics-
dc.contributor.affiliationUniversity of Nottingham-
dc.contributor.affiliationUniversity of Nottingham-
dc.contributor.affiliationKatholieke Universiteit, Leuven, Belgium-
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
A shift sequence based approach for nurse scheduling and a new benchmark dataset.pdf669.98 kBAdobe PDFUnder Permanent Embargo    Request a copy

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 providing details and we will remove the Work from public display in STORRE and investigate your claim.