A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem

Authors:
Edmund K. Burke;Patrick De Causmaecker;Greet Vanden Berghe
Affiliations:
-;-;-
Venue:
SEAL'98 Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning
Year:
1998

Citing 3
Cited 12

Prolog-based system for nursing staff scheduling implemented on a personal computer

Computers and Biomedical Research
An approach to the generalized nurse scheduling problem: generation of a declarative program to represent institution-specific knowledge

Computers and Biomedical Research
Employee Timetabling, Constraint Networks and Knowledge-Based Rules: A Mixed Approach

Selected papers from the First International Conference on Practice and Theory of Automated Timetabling

A Hyperheuristic Approach to Scheduling a Sales Summit

PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
An optimal decision-making approach for the management of radiotherapy patients

OR Spectrum
A hybrid approach for solving real-world nurse rostering problems

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A tabu search evolutionary algorithm for solving constraint satisfaction problems

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Memetic algorithms for nurse rostering

ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Specializing narrowing for timetable generation: a case study

PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Analysis of three mathematical models of the Staff Rostering Problem

Journal of Scheduling
Nurse rostering using modified harmony search algorithm

SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
Solving nurse rostering problems by a multiobjective programming approach

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Cyclic staff scheduling: optimization models for some real-life problems

Journal of Scheduling
A harmony search algorithm for nurse rostering problems

Information Sciences: an International Journal
A Time Predefined Variable Depth Search for Nurse Rostering

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research were applied) tackled manually. The problem basically concerns the assignment of duties to a set of people with different qualifications, work regulations and preferences. Constraint programming and linear programming techniques can produce feasible solutions for this problem. However, the reality in Belgian hospitals forced us to use heuristics to deal with the over constrained schedules. An important reason for this decision is the calculation time, which the users prefer to reduce. The algorithms presented in this paper are a commercial nurse rostering product developed for the Belgian hospital market, entitled Plane.