Master physician scheduling problem
- 62 Downloads
We study a real-world problem arising from the operations of a hospital service provider, which we term the master physician scheduling problem. It is a planning problem of assigning physicians’ full range of day-to-day duties (including surgery, clinics, scopes, calls, administration) to the defined time slots/shifts over a time horizon, incorporating a large number of constraints and complex physician preferences. The goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We propose mathematical programming models that represent different variants of this problem. The models were tested on a real case from the Surgery Department of a local government hospital, as well as on randomly generated problem instances. The computational results are reported together with analysis on the optimal solutions obtained. For large-scale instances that could not be solved by the exact method, we propose a heuristic algorithm to generate good solutions.
Keywordsscheduling optimization health service master physician scheduling and rostering problem mathematical programming preferences
We thank the Department of Surgery, Tan Tock Seng Hospital (Singapore) for providing valuable comments and test situations.
- Burke EK, Li J and Qu R (2009). A Pareto-based search methodology for multi-objective nurse scheduling. Annals of Operations Research, http://www.springerlink.com/content/gr4j121131272772/.
- Buzon I and Lapierre SD (1999). A tabu search algorithm to schedule emergency room physicians. Technical report, Centre de Recherche sur les Transports, Montréal, Canada.Google Scholar
- Deb K (2003). Multi-objective Optimization Using Evolutionary Algorithms. Wiley & Sons: Chichester, New York.Google Scholar
- Gendreau M, Ferland J, Gendron B, Hail N, Jaumard B, Lapierre S, Pesant G and Soriano P (2007). Physician scheduling in emergency rooms. In: PATAT'06 Lecture Notes in Computer Science. Vol. 3867, pp 53–66.Google Scholar
- Gunawan A and Lau HC (2009). Master physician scheduling problem. In: Blazewicz J, Drozdowski M, Kendall G and McCollum B (eds). Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10–12 August 2009, Dublin, Ireland, pp 145–156.Google Scholar
- Gunawan A and Lau HC (2010). The bi-objective master physician scheduling problem. In: McCollum B, Burke EK and White G (eds). Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling – PATAT 2010, Belfast, Northern Ireland, 10–13 August, pp 241–258.Google Scholar
- Petrovic S and Vanden Berghe G (2008). Comparison of algorithms for nurse rostering problems. In: Burke EK and Gendreau M (eds). Proceedings of the 7th International Conference on the Practice and Theory of Automated Timetabling – PATAT 2008, Montreal, Canada, 18–22 August, pp 1–18.Google Scholar
- White CA, Nano E, Nguyen-Ngoc DH and White GM (2006). An evaluation of certain heuristic optimization algorithms in scheduling medical doctors and medical students. In: Burke EK and Rudová H (eds). Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling – PATAT 2006, Brno, the Czech Republic, 30 August–1 September, pp 320–328.Google Scholar