Skip to main content

Research Repository

See what's under the surface

Advanced Search

A time predefined variable depth search for nurse rostering

Burke, Edmund; Curtois, Tim; Qu, Rong; Vanden Berghe, Greet

Authors

Edmund Burke

Tim Curtois

Rong Qu

Greet Vanden Berghe



Abstract

This paper presents a variable depth search for the nurse rostering problem. The algorithm works by chaining together single neighbourhood swaps into more effective compound moves. It achieves this by using heuristics to decide whether to continue extending a chain and which candidates to examine as the next potential link in the chain. Because end users vary in how long they are willing to wait for solutions, a particular goal of this research was to create an algorithm that accepts a user specified computational time limit and uses it effectively. When compared against previously published approaches the results show that the algorithm is very competitive.

Journal Article Type Article
Publication Date Jan 1, 2013
Journal INFORMS Journal on Computing
Print ISSN 1091-9856
Electronic ISSN 1091-9856
Publisher INFORMS
Peer Reviewed Peer Reviewed
Volume 25
Issue 3
APA6 Citation Burke, E., Curtois, T., Qu, R., & Vanden Berghe, G. (2013). A time predefined variable depth search for nurse rostering. INFORMS Journal on Computing, 25(3), doi:10.1287/ijoc.1120.0510
DOI https://doi.org/10.1287/ijoc.1120.0510
Keywords Timetabling, personnel, local search, heuristics
Publisher URL http://pubsonline.informs.org/doi/abs/10.1287/ijoc.1120.0510
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf

Files

JOC12vds.pdf (321 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations

;