A scatter search methodology for the nurse rostering problem

Journal of the Operational Research Society

Volumn 61, Issue 11, 2010, Pages 1667-1679

  Burke, E K ^a   Curtois, T ^a   Qu, R ^a   Vanden Berghe, G ^b,c  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b KAHO   (Belgium)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

heuristics; nurse rostering; scatter search

Indexed keywords

BENCHMARKING; SCHEDULING;

ASSOCIATED COSTS; HEURISTICS; LEISURE TIME; NURSE ROSTERING; NURSE SCHEDULING; PATIENT SERVICES; PROBLEM DOMAIN; SCATTER SEARCH;

NURSING;

EID: 77957707294     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.118     Document Type: Article

References (38)

1. Aickelin U, Burke EK and Li J (2007). An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. J Opl Res Soc 58: 1574-1585.
2. Aickelin U and Dowsland KA (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J Sched 3: 139-153.
3. Aickelin U and Dowsland KA (2003). An indirect genetic algorithm for a nurse scheduling problem. Comput Oper Res 31: 761-778.
4. Bard JF and Purnomo HW (2005). Preference scheduling for nurses using column generation. Eur J Opl Res 164: 510-534.
5. Bard JF and Purnomo HW (2007). Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. J Sched 10: 5-23.
6. Beddoe GR and Petrovic S (2006). Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering. Eur J Opl Res 175: 649-671.
7. Beddoe GR and Petrovic S (2007). Enhancing case-based reasoning for personnel rostering with selected tabu search concepts. J Opl Res Soc 58: 1586-1598.
8. Bellanti F, Carello G, Croce FD and Tadei R (2004). A greedy-based neighborhood search approach to a nurse rostering problem. Eur J Opl Res 153: 28-40.
9. Brucker P, Burke EK, Curtois T, Qu R and Vanden Berghe G (2009). A shift sequence based approach for nurse scheduling and a new benchmark dataset. J Heuristics, available online, doi:10.1007/s10732-008-9099-6.
10. Burke EK, De Causmaecker P and Vanden Berghe G (1999). A hybrid tabu search algorithm for the nurse rostering problem. In: McKay B, Yao X, Newton CS, Kim J, Furuhashi T (eds). Simulated Evolution and Learning Selected Papers from the 2nd Asia-Pacific Conference on Simulated Evolution and Learning, SEAL 98. Springer Lecture Notes in Artificial Intelligence, Vol. 1585. Springer-Verlag: London, UK, pp 187-194.
11. Burke EK, Cowling P, De Causmaecker P and Vanden Berghe G (2001). A memetic approach to the nurse rostering problem. Appl Intell 15: 199-214.
12. Burke EK, Kendall G and Soubeiga E (2003). A tabu-search hyperheuristic for timetabling and rostering. J Heuristics 9: 451-470.
13. Burke EK, De Causmaecker P, Petrovic S and Vanden Berghe G (2004a). Variable neighborhood search for nurse rostering problems. In: Resende MGC de Sousa JP (eds). Metaheuristics: Computer Decision-Making, Kluwer: Norwell: MA, USA, pp 153-172.
14. Burke EK, De Causmaecker P, Vanden Berghe G and Van Landeghem H (2004b). The state of the art of nurse rostering. J Sched 7: 441-499.
15. Burke EK, Curtois T, Qu R and Vanden Berghe G (2007). A time predefined variable depth search for nurse rostering. Technical Report. School of Computer Science and IT, University of Nottingham.
16. Burke EK, Li J and Qu R (2008a). A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurses rostering problems. Eur J Opl Res, accepted for publication.
17. Burke EK, Curtois T, Post G, Qu R and Veltman B (2008b). A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur J Opl Res 188: 330-341.
18. Burke EK, Curtois T, Qu R and Vanden Berghe G (2009). Problem model for nurse rostering benchmark instances, http://www.cs.nott.ac.uk/~tec/NRP/papers/ ANROM.pdf.
19. Campos V, Glover F, Laguna M and Martí R (2001). An experimental evaluation of a scatter search for the linear ordering problem. J Global Optim 21: 397-414.
20. Cung V-D, Mautor T, Michelon P and Tavares A (1997). A scatter search based approach for the quadratic assignment problem. In: Back T, Michalewicz Z and Yao X, (eds). Proceedings of IEEE International Conference on Evolutionary Computation, IEEE Press: Piscataway: NJ, USA, pp 165-169.
21. Dias TM, Ferber DF, deSouza CC and Moura AV (2003). Constructing nurse schedules at large hospitals. Int Trans Opl Res 10: 245-265.
22. Dowsland KA and Thompson JM (2000). Solving a nurse scheduling problem with knapsacks, networks and tabu search. J Opl Res Soc 51: 825-833.
23. Ernst AT, Jiang H, Krishnamoorthy M, Owens B and Sier D (2004a). An annotated bibliography of personnel scheduling and rostering. Ann Oper Res 127: 21-144.
24. Ernst AT, Jiang H, Krishnamoorthy M and Sier D (2004b). Staff scheduling and rostering: a review of applications, methods and models. Eur J Opl Res 153: 3-27.
25. Glover F (1998). A template for scatter search and path relinking. In: Hao JK, Lutton E, Ronald E, Schoenauer M and Snyers D (eds). Lecture Notes in Computer Science, Vol. 1363. Springer-Verlag: London, UK, pp 13-54.
26. Glover F, Laguna M and Martí R (2000). Fundamentals of scatter search and path relinking. Control Cybern 29: 653-684.
27. Glover F, Laguna M and Martí R (2003). Scatter search. In: Ghosh A and Tsutsui S (eds). Advances in Evolutionary Computing. Springer-Verlag: Berlin: Heidelberg, pp 519-539.
28. Glover F, Løkketangen A and Woodruff DL (2000). Scatter search to generate diverse MIP solutions. In: Laguna M, González-Velarde JL (eds). OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, Kluwer: Norwell: MA, USA, pp 299-317.
29. Greistorfer P (2003). A tabu scatter search metaheuristic for the arc routing problem. Comp Ind Eng 44: 249-266.
30. Jan A, Yamamoto M and Ohuchi A (2000). Evolutionary algorithms for nurse scheduling problem. Proceedings of the 2000 Congress on Evolutionary Computation, IEEE Press: Piscataway: NJ, USA, pp 196-203.
31. Jaszkiewicz A (1997). A metaheuristic approach to multiple objective nurse scheduling. Found Comput Decis Sci 22: 169-183.
32. Jaumard B, Semet F and Vovor T (1998). A generalized linear programming model for nurse scheduling. Eur J Opl Res 107: 1-18.
33. Laguna M and Martí R (2003). Scatter Search. Methodology and Implementation in C. Kluwer Academic Publishers: Norwell, MA, USA.
34. Lourenço H, Laguna M and Martí R (2000). Assigning proctors to exams with scatter search. In: Laguna M and González-Velarde JL (eds). Computing Tools for Modeling, Optimization and Simulation. Kluwer: Norwell: MA: USA, pp 215-228.
35. Maenhout B and Vanhoucke M (2006). New computational results for the nurse scheduling problem: a scatter search algorithm. In: Gottlieb J and Raidl GR, (eds). Proceedings of the 6th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2006), Lecture Notes in Computer Science, Vol. 3906, Budapest, Hungary, Springer: Berlin, Heidelberg, pp 159-170.
36. Meisels A and Schaerf A(2003). Modelling and solving employee timetabling problems. Ann Math Artif Intel 39: 41-59.
37. Meyer auf'm Hofe H (2000). Solving rostering tasks as constraint optimization. In: Burke EK and Erben W (eds). Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag: Berlin, Heidelberg, pp 191-212.
38. Thornton J and Sattar A (1997). Nurse rostering and integer programming revisited. In: Verma B and Yao X, (eds). International Conference on Computational Intelligence and Multimedia Applications, Griffith University: Gold Coast, Australia, pp 49-58.