A Two-Stage Heuristic Approach for a Type of Rotation Assignment Problem
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.
KeywordsTrainee rotation assignment Personnel scheduling Heuristic
- 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
- 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.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