Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Solving a Nurse Scheduling Problem with Knapsacks, Networks and Tabu Search

Dowsland, Kathryn Anne and Thompson, Jonathan Mark 2000. Solving a Nurse Scheduling Problem with Knapsacks, Networks and Tabu Search. Journal of the Operational Research Society 51 (7) , pp. 825-833. 10.1057/palgrave.jors.2600970

Full text not available from this repository.


This paper illustrates how a modern heuristic and two classical integer programming models have been combined to provide a solution to a nurse rostering problem at a major UK hospital. Neither a heuristic nor an exact approach based on a standard IP package was able to meet all the practical requirements. This was overcome by using a variant of tabu search as the core method, but applying knapsack and network flow models in pre and post-processing phases. The result is a successful software tool that frees senior nursing staff from a time consuming administrative task.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Uncontrolled Keywords: manpower scheduling, integer programming, tabu search, health
Publisher: Palgrave Macmillan
ISSN: 0160-5682
Last Modified: 04 Jun 2017 04:09

Citation Data

Cited 93 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item