RTI uses cookies to offer you the best experience online. By clicking “accept” on this website, you opt in and you agree to the use of cookies. If you would like to know more about how RTI uses cookies and how to manage them please view our Privacy Policy here. You can “opt out” or change your mind by visiting: http://optout.aboutads.info/. Click “accept” to agree.
A stochastic dynamic program for the single-day surgery scheduling problem
Herring, W. (2010). A stochastic dynamic program for the single-day surgery scheduling problem. In Institute for Industrial Engineers, Society for Health Systems, Student Competition Winning Paper Presentations - Graduate Paper http://www.iienet2.org/SHS/Details.aspx?id=19652
The scheduling of individual surgical patients has received extensive treatment in the literature, but this paper is the first to propose a model that simultaneously captures the roles of block schedules, block release dates, and request queue policies in the dynamic evolution of the schedule for a single day in an operating room suite. The model is formulated as a stochastic dynamic program and theoretical results are obtained for a single room version. These results demonstrate that optimal request queue decisions for a single room follow a threshold policy that preserves a desired amount of operating room space for the remaining demand from the rooms allocated surgical specialty. An algorithm for determining the optimal thresholds is presented, followed by computational results.
