Finding good nurse duty schedules: a case study

Authors:
M. J. Bester;I. Nieuwoudt;Jan H. Vuuren
Affiliations:
Applied Mathematics Division, Department of Mathematical Sciences, Stellenbosch University, Matieland, Republic of South Africa 7602;Applied Mathematics Division, Department of Mathematical Sciences, Stellenbosch University, Matieland, Republic of South Africa 7602;Department of Logistics, Stellenbosch University, Matieland, Republic of South Africa 7602
Venue:
Journal of Scheduling
Year:
2007

Citing 16
Cited 3

Tabu search

Modern heuristic techniques for combinatorial problems
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Solving a timetabling problem using hybrid genetic algorithms

Software—Practice & Experience
Hyperheuristics: A Robust Optimisation Method Applied to Nurse Scheduling

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
A Constraint-Based Nurse Rostering System Using a Redundant Modeling Approach

ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
A hybrid AI approach for nurse rostering problem

Proceedings of the 2003 ACM symposium on Applied computing
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
An indirect genetic algorithm for a nurse-scheduling problem

Computers and Operations Research
The State of the Art of Nurse Rostering

Journal of Scheduling
A 0-1 goal programming model for nurse scheduling

Computers and Operations Research
Guided Complete Search for Nurse Rostering Problem

ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence
A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem

Computers and Operations Research
Cyclic preference scheduling of nurses using a Lagrangian-based heuristic

Journal of Scheduling
Hybrid approaches for rostering: a case study in the integration of constraint programming and local search

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
New computational results for the nurse scheduling problem: a scatter search algorithm

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Hybrid optimization techniques for the workshift and rest assignment of nursing personnel

Artificial Intelligence in Medicine

A hybrid metaheuristic case-based reasoning system for nurse rostering

Journal of Scheduling
Medical doctor rostering problem in a hospital emergency department by means of genetic algorithms

Computers and Industrial Engineering
A categorisation of nurse rostering problems

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constructing duty schedules for nurses at large hospitals is a difficult problem. The objective is usually to ensure that there is always sufficient staff on duty, while taking into account individual preferences with respect to work patterns, requests for leave and financial restrictions, in such a way that all employees are treated fairly. The problem is typically solved via mixed integer programming or heuristic (local) search methods in the operations research literature. In this paper the problem is solved using a tabu search approach as a case study at Stikland Hospital, a large psychiatric hospital in the South African Western Cape, for which a computerized decision support system with respect to nurse scheduling was developed. This decision support system, called NuRoDSS (short for Nurse Rostering Decision Support System) is described in some detail.