Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdennadher, A., & Schlenker, H. (1999). Nurse scheduling using constraint logic programming. In Eleventh annual conference on innovative applications of artificial intelligence (IAAI).
Abramson, D. (1991). Constructing school timetables using simulated annealing: sequential and parallel algorithms. Management Science, 37, 98–113.
Aickelin, U., & Dowsland, K. A. (2004). An indirect genetic algorithm for a nurse scheduling problem. Computers and Operations Research, 31, 761–778.
Baker, K. (1974). Scheduling a full time workforce to meet cyclic staffing requirements. Management Science, 20, 1561–1568.
Baker, K., & Magazine, M. (1977). Workforce scheduling with cyclic demands and day off constraints. Management Science, 24, 161–167.
Bellanti, F., Carello, G., Della Croce, F., & Tadei, R. (2004). A greedy based neighbourhood search approach to a nurse rostering problem. European Journal of Operational Research, 153, 28–40.
Berrada, I., Ferland, J. A., & Michelon, P. (1996). A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Economic Planning Science, 30, 183–193.
Burke, E., De Causmaecker, P., & Vanden Berghe, G. (1998). A hybrid tabu search algorithm for the nurse rostering problem. In Lecture notes in artificial intelligence: Vol. 1585. Simulated evolution and learning, selected papers of SEAL, Canberra (pp. 187–194).
Burke, E., De Causmaecker, P., Petrovic, S., & Vanden Berghe, G. (2003). Variable neighbourhood search for nurse rostering problem. In M. G. C. Resende & J. P. de Sousa (Eds.), Combinatorial optimization book series. Metaheuristics: computer decision-making (pp. 153–172). Dordrecht: Kluwer, Chapter 7.
Burke, E., De Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004). The state of the art of nurse rostering. The Journal of Scheduling, 7, 441–499.
Charon, I., & Hurdy, O. (1993). The noising method: a new method for combinatorial optimization. Operations Research Letters, 14, 133–137.
Charon, I., & Hurdy, O. (2001). The noising methods: a generalization of some metaheuristics. European Journal of Operational Research, 135, 86–101.
Cheng, B. M. W., Lee, J. H. M., & Wu, J. C. K. (1996). A nurse rostering system using constraint programming and redundant modelling. Technical report, Department of Computer Science and Engineering at The Chinese University of Hong Kong.
Dowsland, K. A. (1993). Simulated annealing. In C. Reeves (Ed.), Modern heuristic techniques for combinatorial problems (pp. 20–63). Oxford: Blackwell.
Dowsland, K. A. (1998). Nurse scheduling with tabu search and strategic oscillation, European Journal of Operational Research, 393–407.
Dowsland, K. A., & Thompson, J. M. (2000). Nurse scheduling with knapsacks, networks and tabu search. Journal of the Operational Research Society, 825–833.
Eiben, A. E., & van Hemert, J. I. (1999). SAW-ing EAs: adapting the fitness function for solving constrained problems. In New ideas in optimization (pp. 389–402). London: McGraw-Hill, Chapter 26.
Frances, M. N. (1966). Implementing a program of cyclical scheduling of nursing personnel. Hospitals, 108–125, July 16.
Glover, F. (1989). Tabu search. Part I. ORSA Journal on Computing, 190–206.
Howell, J. P. (1966). Cyclical scheduling of nursing personnel. Hospitals, 77–85, January 16.
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 671–680.
Lundy, M., & Mees, A. (1986). Convergence of an annealing algorithm. Mathematical Programming, 111–124.
Thompson, J. M., & Dowsland, K. A. (1996). Variants of simulated annealing for the examination timetabling problem. Annals of Operations Research, 63, 105–128.
Valouxis, C., & Housos, E. (2000). Hybrid optimization techniques for the workshift and rest assignment of nursing personnel. Artificial Intelligence in Medicine, 20, 155–175.
Wright, M. (1996). School timetabling using heuristic search. Journal of the Operational Research Society, 47, 347–357.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Parr, D., Thompson, J.M. Solving the multi-objective nurse scheduling problem with a weighted cost function. Ann Oper Res 155, 279–288 (2007). https://doi.org/10.1007/s10479-007-0202-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0202-4