A grasp-knapsack hybrid for a nurse-scheduling problem
- 304 Downloads
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.
KeywordsNurse-scheduling Rostering GRASP Hybrid Knapsack
Unable to display preview. Download preview PDF.
- Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A GRASP for job shop scheduling. Essays Surv. Metaheuristics 15, 81–100 (2001) Google Scholar
- Burke, E., De Causemaecker, P., Petrovic, S., Vanden Berghe, G.: Variable neighbourhood search for nurse rostering problems. In: Resende, M.G.C., de Sousa, J.P. (eds.) METAHEURISTICS: Computer Decision-Making, pp. 153–172. Kluwer Academic, Dordrecht (2003a), Chapter 7 Google Scholar
- Fuller, E.: Tackling scheduling problems using integer programming. Master Thesis, University of Wales Swansea, United Kingdom (1998) Google Scholar
- Meyer auf’m Hofe, H.: Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies, In: DIMACS Workshop on Constraints Programming and Large Scale Discrete Optimisation, pp. 67–100 (2000) Google Scholar
- Petrovic, S., Beddoe, G., Vanden Berghe, G.: Storing and adapting repair experiences in personnel rostering. In: Burke, E.K., De Causemaecker, P. (eds.) Practice and Theory of Automated Timetabling, Fourth International Conference, Gent. Lecture Notes in Computer Science, vol. 2740, pp. 149–166. Springer, Berlin (2003) Google Scholar
- Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures (GRASP). Encyclopedia of Optimisation, vol. 2, pp. 373–382. Kluwer Academic, Dordrecht (2001) Google Scholar