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

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.

[1]  Slim Abdennadher,et al.  Nurse Scheduling using Constraint Logic Programming , 1999, AAAI/IAAI.

[2]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[3]  Kenneth R. Baker,et al.  Scheduling a Full-Time Workforce to Meet Cyclic Staffing Requirements , 1974 .

[4]  Kenneth R. Baker,et al.  Workforce Scheduling with Cyclic Demands and Day-Off Constraints , 1977 .

[5]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[6]  Mike Wright,et al.  School Timetabling Using Heuristic Search , 1996 .

[7]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[8]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[9]  Efthymios Housos,et al.  Hybrid optimization techniques for the workshift and rest assignment of nursing personnel , 2000, Artif. Intell. Medicine.

[10]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[11]  Kathryn A. Dowsland,et al.  Nurse scheduling with tabu search and strategic oscillation , 1998, Eur. J. Oper. Res..

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[13]  Mary Ann Frances Str.  Implementing a program of cyclical scheduling of nursing personnel. , 1966 .

[14]  Irène Charon,et al.  The noising methods: A generalization of some metaheuristics , 2001, Eur. J. Oper. Res..

[15]  Howell Jp,et al.  Cyclical scheduling of nursing personnel. , 1966 .

[16]  K D Dowsland,et al.  NURSE SCHEDULING WITH KNAPSACKS, NETWORKS AND TABU SEARCH , 2000 .

[17]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[18]  Hendrik Van Landeghem,et al.  The State of the Art of Nurse Rostering , 2004, J. Sched..

[19]  Jacques A. Ferland,et al.  A Multi-objective Approach to Nurse Scheduling with both Hard and Soft Constraints , 1996 .

[20]  Kathryn A. Dowsland,et al.  Solving a nurse scheduling problem with knapsacks, networks and tabu search , 2000, J. Oper. Res. Soc..

[21]  Uwe Aickelin,et al.  An Indirect Genetic Algorithm for a Nurse Scheduling Problem , 2004, Comput. Oper. Res..

[22]  E. Burke,et al.  Variable neighborhood search for nurse rostering problems , 2004 .

[23]  Roberto Tadei,et al.  A greedy-based neighborhood search approach to a nurse rostering problem , 2004, Eur. J. Oper. Res..

[24]  Kathryn A. Dowsland,et al.  Variants of simulated annealing for the examination timetabling problem , 1996, Ann. Oper. Res..

[25]  Edmund K. Burke,et al.  A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem , 1998, SEAL.

[26]  Jano van Hemert,et al.  SAW-ing EAs: adapting the fitness function for solving constrained problems , 1999 .

[27]  Irène Charon,et al.  The noising method: a new method for combinatorial optimization , 1993, Oper. Res. Lett..

[28]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .