Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 246543, 16 pages
http://dx.doi.org/10.1155/2014/246543
Research Article

Nurse Scheduling Using Genetic Algorithm

1Excellence Center in Logistics and Supply Chain Management, Chiang Mai University, Chiang Mai 50200, Thailand
2Department of Industrial Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai 50200, Thailand

Received 20 May 2014; Revised 20 October 2014; Accepted 23 October 2014; Published 27 November 2014

Academic Editor: Purushothaman Damodaran

Copyright © 2014 Komgrit Leksakul and Sukrit Phetsawat. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. Mongkolrangsarit and W. Thamapornpilat, Development of Nurse Scheduling Method with Uncertain Workforce Demand, Department of Industrial Engineering, Faculty of Engineering, Chulalongkorn University, 2007.
  2. C. M. Rothe and H. B. Wolfe, “Cyclical scheduling and allocation of nursing staff,” Socio-Economic Planning Sciences, vol. 7, no. 5, pp. 471–487, 1973. View at Publisher · View at Google Scholar · View at Scopus
  3. R. B. Norby, L. E. Freund, and B. Wagner, “A nurse staffing system based upon assignment difficulty,” Journal of Nursing Administration, vol. 7, no. 9, pp. 2–24, 1977. View at Publisher · View at Google Scholar · View at Scopus
  4. T. Ryan, B. L. Barker, and F. A. Marciante, “A system for determining appropriate nurse staffing,” Journal of Nursing Administration, vol. 5, no. 5, pp. 30–38, 1975. View at Publisher · View at Google Scholar · View at Scopus
  5. H. Wolfe and J. P. Young, “Staffing the nursing unit, Part I: controlled variable staffing,” Nursing Research, vol. 14, pp. 236–243, 1965. View at Google Scholar · View at Scopus
  6. H. Wolfe and J. P. Young, “Staffing the nursing unit. II. The multiple assignment technique,” Nursing Research, vol. 14, no. 4, pp. 299–303, 1965. View at Google Scholar · View at Scopus
  7. J. L. Arthur and A. Ravindran, “A multiple objective nurse scheduling model,” AIIE Transactions, vol. 13, no. 1, pp. 55–60, 1981. View at Google Scholar · View at Scopus
  8. I. Ozkarahan, “A disaggregation model of a flexible nurse scheduling support system,” Socio-Economic Planning Sciences, vol. 25, no. 1, pp. 9–26, 1991. View at Publisher · View at Google Scholar · View at Scopus
  9. I. Ozkarahan and J. E. Bailey, “Goal programming model subsystem of a flexible nurse scheduling support system,” IIE Transactions, vol. 20, no. 3, pp. 306–316, 1988. View at Google Scholar · View at Scopus
  10. K. A. Dowsland, “Nurse scheduling with tabu search and strategic oscillation,” European Journal of Operational Research, vol. 106, no. 2-3, pp. 393–407, 1998. View at Publisher · View at Google Scholar · View at Scopus
  11. P. Tormos, A. Lova, F. Barber, L. Ingolotti, M. Abril, and M. A. Salido, “A genetic algorithm for railway scheduling problems,” in Metaheuristics for Scheduling in Industrial and Manufacturing Applications, vol. 128 of Studies in Computational Intelligence, pp. 255–276, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  12. H. Kawanaka, K. Yamamoto, T. Yoshikawa, T. Shinogi, and S. Tsuruoka, “Genetic algorithm with the constraints for nurse scheduling problem,” in Proceedings of the Congress on Evolutionary Computation, vol. 2, pp. 1123–1130, Seoul, Republic of Korea, May 2001. View at Scopus
  13. H. H. Millar and K. Mona, “Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming,” European Journal of Operational Research, vol. 104, no. 3, pp. 582–592, 1998. View at Publisher · View at Google Scholar
  14. I. Blöchlige, “Modeling staff scheduling problems. A tutorial,” European Journal of Operational Research, vol. 158, no. 3, pp. 533–542, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. B. Jaumard, F. Semet, and T. Vovor, “A generalized linear programming model for nurse scheduling,” European Journal of Operational Research, vol. 107, no. 1, pp. 1–18, 1998. View at Publisher · View at Google Scholar · View at Scopus
  16. T. Çezik, O. Günlük, and H. Luss, “An integer programming model for the weekly tour scheduling problem,” Naval Research Logistics, vol. 48, no. 7, pp. 607–624, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. Z. Wang, J.-L. Liu, and X. Yu, “Self-fertilization based genetic algorithm for university timetabling problem,” in Proceedings of the 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation (GEC '09), pp. 1001–1004, ACM, Shanghai, China, June 2009. View at Publisher · View at Google Scholar
  18. J. Wang and K. Chu, “An application of genetic algorithms for the flexible job-shop scheduling problem,” International Journal of Advancements in Computing Technology, vol. 4, no. 3, pp. 271–278, 2012. View at Publisher · View at Google Scholar · View at Scopus
  19. M. Moz and M. V. Pato, “A genetic algorithm approach to a nurse rerostering problem,” Computers & Operations Research, vol. 34, no. 3, pp. 667–691, 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. C. Wotthipong, K. Soradech, and S. Nidapan, “The suitable genetic operators for solving the university course timetabling problem,” Journal of Convergence Information Technology, vol. 8, pp. 60–65, 2013. View at Google Scholar
  21. K. Naveen, Karambir, and K. Rajiv, “A comparative analysis of PMX, CX and OX crossover operators for solving travelling salesman problem,” International Journal of Latest Research in Science and Technology, vol. 1, no. 2, pp. 98–101, 2012. View at Google Scholar