A time predefined variable depth search for nurse rostering

INFORMS Journal on Computing

Volumn 25, Issue 3, 2013, Pages 411-419

  Burke, Edmund K ^a   Curtois, Timothy ^b   Qu, Rong ^b   Vanden Berghe, Greet ^c,d  

^a UNIVERSITY OF STIRLING   (United Kingdom)

^b UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^c KAHO Sint Lieven ^*  (Belgium)

^d UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Heuristics; Local search; Personnel; Timetabling

Indexed keywords

COMPUTATIONAL TIME; END USERS; HEURISTICS; LOCAL SEARCH; NEIGHBOURHOOD; NURSE ROSTERING; TIMETABLING; VARIABLE DEPTH SEARCH;

ALGORITHMS; PERSONNEL;

NURSING;

EID: 84881160541     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1120.0510     Document Type: Article

References (48)

1. Abdullah S, Ahmadi S, Burke EK, Dror M (2007a) Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling. OR Spectrum 29(2):351-372.
2. Abdullah S, Ahmadi S, Burke EK, Dror M, McCollum B (2007b) A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem. J. Oper. Res. Soc. 58(11):1494-1502. (Pubitemid 47585090)
3. Ahuja RK, Ergun O, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123(1-3):75-102.
4. Aickelin U, Li J (2007) An estimation of distribution algorithm for nurse scheduling. Ann. Oper. Res. 155(1):289-309.
5. Aickelin U, Burke EK, Li J (2007) An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. J. Oper. Res. Soc. 58(12):1574-1585. (Pubitemid 350129146)
6. Arthur JL, Ravindran A (1981) A multiple objective nurse scheduling model. AIIE Trans. 13(1):55-60. (Pubitemid 11496545)
7. Azaiez MN, Al Sharif SS (2005) A 0-1 goal programming model for nurse scheduling. Comput. Oper. Res. 32(3):491-507
8. Bard JF, Purnomo HW (2007) Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. J. Scheduling 10(1): 5-23. (Pubitemid 44914826)
9. Beddoe GR, Petrovic S (2006) Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering. Eur. J. Oper. Res. 175(2):649-671. (Pubitemid 44345066)
10. Beddoe GR, Petrovic S (2007) Enhancing case-based reasoning for personnel rostering with selected tabu search concepts. J. Oper. Res. Soc. 58(12):1586-1598. (Pubitemid 350129147)
11. Bellanti F, Carello G, Croce FD, Tadei R (2004) A greedy-based neighborhood search approach to a nurse rostering problem. Eur. J. Oper. Res. 153(1):28-40.
12. Berrada I, Ferland JA, Michelon P (1996) A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Econom. Planning Sci. 30(3):183-193. (Pubitemid 126395048)
13. Bourdais S, Galinier P, Pesant G (2003) HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care (Lecture Notes in Computer Science 2833, Springer-Verlag, Berlin).
14. Brucker P, Burke EK, Curtois T, Qu R, Vanden Berghe G (2009) A shift sequence based approach for nurse scheduling and a new benchmark data set. J. Heuristics 16(4):559-573.
15. Burke EK, Kendall G, Soubeiga E (2003) A tabu-search hyperheuristic for timetabling and rostering. J. Heuristics 9(6):451-470.
16. Burke EK, Li J, Qu R (2010) A hybrid model of integer programming and variable neighbourhood search for highlyconstrained nurses rostering problems. Eur. J. Oper. Res. 203(2):484-493.
17. Burke EK, Cowling P, De Causmaecker P, Vanden Berghe G (2001) A memetic approach to the nurse rostering problem. Appl. Intelligence 15(3):199-214. (Pubitemid 32897608)
18. Burke EK, Curtois T, Post G, Qu R, Veltman B (2008a) A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur. J. Oper. Res. 188(2):330-341.
19. Burke EK, Curtois T, Qu R, Vanden Berghe G (2008b) Problem model for nurse rostering benchmark instances. Accessed May 18, 2012, http://www.cs.nott. ac.uk/-tec/NRP/papers/ANROM.pdf.
20. Burke EK, De Causmaecker P, Vanden Berghe G (1999) A hybrid tabu search algorithm for the nurse rostering problem. 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), 187-194.
21. Burke EK, De Causmaecker P, Petrovic S, Vanden Berghe G (2004a) Variable neighborhood search for nurse rostering problems. Resende MGC, de Sousa JP, eds Metaheuristics: Computer Decision-Making (Kluwer, Norwell, MA), 153-172.
22. Burke EK, De Causmaecker P, Vanden Berghe G, Van Landeghem H (2004b) The state of the art of nurse rostering. J. Scheduling 7(6):441-499.
23. Darmoni SJ, Fajner A, Mahé N, Leforestier A, Vondracek M, Stelian O, Baldenweck M (1995) Horoplan: Computer-assisted nurse scheduling using constraint-based programming J. Soc. for Health Systems 5(1):41-54.
24. Dias TM, Ferber DF, de Souza CC, Moura AV (2003) Constructing nurse schedules at large hospitals. Internat. Trans. Oper. Res. 10(3):245-265.
25. Dowsland KA (1998) Nurse scheduling with tabu search and strategic oscillation. Eur. J. Oper. Res. 106(2):393-407. (Pubitemid 128399659)
26. Ernst AT, Jiang H, Krishnamoorthy M, Owens B, Sier D (2004) An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. 127(1-4):21-144. (Pubitemid 39056528)
27. Glover F (1996) Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Appl. Math. 65(1-3):223-253. (Pubitemid 126386270)
28. Glover F, Laguna M, Martí R (2000) Fundamentals of scatter search and path relinking. Control and Cybernetics 29(3):653-684.
29. Jaszkiewicz A (1997) A metaheuristic approach to multiple objective nurse scheduling. Foundations Comput. Decision Sci. 22(3):169-183.
30. Jaumard B, Semet F, Vovor T (1998) A generalized linear programming model for nurse scheduling. Eur. J. Oper. Res. 107(1):1-18. (Pubitemid 128391324)
31. Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: Model, taxonomy and design issues. IEEE Trans. Evolutionary Comput. 9(5):474-488. (Pubitemid 41522757)
32. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2):498-516.
33. Louw MJ, Nieuwoudt I, Van Vuuren JH (2005) Finding good nursing duty schedules: A case study. Technical report, Department of Applied Mathematics, Stellenbosch University, South Africa.
34. Mason AJ, Smith MC (1998) A nested column generator for solving rostering problems with integer programming. Caccetta L, Teo KL, Siew PF, Leung YH, Jennings LS, Rehbock V, eds. Internat. Conf. Optim.: Techniques Appl. (Perth, Australia), 827-834.
35. Meisels A, Schaerf A (2003) Modelling and solving employee timetabling problems. Ann. Math. Artificial Intelligence 39(1-2):41-59.
36. Meisels A, Gudes E, Solotorevsky G (1995) Employee timetabling, constraint networks and knowledge-based rules: A mixed approach. Burke E, Ross P, eds. Selected papers from the First Internat. Conf. Practice and Theory of Automated Timetabling (Springer Lecture Notes in Computer Science, Springer-Verlag, Berlin), Vol. 1154. 93-105. (Pubitemid 126141961)
37. Meyer auf'm Hofe H (2000) Solving Rostering Tasks as Constraint Optimization. Burke EK, Erben W, eds. Selected Papers from the Third Internat. Conf. Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science, Vol. 2079 (Springer-Verlag, Berlin), 191-212.
38. Meyers C, Orlin JB (2006) Very large-scale neighborhood search techniques in timetabling problems. Burke EK, Rudova H, eds, Proc. 6th Internat. Conf. Practice and Theory of Automated Timetabling, Brno, Czech Republic, (Masaryle University, Czech Republic) 36-52.
39. Miller HE, Pierskalla WP, Rath GI (1976) Nurse scheduling using mathematical programming. Oper. Res. 24(5):857-870.
40. Pesch E, Glover F (1997) TSP ejection chains. Discrete Appl. Math. 76(1-3):165-181. (Pubitemid 127414709)
41. Rego C (1998) A subpath ejection method for the vehicle routing problem. Management Sci. 44(10):1447-1459. (Pubitemid 128591672)
42. Ross P (2005) Hyper-heuristics. Burke EK, Kendall G, eds Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques (Springer), 529-556.
43. Thornton J, Sattar A (1997) Nurse rostering and integer programming revisited. Verma B, Yao X, eds. Internat. Conf. Computat. Intelligence and Multimedia Appl. (Griffith University, Gold Coast, Australia), 49-58.
44. Valouxis C, Housos E (2000) Hybrid optimization techniques for the workshift and rest assignment of nursing personnel. Artificial Intelligence in Medicine 20(2):155-175. (Pubitemid 30629000)
45. Vanden Berghe G (2002) An advanced model and novel metaheuristic solution methods to personnel scheduling in healthcare, University of Gent, Belgium, Ph.D. Thesis.
46. Warner DM (1976) Scheduling nursing personnel according to nursing preference: A mathematical programming approach Oper. Res. 24(5):842-856.
47. Yagiura M, Yamaguchi T, Ibaraki T (1999) A variable depth search algorithm for the generalized assignment problem. Voss S, Martello S, Osman IH, Roucairol C, eds. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization (Kluwer Academic Publishers, Boston), 459-471.
48. Zobrist AL (1970) A new hashing method with application for game playing. Computer Science Department, University of Wisconsin. Technical Report 88, http://ftp.cs.wisc.edu/pub/techreports/1970/TR88.pdf.