Journal of Scheduling

, Volume 17, Issue 3, pp 211–223 | Cite as

Complexity results for the basic residency scheduling problem

  • Jiayi Guo
  • David R. Morrison
  • Sheldon H. JacobsonEmail author
  • Janet A. Jokela


Upon graduation from medical school, medical students join residency programs to complete their clinical training and fulfill specialty board certification requirements. During residency, they are assigned several years of clinical rotations, where they work under the supervision of physician faculty in a variety of different settings, to ensure that they gain the requisite training prior to beginning independent practice. These rotations typically last a short period of time, and the problem of determining a schedule for all the residents in a program can be quite tedious. In this paper, a basic residency scheduling problem that produces a 1-year schedule is defined, and a proof of NP-completeness is presented. Furthermore, a specific model of the residency scheduling program for the internal medicine residency program at the University of Illinois College of Medicine at Urbana-Champaign is studied. Finally, a method for determining alternate optima is presented.


Medical School Residency program Alternate optima  Schedule perturbation 



The authors would like to thank Chaitanya Are, a chief resident at UIUC-COM, and Tracey Johnson, program coordinator, for their valuable input regarding the residency program at the University of Illinois. The authors would additionally like to thank three anonymous referees whose suggestions resulted in a significantly improved version of this paper. The computational results reported were obtained at the Simulation and Optimization Laboratory at the University of Illinois, Urbana-Champaign. This research has been supported in part by the Air Force Office of Scientific Research (FA9550-10-1-0387), the Department of Defense (DoD) through the National Defense Science & Engineering Graduate Fellowship (NDSEG) Program, and the National Science Foundation through the Graduate Research Fellowship Program. Additionally, the third author was supported in part by (while serving at) the National Science Foundation. Any opinion, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the United States Government.


  1. Accreditation Council for Graduate Medical Education (ACGME). (2009). ACGME program requirements for graduate medical education in internal medicine. ACGME. Accessed Dec 2013.
  2. Beliën, J., & Demeulemeester, E. (2004). Heuristic branch-and-price for building long term trainee schedules. DTEW Research Report 0422, pp 1–22. Accessed Dec 2013.
  3. Beliën, J., & Demeulemeester, E. (2006). Scheduling trainees at a hospital department using a branch-and-price approach. European Journal of Operational Research, 175(1), 258–278.Google Scholar
  4. Bellanti, F., Carello, G., & Tadei, R. (2004). A greedy-based neighborhood search approach to a nurse rostering problem. European Journal of Operational Research, 153(1), 28–40.CrossRefGoogle Scholar
  5. Brunner, J. O., & Edenharter, G. M. (2011). Long term staff scheduling of physicians with different experience levels in hospitals using column generation. Health Care Management Science, 14(2), 189–202.CrossRefGoogle Scholar
  6. Cohn, A., Root, S., Kymissis, C., Esses, J., & Westmoreland, N. (2009). Scheduling medical residents at boston university school of medicine. Interfaces, 39(3), 186–195.CrossRefGoogle Scholar
  7. Day, T., Napoli, J., & Kuo, P. (2006). Scheduling the resident 80-hour work week: An operations research algorithm. Current Surgery, 63(2), 136–141.CrossRefGoogle Scholar
  8. Franz, L., & Miller, J. (1993). Scheduling medical residents to rotations: Solving the large-scale multiperiod staff assignment problem. Operations Research, 41(2), 269–279.CrossRefGoogle Scholar
  9. Garey, M., & Johnson, D. (1979). Computers and intractability a guide to the theory of NP-completeness. New York: W. H. Freeman and Company.Google Scholar
  10. Gibert, K., & Hofstra, R. (1988). Multidimensional assignment problems. Decision Sciences, 19(2), 306–321.CrossRefGoogle Scholar
  11. Gutjahr, W., & Rauner, M. (2007). An ACO algorithm for a dynamic regional nurse-scheduling problem in austria. Computers & Operations Research, 34(3), 642–666.CrossRefGoogle Scholar
  12. Maenhout, B., & Vanhoucke, M. (2009). Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem. Journal of Scheduling, 13(1), 77–93.CrossRefGoogle Scholar
  13. Miller, J. L., & Franz, L. S. (1996). A binary-rounding heuristic for multi-period variable-task-duration assignment problems. Computers and Operations Research, 23(8), 819–828.CrossRefGoogle Scholar
  14. Osogami, T., & Imai, H. (2000). Classificaion of various neighborhood operations for the nurse scheduling problem. IBM TRL Research, Report, RT0373, Aug.Google Scholar
  15. Ozkarahan, I. (1994). A scheduling model for hospital residents. Journal of Medical Systems, 18(5), 251–265.CrossRefGoogle Scholar
  16. Papadimitriou, S., & Steiglitz, K. (1998). Combinatorial optimization: Algorithms and complexity. Mineola, NY: Dover.Google Scholar
  17. Topaloglu, S. (2006). A multi-objective programming model for scheduling emergency medicine residents. Computers and Industrial Engineering, 51(3), 375–388.CrossRefGoogle Scholar
  18. Topaloglu, S. (2009). A shift scheduling model for employees with different seniority levels and an application in healthcare. European Journal of Operational Research, 198(3), 943–957.CrossRefGoogle Scholar
  19. Topaloglu, S., & Ozkarahan, I. (2011). A constraint programming-based solution approach for medical resident scheduling problems. Computers and Operations Research, 38(1), 246–255.CrossRefGoogle Scholar
  20. Turner, J., Kim, K., Mehrotra, S., DaRosa, D., Daskin, M., & Rodriguez, H. (2013). Using optimization models to demonstrate the need for structural changes in training programs for surgical medical residents. Health Care Management Science, 16(3), 217–227. Google Scholar
  21. Wang, C.-W., Sun, L.-M., Jin, M., Fu, C., Liu, L., Chan, C.-H., & Kao, C. (2007). A genetic algorithm for resident physician scheduling problem. In 8th Annual Conference on Genetic and Evolutionary Computation.Google Scholar
  22. West, D. (2001). Introduction to graph theory. Upper Saddle River, NJ: Prentice-Hall.Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Jiayi Guo
    • 1
  • David R. Morrison
    • 2
  • Sheldon H. Jacobson
    • 2
    Email author
  • Janet A. Jokela
    • 3
  1. 1.School of Operations Research and Information EngineeringCornell UniversityIthacaUSA
  2. 2.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbanaUSA
  3. 3.College of MedicineUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations