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

A GRASP-knapsack hybrid for a nurse-scheduling problem

Goodman, Melissa D., Dowsland, Kathryn Anne and Thompson, Jonathan Mark 2009. A GRASP-knapsack hybrid for a nurse-scheduling problem. Journal of Heuristics 15 (4) , pp. 351-379. 10.1007/s10732-007-9066-7

Full text not available from this repository.


This paper is concerned with the application of a GRASP approach to a nurse-scheduling problem in which the objective is to optimise a set of preferences subject to a set of binding constraints. The balance between feasibility and optimality is a key issue. This is addressed by using a knapsack model to ensure that the solutions produced by the construction heuristic are easy to repair. Several construction heuristics and neighbourhoods are compared empirically. The best combination is further enhanced by a diversification strategy and a dynamic evaluation criterion. Tests show that it outperforms previously published approaches and finds optimal solutions quickly and consistently

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Publisher: Springer
ISSN: 1381-1231
Last Modified: 04 Jun 2017 01:41

Citation Data

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

Actions (repository staff only)

Edit Item Edit Item