Advertisement

A Two-Stage Heuristic Approach for a Type of Rotation Assignment Problem

  • Ziran ZhengEmail author
  • Xiaoju Gong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10942)

Abstract

A two-stage heuristic algorithm is proposed for solving a trainee rotation assignment problem in a local school of nursing and its training hospital. At the first stage, the model is reduced to a simplified assignment problem and solved using a random search procedure. At the second stage, a problem-specific operator is designed and employed with a hill climber to further improve solutions. We benchmark our algorithm with instances generated based on the real-life rules. Results show that the proposed algorithm yields high-quality solutions in less computation time for large scale instances when compared with integer linear programming formulation using the commercial solver Cplex.

Keywords

Trainee rotation assignment Personnel scheduling Heuristic 

References

  1. 1.
    Beliën, J., Demeulemeester, E.: Scheduling trainees at a hospital department using a branch-and-price approach. Eur. J. Oper. Res. 175(1), 258–278 (2006)CrossRefGoogle Scholar
  2. 2.
    Beliën, J., Demeulemeester, E.: On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem. Annal. Oper. Res. 155(1), 143–166 (2007)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bergh, J.V.D., Beliën, J., Bruecker, P.D., Demeulemeester, E., Boeck, L.D.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367–385 (2013)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Bettinelli, A., Cacchiani, V., Roberti, R., Toth, P.: An overview of curriculum-based course timetabling. TOP 23(2), 313–349 (2015)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Burke, E.K., Mareček, J., Parkes, A.J., Rudová, H.: Penalising patterns in timetables: novel integer programming formulations. In: Kalcsics, J., Nickel, S. (eds.) Operations Research Proceedings 2007, vol. 2007. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-77903-2_63CrossRefGoogle Scholar
  6. 6.
    Burke, E.K., Marecek, J., Parkes, A.J., Rudová, H.: Decomposition, reformulation, and diving in university course timetabling. Comput. Oper. Res. 37(3), 582–597 (2010)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Guo, J., Morrison, D.R., Jacobson, S.H., Jokela, J.A.: Complexity results for the basic residency scheduling problem. J. Sched. 17(3), 211–223 (2014)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Smalley, H.K., Keskinocak, P.: Automated medical resident rotation and shift scheduling to ensure quality resident education and patient care. Health Care Manag. Sci. 19, 1–23 (2014)Google Scholar
  9. 9.
    Wang, C., Sun, L., Jin, M., Fu, C., Liu, L., Chan, C., Kao, C.: A genetic algorithm for resident physician scheduling problem. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2007, London, England, UK, 7–11 July 2007, pp. 2203–2210 (2007)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Management Science and EngineeringShandong Normal UniversityJinanChina
  2. 2.Shandong Provincial Hospital Affiliated to Shandong UniversityJinanChina

Personalised recommendations