Annual scheduling for anesthesiology medicine residents in task-related programs with a focus on continuity of care
This article presents a new model for constructing annual schedules for medical residents based on the regulations of a German teaching hospital as well as the program restrictions of the German Medical Association. Since resident programs of physicians do not only vary between disciplines but also between countries, it is essential to evaluate the main characteristics of the program. The main difference between the already well-studied resident programs in the US and the one of this article is the task-related structure. Residents need to perform different interventions several times to become specialists. This study will focus on Germany since there was a judgement in 2015 that hospital management needs training schedules guaranteeing the success of the resident program in time. Therefore, a new formulation of a tactical resident scheduling problem is presented. The problem is formulated in two stages considering the total number of interventions, equal progress in training as well as continuity of care. As the second stage of our formulation is a quadratic program and even by linearization standard solvers are not able to generate high-quality solutions within 24 h, a genetic algorithm using standard crossovers is developed for the second stage constructing annual schedules for an existing stock of residents. We evaluate our algorithm by comparing the solutions of the genetic algorithm and standard software with a real-world situation of a German training hospital from 2016.
KeywordsOR in health services Resident scheduling Task-related Real-world data Genetic algorithm
Special thanks to Prof. Blobner from the Clinic of Anaesthesiology, Technical University of Munich for providing the real-world data and for participating as a clinical expert in discussions and interviews. This research project is funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) and Grant no. 405488489.
- Accreditation Council for Graduate Medical Education (2017) Common program requirements. http://www.acgme.org/. Accessed 13 Nov 2017
- Burke EK, de Causmaecker P, Berghe GV, van Landeghem H (2004) The state of the art of nurse rostering. J Sched 7(6):441–499. https://doi.org/10.1023/B:JOSH.0000046076.75950.0b MathSciNetzbMATHGoogle Scholar
- Davis L (1991) Handbook of genetic algorithms. Van Nostrand Reinhold, New YorkGoogle Scholar
- Franz LS, Miller JL (1993) Scheduling medical residents to rotations: solving the large-scale multiperiod staff assignment problem. Oper Res 41(2):269–279Google Scholar
- German College of General Practitioners and Family Physicians (2009) Speciality training for general practice in Germany. A report by a panel of invited international experts. http://www.degam.de/. Accessed 1 Dec 2015
- German Medical Association (2003) Speciality training regulations. http://www.bundesaerztekammer.de/. Accessed 19 Sept 2016
- Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins GJE (ed) Foundations of genetic algorithms 1991 (FOGA 1), vol 1. Elsevier Science, Burlington, pp 69–93Google Scholar
- Katzenbach JR, Smith DK (1993) The wisdom of teams: creating the high-performance organization. Harvard Business School Press, BostonGoogle Scholar
- LAG Baden-Württemberg (2015) Judge in 11.09.2015 (1 Sa 5/15), openJur 2015, 19265Google Scholar
- Miani C, Hinrichs S, Pitchforth E, Bienkowska-Gibbs T, Disbeschl S, Roland M, Nolte E (2015) Best practice: Medizinische Aus- und Weiterbildung aus internationaler Perspektive. RAND Corporation. http://www.rand.org/content/dam/rand/pubs/research_reports/RR600/RR622z1/RAND_RR622z1.pdf. Accessed 8 Feb 2016
- Wang CW, Sun LM, Jin MH, Fu CJ, Liu L, Chan CH, Kao CY (2007) A genetic algorithm for resident physician scheduling problem. In: Lipson H (ed) Proceedings of the 9th annual conference on genetic and evolutionary computation, ACM, New York, p 2203. https://doi.org/10.1145/1276958.1277380