Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Hybrid Heuristic Using Hierarchical Decomposition and Optimization for the Nurse Rostering Problem

계층적 분할 방법과 최적화를 이용한 간호원 로스터링 해법연구

  • Jang, Yoon Hee (Department of Information and Industrial Engineering, Yonsei University) ;
  • Kim, Sun Hoon (Department of Information and Industrial Engineering, Yonsei University) ;
  • Lee, Young Hoon (Department of Information and Industrial Engineering, Yonsei University)
  • 장윤희 (연세대학교 정보산업공학과) ;
  • 김선훈 (연세대학교 정보산업공학과) ;
  • 이영훈 (연세대학교 정보산업공학과)
  • Received : 2013.12.03
  • Accepted : 2014.03.26
  • Published : 2014.04.15
Download PDF
⟨ Previous Next ⟩

Abstract

Numerous studies have been studied to provide an efficient solution for the Nurse Rostering Problem (NRP), most of which have suffered from its complexity arising from incorporating nurse's work shift and ability. The test-bed data for the NRP is released for the public Competition in 2010. This study suggests a new mixed integer programming for Nurse Rostering Problem and develops a hybrid approach, where a hierarchical decomposition and the corresponding optimization are combined. The computation experiment is performed to show that the suggested algorithms may give a better solution in various instances, compared to the one appeared in the literature.

Keywords

References

  1. Bilgin, B., Demeester, P., Misir, M., Vancroonenburg, W., Berghe, G. V., and Wauters, T. (2010), A hyper-heuristic combined with a greedy shuffle approach to the nurse rostering competition, the 8th International Conference on the Practice and Theory of Automated Timetabling.
  2. Burke, E. K., De Causmaecker, P., and Berghe, G. V. (1999), A hybrid tabu search algorithm for the nurse rostering problem, Simulated Evolution and Learning, Lecture Notes in Artificial Intelligence, 1585, 187-194.
  3. Burke, E. K., Cowling, P., De Causmaecker, P., and Berghe, G. V. (2001a), A memetic approach to the nurse rostering problem, Applied Intelligence, 15(3), 199-214. https://doi.org/10.1023/A:1011291030731
  4. Burke, E. and Curtois, T. (2010), An ejection chain method and a branch and price algorithm applied to the instances of the first international nurse rostering competition, 2010, Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling PATAT, 10, 13
  5. Burke, E. K., Curtois, T., Qu, R., and Berghe, G. V. (2010a), A scatter search methodology for the nurse rostering problem, Journal of the Operational Research Society, 61, 1667-1679. https://doi.org/10.1057/jors.2009.118
  6. Burke, E., Li, J., and Qu, R. (2010b), A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems, European Journal of Operational Research, 203(2), 484-493. https://doi.org/10.1016/j.ejor.2009.07.036
  7. Causmaker, P. De, Vanden, G., and Erghe, B. (2011), A Categorization of Nurse Rostering Problem, Journal of Scheduling, 14, 3-16. https://doi.org/10.1007/s10951-010-0211-z
  8. Cheng, B. M. W., Lee, J. H. M., and Wu, J. C. K. (1997), A nurse rostering system using constraint programming and redundant modeling, IEEE Transactions of Information Technology in Biomedicine, 1(1), 44-54. https://doi.org/10.1109/4233.594027
  9. Dowsland, K. A. (1998), Nurse scheduling with tabu search and strategic oscillation, European Journal of Operational Research, 106(2/3), 393-407. https://doi.org/10.1016/S0377-2217(97)00281-6
  10. Dowsland, K. A. and Thompson, J. M. (2000), Solving a nurse scheduling problem with knapsacks, networks and tabu search, Journal of the Operational Research Society, 51, 825-833. https://doi.org/10.1057/palgrave.jors.2600970
  11. Glass, C. A. and Knight, R. A. (2010), The nurse rostering problem : A critical appraisal of the problem structure, European Journal of Operational Research, 202(2), 379-389. https://doi.org/10.1016/j.ejor.2009.05.046
  12. Koo, J., Lee, G., Lee, J., Li, H., and Kim, B. (2012), Internet-based Generic Simulation Model for Outpatient Clinics, Journal of the Korean Operations Research and Management Science Society, 37(4), 139-151. https://doi.org/10.7737/JKORMS.2012.37.4.139
  13. Millar, H. H. and Kiragu, M. (1998), Cyclic and non-cyclic scheduling of 12th shift nurses by network programming, European Journal of Operational Research, 104(3), 582-592. https://doi.org/10.1016/S0377-2217(97)00006-4
  14. Maenhout, B. and Vanhoucke, M. (2010), Branching strategies in a branch and price approach for a multiple objective nurse scheduling problem, Journal of Scheduling, 13(1), 77-93. https://doi.org/10.1007/s10951-009-0108-x
  15. Sim, S., Choi, J., Kim, B., Oh, J., Kim, S., Park, Y., Park, I., Chung, T., Oh, K., Jeong, B., and Lee, Y. H. (2012), Healthcare Process Pattern Analysis with Triage in the Emergency Department, Journal of the Korean Operations Research and Management Science Society, 37(4), 111-124. https://doi.org/10.7737/JKORMS.2012.37.4.111
  16. Thornton, J. and Sattar A. (1997), Nurse rostering and integer programming revisited, International Conference on Computational Intelligence and Multimedia Applications, 49-58.
  17. Valouxis, C. and Housos, E. (2000), Hybrid optimization techniques for the workshift and rest assignment of nursing personnel, Artificial Intelligence in Medicine, 20(2), 155-175. https://doi.org/10.1016/S0933-3657(00)00062-2
  18. Valouxis, C., Gogos, C., Goulas, G., Alefragis, P., and Housos, E. (2012), A systematic two phase approach for the nurse rostering problem, European Journal of Operational Research, 219(2), 425-433. https://doi.org/10.1016/j.ejor.2011.12.042
  19. Warner, D. M. and Prawda, J. (1972), A mathematical programming model for scheduling nursing personnel in a hospital, Management Science, 19(4), 411-422. https://doi.org/10.1287/mnsc.19.4.411