Dissemin is shutting down on January 1st, 2025

Published in

Institute for Operations Research and Management Sciences, INFORMS Journal on Computing, 3(25), p. 411-419, 2013

DOI: 10.1287/ijoc.1120.0510

Links

Tools

Export citation

Search in Google Scholar

A Time Predefined Variable Depth Search for Nurse Rostering

Journal article published in 2013 by Edmund K. Burke, Timothy Curtois, Rong Qu ORCID, Greet Vanden Berghe
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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.