A Time Predefined Variable Depth Search for Nurse Rostering

@article{Burke2013ATP,
  title={A Time Predefined Variable Depth Search for Nurse Rostering},
  author={Edmund K. Burke and Timothy Curtois and Rong Qu and Greet Vanden Berghe},
  journal={INFORMS Journal on Computing},
  year={2013},
  volume={25},
  pages={411-419}
}
A variety of neighbourhood operators have been used in local search and metaheuristic approaches to solving nurse rostering problems. We test and analyse the efficiency of these neighbourhoods on benchmark problems which are taken from real world scenarios. A variable depth search is then developed based on the results of this investigation. The algorithm heuristically chains together moves and swaps which define the more effective search neighbourhoods. A number of heuristics for creating… CONTINUE READING
Highly Cited
This paper has 27 citations. REVIEW CITATIONS
18 Citations
56 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 56 references

Investigating AhujaOrlin's Large Neighbourhood Search Approach for Examination Timetabling

  • S. Abdullah, S. Ahmadi, E. K. Burke, M. Dror
  • OR Spectrum,
  • 2007
1 Excerpt

Adaptive Construction of Nurse Schedules: A Shift Sequence Based Approach and New Benchmarks

  • P. Brucker, E. K. Burke, T. Curtois, R. Qu, G. Vanden Berghe
  • School of Computer Science and IT,
  • 2006
1 Excerpt

Similar Papers

Loading similar papers…