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

Modelling a Nurse Shift Schedule with Multiple Preference Ranks for Shifts and Days-Off

1Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu 300, Taiwan
2Department of Tourism Information, Aletheia University, New Taipei City 251, Taiwan
3Department of Computer Science and Information Engineering, National Changhua University of Education, Changhua 500, Taiwan

Received 4 October 2013; Revised 22 February 2014; Accepted 22 February 2014; Published 27 March 2014

Academic Editor: Ching-Ter Chang

Copyright © 2014 Chun-Cheng Lin et al. 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. J. J. Bartholdi III, “A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering,” Operations Research, vol. 29, no. 3, pp. 501–510, 1981. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. M. Hadwan, M. Ayob, N. R. Sabar, and R. Qu, “A harmony search algorithm for nurse rostering problems,” Information Sciences, vol. 233, no. 6, pp. 126–140, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  3. G. Felici and C. Gentile, “A polyhedral approach for the staff rostering problem,” Management Science, vol. 50, no. 3, pp. 381–393, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. A. T. Ernst, H. Jiang, M. Krishnamoorthy, and D. Sier, “Staff scheduling and rostering: a review of applications, methods and models,” European Journal of Operational Research, vol. 153, no. 1, pp. 3–27, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  5. J. V. Bergh, J. Belien, P. D. Bruecker, E. Demeulemeester, and L. D. Boeck, “Personnel scheduling: a literature review,” European Journal of Operational Research, vol. 226, no. 3, pp. 367–385, 2013. View at Publisher · View at Google Scholar
  6. C. Valouxis and E. Housos, “Hybrid optimization techniques for the workshift and rest assignment of nursing personnel,” Artificial Intelligence in Medicine, vol. 20, no. 2, pp. 155–175, 2000. View at Publisher · View at Google Scholar · View at Scopus
  7. H. W. Purnomo and J. F. Bard, “Cyclic preference scheduling for nurses using branch and price,” Naval Research Logistics, vol. 54, no. 2, pp. 200–220, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. P. A. Clark, K. Leddy, M. Drain, and D. Kaldenberg, “State nursing shortages and patient satisfaction: more RN—better patient experiences,” Journal of Nursing Care Quality, vol. 22, no. 2, pp. 119–127, 2007. View at Publisher · View at Google Scholar · View at Scopus
  9. R. M'Hallah and A. Alkhabbaz, “Scheduling of nurses: a case study of a Kuwaiti health care unit,” Operations Research For Health Care, vol. 2, no. 1-2, pp. 1–19, 2013. View at Publisher · View at Google Scholar
  10. J. F. Bard and H. W. Purnomo, “Preference scheduling for nurses using column generation,” European Journal of Operational Research, vol. 164, no. 2, pp. 510–534, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. U. Aickelin and K. A. Dowsland, “An indirect genetic algorithm for a nurse-scheduling problem,” Computers and Operations Research, vol. 31, no. 5, pp. 761–778, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. B. Maenhout and M. Vanhoucke, “An integrated nurse staffing and scheduling analysis for loner-term nursing staff allocation problems,” Omega, vol. 41, no. 2, pp. 485–499, 2013. View at Publisher · View at Google Scholar
  13. S. Topaloglu and H. Selim, “Nurse scheduling using fuzzy modeling approach,” Fuzzy Sets and Systems, vol. 161, no. 11, pp. 1543–1563, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. M. N. Azaiez and S. S. Al Sharif, “A 0-1 goal programming model for nurse scheduling,” Computers and Operations Research, vol. 32, no. 3, pp. 491–507, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  15. S. Topaloglu, “A multi-objective programming model for scheduling emergency medicine residents,” Computers and Industrial Engineering, vol. 51, no. 3, pp. 375–388, 2006. View at Publisher · View at Google Scholar · View at Scopus
  16. S. Topaloglu, “A shift scheduling model for employees with different seniority levels and an application in healthcare,” European Journal of Operational Research, vol. 198, no. 3, pp. 943–957, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. J. Beliën and E. Demeulemeester, “A branch-and-price approach for integrating nurse and surgery scheduling,” European Journal of Operational Research, vol. 189, no. 3, pp. 652–668, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  18. C. A. Glass and R. A. Knight, “The nurse rostering problem: a critical appraisal of the problem structure,” European Journal of Operational Research, vol. 202, no. 2, pp. 379–389, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. C. Valouxis, C. Gogos, G. Goulas, P. Alefragis, and E. Housos, “A systematic two phase approach for the nurse rostering problem,” European Journal of Operational Research, vol. 219, no. 2, pp. 425–433, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  20. C. C. Tsai and S. H. A. Li, “A two-stage modeling with genetic algorithms for the nurse scheduling problem,” Expert Systems with Applications, vol. 36, no. 5, pp. 9506–9512, 2009. View at Publisher · View at Google Scholar · View at Scopus
  21. S. J. Sadjadi, R. Soltani, M. Izadkhah, F. Saberian, and M. Darayi, “A new nonlinear stochastic staff scheduling model,” Scientia Iranica, vol. 18, no. 3, pp. 699–710, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. W. J. Gutjahr and M. S. Rauner, “An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria,” Computers and Operations Research, vol. 34, no. 3, pp. 642–666, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  23. Z. Lü and J. K. Hao, “Adaptive neighborhood search for nurse rostering,” European Journal of Operational Research, vol. 218, no. 3, pp. 865–876, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. M. V. Chiaramonte and L. M. Chiaramonte, “An agent-based nurse rostering system under minimal staffing conditions,” International Journal of Production Economics, vol. 114, no. 2, pp. 697–713, 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. M. Vanhoucke and B. Maenhout, “On the characterization and generation of nurse scheduling problem instances,” European Journal of Operational Research, vol. 196, no. 2, pp. 457–467, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus