A Pareto-based search methodology for multi-objective nurse scheduling

Annals of Operations Research

Volumn 196, Issue 1, 2012, Pages 91-109

  Burke, Edmund K ^a   Li, Jingpeng ^a   Qu, Rong ^a  

^a UNIVERSITY OF NOTTINGHAM   (United Kingdom)

Author keywords

Integer programming; Meta heuristic search; Multi objective optimization; Nurse scheduling

Indexed keywords

EID: 84863212172     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-009-0590-8     Document Type: Article

References (45)

1. Aickelin, U., Burke, E. K., & Li, J. (2009). Improved squeaky wheel optimisation for robust personnel scheduling. IEEE Transactions on Evolutionary Computation, 13, 433-443.
2. Aickelin, U., & Dowsland, K. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling, 3, 139-153.
3. Aickelin, U., & Dowsland, K. (2004). An indirect genetic algorithm for a nurse scheduling problem. Computers and Operations Research, 31, 761-778.
4. Aickelin, U., Burke, E. K., & Li, J. (2006). Improved squeaky wheel optimisation for driver scheduling. In Lecture notes in computer science, Vol. 4193: Parallel problem solving from nature (pp. 182-192). Berlin: Springer.
5. Arthur, J., & Ravindran, A. (1981). A Multiple objective nurse scheduling model. IIE Transactions, 13, 55-60.
6. Azaieza, M. N., & Al Sharif, S. S. (2005). A 0-1 goal programming model for nurse scheduling. Computers & Operations Research, 32, 491-507.
7. Bard, J., & Purnomo, H. W. (2005). Preference scheduling for nurses using column generation. European Journal of Operational Research, 164, 510-534.
8. Bard, J., & Purnomo, H. W. (2007). Cyclic preference scheduling of nurses using a Lagrangian-based heuristic. Journal of Scheduling, 10, 5-23.
9. Beaumont, N. (1997). Scheduling staff using mixed integer programming. European Journal of Operational Research, 98, 473-484.
10. Beddoe, G., & Petrovic, S. (2007). Enhancing case-based reasoning for personnel rostering with selected tabu search concepts. Journal of the Operational Research Society, 58, 1586-1598.
11. Berrada, I., Ferland, J. A., & Michelon, P. (1996). A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Economic Planning Science, 30, 183-193.
12. Brucker, P., Burke, E. K., Curtois, T., Qu, R., & Vanden Berge, G. (2009, to appear). A shift sequence based approach for nurse scheduling and a new benchmark dataset. Journal of Heuristics.
13. Brusco, M. J., & Jacobs, L. W. (1993). A simulated annealing approach to the cyclic staff-scheduling problem. Naval Research Logistics, 40, 69-84.
14. Burke, E. K., & Newall, J. P. (2004). Solving examination timetabling problems through adaptation of heuristic orderings. Annals of Operations Research, 129, 107-134.
15. Burke, E. K., De Causmaecker, P., & Vanden Berghe, G. (1999). A hybrid tabu search algorithm for the nurse rostering problem. In Lecture notes in artificial intelligence (Vol. 1585, pp. 187-194). Berlin: Springer.
16. Burke, E. K., Cowling, P., De Causmaecker, P., & Vanden Berghe, G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15, 199-214.
17. Burke, E. K., De Causmaecker, P., Petrovic, S., & Vanden Berghe, G. (2002). A multi criteria meta-heuristic approach to nurse rostering. In Proceedings of the 2002 congress on evolutionary computation (CEC2002) (pp. 1197-1202).
18. Burke, E. K., De Causmaecker, P., Vanden Berghe, G., & Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441-499.
19. Burke, E. K., Curtis, T., Post, G., Qu, R., & Veltman, B. (2008). A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research. 188, 330-341.
20. Burke, E. K., Curtois, T., Qu, R., & Vanden Berge, G. (2009a, to appear). A scatter search approach to the nurse rostering problem. Journal of the Operational Research Society.
21. Burke, E. K., Li, J., & Qu, R. (2009b, to appear). A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems. European Journal of Operational Research.
22. Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003). Nurse rostering problems-a bibliographic survey. European Journal of Operational Research, 151, 447-460.
23. Chen, J. G., & Yeung, T. (1993). Hybrid expert system approach to nurse scheduling. Computers in Nursing, 11, 183-192.
24. Deb, K. (2005). Multi-objective optimization. In E. K. Burke, G. Kendall (Eds.) Search methodologies: introductory tutorials in optimization and decision support methodologies (pp. 273-316). Berlin: Springer. Chap. 10.
25. Dowsland, K. A. (1998). Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106, 393-407.
26. Easton, F. F., & Mansour, N. (1999). A distributed genetic algorithm for deterministic and stochastic labor scheduling problems. European Journal of Operational Research, 118, 505-523.
27. Fores, S., Proll, L., & Wren, A. (2002). TRACS II: a hybrid IP/heuristic driver scheduling system for public transport. Journal of the OR Society, 53, 1093-1100.
28. Ikegami, A., & Niwa, A. (2003). A subproblem-centric model and approach to the nurse rostering problem. Mathematical Programming, 97, 517-541.
29. Isken, I., & Hancock, W. (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, 24-41.
30. Jaszkiewicz, A. (1997). A metaheuristic approach to multiple objective nurse scheduling. Foundations of Computing and Decision Sciences, 22, 169-184.
31. Jaumard, B., Semet, F., & Vovor, T. (1998). A generalised linear programming model for nurse scheduling. European Journal of Operational Research, 107, 1-18.
32. Joslin, D. E., & Clements, D. P. (1999). Squeak wheel optimisation. Journal of Artificial Intelligence, 10, 353-373.
33. Kawanaka, H., Yamamoto, K., Yoshikawa, T., Shinigi, T., & Tsuruoka, S. (2001). Genetic algorithm with the constraints for nurse scheduling problem. In Proceedings of congress on evolutionary computation (CEC) (pp. 1123-1130).
34. Kirkpatrick, S., Gelatt, C., & Vecchi, M. (1983). Optimization by simulated annealing. Science, 220, 671-680.
35. Li, J., & Aickelin, U. (2006). BOA for nurse scheduling. In M. Pelican, K. Sastry, E. Cantú-Paz (Eds.) Scalable optimization via probabilistic modeling: from algorithms to applications (pp. 315-332). Berlin: Springer. Chap. 17.
36. Li, J., & Kwan, R. S. (2003). A fuzzy genetic algorithm for driver scheduling. European Journal of Operational Research, 147, 334-344.
37. Musa, A., & Saxena, U. (1984). Scheduling nurses using goal-programming techniques. IIE Transaction, 16, 216-221.
38. Ozkarahan, I. (1991). An integrated nurse scheduling model. Journal of the Society for Health Systems, 3, 79-101.
39. Ozkarahan, I., & Bailey, J. E. (1988). Goal programming model subsystem of a flexible nurse scheduling support system. IIE Transaction, 16, 306-316.
40. Post, G., & Veltman, B. (2004). Harmonious personnel scheduling. In Proceedings of the 5th international conference on practice and automated timetabling (PATAT) (pp. 557-559).
41. Randhawa, S. U., & Sitompul, D. (1993). A heuristic based computerised nurse scheduling system. Computers and Operations Research, 20, 837-844.
42. Sitompul, D., & Randhawa, S. (1990). Nurse scheduling models: a state-of-the-art review. Journal of the Society of Health Systems, 2, 62-72.
43. Suman, B. & Kumar, P. (2006). A survey of simulated annealing as a tool for single and multiobjective optimization. Journal of the Operational Research Society, 57, 1143-1160.
44. Thompson, G. M. (1996). A simulated annealing heuristic for shiftscheduling using non-continuously available employees. Computers and Operations Research, 23, 275-288.
45. Warner, M., & Prawda, J. (1972). A mathematical programming model for scheduling nursing personnel in a hospital. Management Science, 19, 411-422.