A Time Predefined Variable Depth Search for Nurse Rostering

References

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