Scheduling Medical Residents at Boston University School of Medicine

The chief residents in the psychiatry program at Boston University School of Medicine (BUSM) must construct a schedule that simultaneously assigns residents to five types of call shifts, spanning three different hospitals, over a 365-day planning horizon. We show how user expertise and heuristic approaches alone fail to find acceptable solutions to this complex combinatorial problem; likewise, mathematical programming techniques alone are inadequate, largely because they lack a clearly definable objective function. However, by combining both approaches, we were able to find high-quality solutions in a very short time. The resulting schedule, which BUSM uses currently, has yielded substantial benefits; the solution quality has improved, and the effort required to develop the solution has been reduced.