A STOCHASTIC DYNAMIC PROGRAM FOR THE SINGLE-DAY SURGERY SCHEDULING PROBLEM
BibTeX
@MISC{Herring_astochastic,
author = {William L. Herring},
title = {A STOCHASTIC DYNAMIC PROGRAM FOR THE SINGLE-DAY SURGERY SCHEDULING PROBLEM},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 room’s allocated surgical specialty. An algorithm for determining the optimal thresholds is presented, followed by computational results.
Keyphrases
stochastic dynamic program single-day surgery scheduling problem single day queue policy optimal threshold surgical specialty single room version dynamic evolution optimal request queue decision computational result operating room space individual surgical patient single room desired amount threshold policy theoretical result extensive treatment block release date block schedule operating room suite
