Journal
IIE TRANSACTIONS
Volume 47, Issue 9, Pages 998-1012Publisher
TAYLOR & FRANCIS INC
DOI: 10.1080/0740817X.2014.999900
Keywords
Appointment scheduling; simulation-based optimization; multiple operating rooms
Funding
- Natural Science Foundation of China [71131005, 61104173]
- Specialized Research Fund for the Doctoral Program of Higher Education [20120073110040, 20110073120048]
- Agence Nationale de Recherche [ANR-11-TECS-010-04]
- China Scholarship Council (CSC)
Ask authors/readers for more resources
This study is devoted to the appointment scheduling (AS) for a sequence of surgeries with random durations served by multiple operating rooms (Multi-OR). Surgeries are assigned to ORs dynamically on a first-come, first-serve (FCFS) basis. It materially differs from past literature in the sense that dynamic assignments are proactively anticipated in the determination of appointment times. A discrete-event framework is proposed to model the execution of the surgery schedule and to evaluate the sample path gradient of a total cost incurred by surgeon waiting, OR idling, and OR overtime. The sample path cost function is shown to be unimodal, Lipchitz-continuous, and differentiable w.p.1 and the expected cost function continuously differentiable. A stochastic approximation algorithm based on unbiased gradient estimators is proposed and extensive numerical experiments suggest that it converges to a global optimum. A series of numerical experiments is performed to show the significant benefits of the Multi-OR setting and properties of the optimal solution with respect to various system parameters such as cost structure and numbers of surgeries and ORs.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available