A grasp-knapsack hybrid for a nurse-scheduling problem
2009
Journal of Heuristics
4
15
351-379
Journal_Article
Personnel_Planning_and_Scheduling
Algorithms_Heuristics
Operational_Offline
No
No
Article Link
Goodman, M. D. D., Kathryn A; Thompson, Jonathan M. (2009). A grasp-knapsack hybrid for a nurse-scheduling problem. [Journal Article]. Journal of Heuristics, 15(4), 351-379. doi: 10.1007/s10732-007-9066-7
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.