Metaheuristics for handling time interval coverage constraints in nurse scheduling

Applied Artificial Intelligence

Volumn 20, Issue 9, 2006, Pages 743-766

  Burke, Edmund K ^a   De Causmaecker, Patrick ^b   Petrovic, Sanja ^a   Berghe, Greet Vanden ^b  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

^b ODISEE UNIVERSITY COLLEGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; HOSPITALS; MANAGERS; SCHEDULING;

CONSTRAINED PROBLEMS; HEALTHCARE INSTITUTIONS; ORGANIZATIONAL PROCEDURES;

CONSTRAINT THEORY;

EID: 33750353310     PISSN: 08839514     EISSN: 10876545     Source Type: Journal    
DOI: 10.1080/08839510600903841     Document Type: Article

References (36)

1. Abernathy, W. J., N. Baloff, J. C. Hershey, and S. Wandel. 1973. A three-stage manpower planning and scheduling model: A service-sector example. Operations Research 22:693-711.
2. Aickelin, U. and K. Dowsland. 2000. Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling 3(3):139-153.
3. Aickelin, U. and J. Li. 2007. An estimation of distribution algorithm for nurse scheduling. Annals of Operations Research, Special Issue on Personnel Scheduling and Planning, eds. Petrovic and Vanden Berghe (to appear).
4. Bard, J. F. and H. W. Purnomo. 2005. A column generation-based approach to solve the preference scheduling problem for nurses with downgrading. Socio-Economic Planning Sciences 39:193-213.
5. Bard, J. F. and H. W. Purnomo. 2007. Cyclic preference scheduling of nurses using a lagrangian-based heuristic. Journal of Scheduling 10(1).
6. Beddoe, G. R. and S. Petrovic. 2006. Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering. European Journal of Operational Research 175:647-671.
7. Brusco, M. J., L. W. Jacobs, R. J. Bongiorno, D. V. Lyons, and B. Tang. 1995. Improving personnel scheduling at airline stations. Operations Research 43(5):741-751.
8. Burke, E. K., P. Cowling, P. De Causmaecker, and G. Vanden Berghe. 2001a. A memetic approach to the nurse rostering problem. Applied Intelligence 15 (3): 199-214.
9. Burke, E. K., P. De Causmaecker, S. Petrovic, and G. Vanden Berghe. 2001b. Fitness Evaluation for Nurse Scheduling Problems. In Proceedings of Congress on Evolutionary Computation, 1139-1148, Seoul, Korea: IEEE Press.
10. Burke, E. K., P. De Causmaecker, S. Petrovic, and G. Vanden Berghe. 2004a. Variable neighbourhood search for nurse rostering problems. In: Metaheuristics: Computer Decision-Making, eds. M. G. C. Resende and J. Pinho de Sousa, 153-172, Dordrecht: Kluwer.
11. Burke, E. K., P. De Causmaecker, and G. Vanden Berghe. 2004b. Novel meta-heuristic approaches to nurse rostering problems in Belgian hospitals. In Handbook of Scheduling: Algorithms, Models and Performance Analysis, 44.1-44.18, Boca Raton: CRC Press.
12. Burke, E. K., P. De Causmaecker, G. Vanden Berghe, and H. Van Landeghem. 2004c. The state of the art of nurse rostering. Journal of Scheduling 7(6):441-499.
13. Burke, E. K., P. De Causmaecker, and G. Vanden Berghe. 1999. A hybrid tabu search algorithm for the nurse rostering problem. In: Simulated Evolution and Learning, Lecture Notes in Artificial Intelligence, eds. B. McKay et al., Vol. 1585, 187-194, Canberra: Springer.
14. Chiarandini, M., A. Schaerf, and F. Tiozzo. 2000. Solving employee timetabling problems with flexible workload using Tabu search. Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling, pages 298-302, Konstanz.
15. De Causmaecker, P. and G. Vanden Berghe. 2002. Relaxation of coverage constraints in hospital personnel rostering. In Proceedings of the Practice and Theory of Automated Timetabling, Fourth International Conference, pages 129-147, Gent, Belgium Springer.
16. Dowsland, K. 1998. Nurse scheduling with Tabu search and strategic oscillation. European Journal of Operational Research 106:393-407.
17. Hung, R. 1991. A cyclical schedule of 10-hour, four-day workweeks. Nursing Management 22(5): 30-33.
18. Isken, M. and W. Hancock. 1990. A heuristic approach to nurse scheduling in hospital units with non-stationary, urgent demand, and a fixed staff size. Journal of the Society for Health Systems 2(2): 24-41.
19. Jan, A., M. Yamamoto, and A Ohuchi. 2000. Evolutionary algorithms for nurse scheduling problem. In Proceedings of the 2000 Congress on Evolutionary Computation, pages 196-203, San Diego, California, USA.
20. Meisels, A. and N. Lusternik. 1997. Experiments in networks of employee timetabling problems. In Proceedings of the Practice and Theory of Automated Timetabling, Second International Conference, pages 130-141, Toronto, Ontario: Springer.
21. Meisels, A., E. Gudes, and G. Solotorevski. 1995. Employee timetabling, constraint networks and knowledge-based rules: A mixed approach. In Proceedings of the Practice and Theory of Automated Timetabling, First International Conference, pages 93-105, Edinburgh, Scotland, Springer.
22. Meyer auf'm Hofe, H. 1997. ConPlan/SIEDAplan: Personnel assignment as a problem of hierarchical constraint satisfaction. In Proceedings of the Third International Conference on the Practical Application of Constraint Technology, London, pages 257-271.
23. Meyer auf'm Hofe, H. 2001. Solving rostering tasks as constraint optimization. In Proceedings of the Practice and Theory of Automated Timetabling, Third International Conference, pages 191-212, Konstanz, Springer.
24. Muslija, N., J. Gaertner, and W. Slany. 2000. Efficient generation of rotating workforce schedules. In Proceedings of the 3rd International Conference on the Practice and Theory of Automated Timetabling, pages 314-332, Konstanz.
25. Musliu, N., A Schaerf, and W. Slany. 2001. Local search for shift design. In Proceedings of the 4th Metaheuristics International Conference, (MIC' 2001), pages 465-469.
26. Miller, H., W. Pierskalla, and G. Rath. 1976. Nurse scheduling using mathematical programming. Operations Research 24:857-870.
27. Parr, D. and J. M. Thompson. (2007). Solving the multi-objective nurse scheduling problem with a weighted cost function. Annals of Operations Research, Special Issue on Personnel Scheduling and Planning, eds. Petrovic and Vanden Berghe (to appear).
28. Petrovic, S., G. R. Beddoe, and G. Vanden Berghe. 2002. Case-Based Reasoning in Employee Rostering: Learning Repair Strategies from Domain Experts. Technical Report NOTTCS-TR-2002-4, Automated Scheduling Optimisation and Planning Research Group, School of Computer Science and Information Technology, University of Nottingham.
29. Petrovic, S., G. R. Beddoe, and G. Vanden Berghe. 2003. Storing and adapting repair experiences in employee rostering. In Proceedings of the 4th International Conference on Practice and Theory of Automated Timetabling (PATAT 2002), pages 149-166, Gent, Belgium, Springer.
30. Schaerf, A. and A. Meisels. 1999. Solving employee timetabling problems by generalised local search. In Proceedings of the Italian AI (AIIA-99), pages 493-502, Springer.
31. Scott, S. and R. M. Simpson. 1998. Case-bases incorporating scheduling constraint dimensions: Experiences in nurse rostering. In Advances in Case-Based Reasoning, eds. Smyth and Cunningham, pages 392-401, Huddersfield, Springer.
32. Tanomaru, J. 1995. Staff scheduling by a genetic algorithm with heuristic operators. In Proceedings of the IEEE Conference on Evolutionary Computation, pages 456-461.
33. Trivedi, V. M. and M. Warner. 1976. A branch and bound algorithm for optimum allocation of float nurses. Management Science 22(9):972-981.
34. Warner, M. 1976. Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Operations Research 24:842-856.
35. Warner, M. and J. Prawda. 1972. A mathematical programming model for scheduling nursing personnel in a hospital. Management Science 19:411-422.
36. Winstanley, G. 2004. Distributed and devolved work allocation planning. Applied Artificial Intelligence 18(2):97-115.