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

Solving the multi-objective nurse scheduling problem with a weighted cost function

Parr, D. and Thompson, Jonathan Mark 2007. Solving the multi-objective nurse scheduling problem with a weighted cost function. Annals of Operations Research 155 (1) , pp. 279-288. 10.1007/s10479-007-0202-4

Full text not available from this repository.


The primary objective of the nurse scheduling problem is to ensure there are sufficient nurses on each shift. There are also a number of secondary objectives designed to make the schedule more pleasant. Neighbourhood search implementations use a weighted cost function with the weights dependent on the importance of each objective. Setting the weights on binding constraints so they are satisfied but still allow the search to find good solutions is difficult. This paper compares two methods for overcoming this problem, SAWing and Noising with simulated annealing and demonstrates that Noising produces better schedules.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
R Medicine > RT Nursing
Uncontrolled Keywords: Nurse scheduling · Meta-heuristic · Simulated annealing · SAWing · Noising
ISSN: 1572-9338
Last Modified: 04 Jun 2017 01:41

Citation Data

Cited 55 times in Google Scholar. View in Google Scholar

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

Actions (repository staff only)

Edit Item Edit Item