A component-based heuristic search method with evolutionary eliminations for hospital personnel scheduling

INFORMS Journal on Computing

Volumn 21, Issue 3, 2009, Pages 468-479

  Li, Jingpeng ^a   Aickelin, Uwe ^a   Burke, Edmund K ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Constructive heuristic; Evolutionary elimination; Local search; Nurse rostering

Indexed keywords

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

References (42)

1. Ahuja R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
2. Aickelin U., K. Dowsland. 2000. Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J. Scheduling 3(3) 139-153.
3. Aickelin U., K. Dowsland. 2003. An indirect genetic algorithm for a nurse scheduling problem. Comput. Oper. Res. 31(5) 761-778.
4. Aickelin U., J. Li. 2007. An estimation of distribution algorithm for nurse scheduling. Ann. Oper. Res. 155(1) 289-309.
5. Aickelin U., P. White. 2004. Building better nurse scheduling algorithms. Ann. Oper. Res. 128(1-4) 159-177.
6. Aickelin U., E. K. Burke, J. Li. 2007. An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering. J. Oper. Res. 58 1574-1585.
7. Aickelin U., E. K. Burke, J. Li. 2009. An evolutionary squeaky wheel optimization approach to personnel scheduling. IEEE Trans. Evolut. Comput. 13(2) 433-443.
8. Anzai M., Y. Miura. 1987. Computer program for quick work scheduling of nursing staff. Medical Informatics 12(1) 43-52.
9. Bard J., H. W. Purnomo. 2006. Preference scheduling for nurses using column generation. Eur. J. Oper. Res. 164(2) 510-534.
10. Bard J., H. W. Purnomo. 2007. A cyclic preference scheduling of nurses using a Lagrangian-based heuristic. J. Scheduling 10 5-23.
11. Beddoe G., S. Petrovic. 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.
12. Beliën J., E. L. Demeulemeester. 2006. Building cyclic master surgery schedules with leveled resulting bed occupancy. Eur. J. Oper. Res. 176(2) 1185-1204.
13. Blau R. 1985. Multishift personnel scheduling with a microcomputer. Personnel Administrator 20 43-58.
14. Bradley D., J. Martin. 1990. Continuous personnel scheduling algorithms: A literature review. J. Soc. Health Systems 2(2) 8-23.
15. Brusco M. J., L. W. Jacobs. 1995. Cost analysis of alternative formulations for personnel scheduling in continuously operating organisations. Eur. J. Oper. Res. 86(2) 249-261.
16. Burke E. K., P. De Causmaecker, G. Vanden Berghe. 1999. A hybrid tabu search algorithm for the nurse rostering problem. B. McKay, X. Yao, C. S. Newton, J.-H. Kim, T. Furuhashi, eds. Simulated Evolution and Learning. Lecture Notes in Computer Science, Vol. 1585. Springer, Berlin, 187-194.
17. Burke E. K., G. Kendall, E. Soubeiga. 2003a. A tabu-search hyperheuristic for timetabling and rostering. J. Heuristics 9(6) 451-470.
18. Burke E. K., P. Cowling, P. De Causmaecker, G. Vanden Berghe. 2001. A memetic approach to the nurse rostering problem. Appl. Intelligence 15(3) 199-214.
19. Burke E. K., P. De Causmaecker, S. Petrovic, G. Vanden Berghe. 2004a. Variable neighbourhood search for nurse rostering problems. M. G. C. Resende, J. P. De Sousa, eds. Metaheuristics: Computer Decision-Making, Chapter 7. Combinatorial Optimization Book Series. Kluwer, Norwell, MA, 153-172.
20. Burke E. K, P. De Causmaecker, G. Vanden Berghe, H. Van Landeghem. 2004b. The state of the art of nurse rostering. J. Scheduling 7(6) 441-499.
21. Burke E. K., G. Kendall, J. Newall, E. Hart, P. Ross, S. Schulenburg. 2003b. Hyper-heuristics: An emerging direction in modern search technology. F. Glover, G. Kochenberger, eds. Handbook of Metaheuristics. International Series in Operations Research and Management Series, Vol. 57. Kluwer, Norwell, MA, 457-470.
22. Cheang B., H. Li, A. Lim, B. Rodrigues. 2003. Nurse rostering problems-A bibliographic survey. Eur. J. Oper. Res. 151(3) 447-460.
23. Chen J. G., T. Yeung. 1993. Hybrid expert system approach to nurse scheduling. Comput. Nursing 11(4) 183-192.
24. Dowsland K. 1998. Nurse scheduling with tabu search and strategic oscillation. Eur. J. Oper. Res. 106(2-3) 393-407.
25. Dowsland K., J. Thompson. 2000. Nurse scheduling with knapsacks, networks and tabu search. J. Oper. Res. Soc. 51 825-833.
26. Ernst A. T., H. Jiang, M. Krishnamoorthy, D. Sier. 2004a. Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. 153(1) 3-27.
27. Ernst A. T., H. Jiang, M. Krishnamoorthy, B. Owens, D. Sier. 2004b. An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. 127(1-4) 21-144.
28. Glover F. 1989. Tabu search-Part I. ORSA J. Comput. 1(3) 190-206.
29. Kawanaka H., K. Yamamoto, T. Yoshikawa, T. Shinigi, S. Tsuruoka. 2001. Genetic algorithm with the constraints for nurse scheduling problem. Proc. Congress on Evolutionary Comput. (CEC'01), Seoul, Korea, IEEE, Piscataway NJ, 1123-1130.
30. Kirkpatrick S., C. D. Gelatt, M. P. Vecchi. 1983. Optimization by simulated annealing. Science 220 (4598) 671-680.
31. Li J., U. Aickelin. 2004. The application of Bayesian optimization and classifier systems in nurse scheduling. X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo-Guervós, J. A. Bullinaria, J. Rowe, P. Tiňo, A. Kabán, H.-P. Schwefel, eds. Proc. 8th Internat. Conf. Parallel Problem Solving from Nature (PPSN VIII). Lecture Notes in Computer Science, Vol. 3242. Springer, Berlin, 581-590.
32. Lourenço H. R., O C. Martin, T. Stützle. 2003. Iterated local search. F. Glover, G. Kochenberger, eds. Handbook of Metaheuristics: International Series in Operations Research and Management Science, Vol. 57. Kluwer, Norwell, MA, 321-353.
33. Meyer auf'm Hofe H. 2001. Solving rostering tasks as constraint optimization. E. K. Burke, W. Erben, eds. Practice and Theory of Automated Timetabling, 3rd Internat. Conf. Lecture Notes in Computer Science, Vol. 2079. Springer, Berlin, 191-212.
34. Miller H. E., W. Pierskalla, G. Rath. 1976. Nurse scheduling using mathematical programming. Oper. Res. 24(5) 857-870.
35. Mueller C. W., J. C. McCloskey 1990. Nurses' job satisfaction: A proposed measure. Nursing Res. 39(2) 113-117.
36. Özcan E. 2005. Memetic algorithms for nurse rostering. Proc. 20th Internat. Sympos. Comput. Inform. Sci. Lecture Notes in Computer Science, Vol. 3733. Springer, Berlin, 482-492.
37. Ross P. 2005. Hyper-heuristics. E. K. Burke, G. Kendall, eds. Search Methodologies: Introductory Tutorials in Optimization and Decision Support Methodologies, Chapter 16. Springer, New York, 529-556.
38. Schrimpf G., J. Schneider, H. Stamm-Wilbrandt, G. Dueck. 2000. Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159(2) 139-171.
39. Silvestro R., C. Silvestro. 2000. An evaluation of nurse rostering practices in the National Health Service. J. Adv. Nursing 32(3) 525-535.
40. Sitompul D., S. Randhawa. 1990. Nurse scheduling models: A state-of-the-art review. J. Soc. Health Systems 2(1) 62-72.
41. Tien J. M., A. Kamiyama. 1982. On manpower scheduling algorithms. Soc. Indust. Appl. Math. 24(3) 275-287.
42. Warner M., J. Prawda. 1972. A mathematical programming model for scheduling nursing personnel in a hospital. Management Sci. 19(4, Part 1) 411-422.