A time predefined variable depth search for nurse rostering
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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Published: |
INFORMS
2013
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/28283/ |