Work

A Time Predefined Variable Depth Search for Nurse Rostering

Year: 2012

Type: article

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.

Source: INFORMS journal on computing

DOI: 10.1287/ijoc.1120.0510

Authors: Edmund K. Burke, Timothy Curtois, Rong Qu, Greet Vanden Berghe

Institutions: University of Stirling, University of Nottingham, KU Leuven

Language: English

Topic: Scheduling and Timetabling Solutions

Subfield: Management Science and Operations Research

Field: Decision Sciences

Domain: Social Sciences

Open Access status: green

Funder: Engineering and Physical Sciences Research Council

Awards: G2773246229, G5147293183