Dynamic Surgery Assignment of Multiple Operating Rooms With Planned Surgeon Arrival Times

Abstract : This paper addresses the dynamic assignment of a given set of surgeries to multiple identical operating rooms (ORs). Surgeries have random durations and planned surgeon arrival times. Surgeries are assigned dynamically to ORs at surgery completion events. The goal is to minimize the total expected cost incurred by surgeon waiting, OR idling, and OR overtime. We first formulate the problem as a multi-stage stochastic programming model. An efficient algorithm is then proposed by combining a two-stage stochastic programming approximation and some look-ahead strategies. A perfect information-based lower bound of the optimal expected cost is given to evaluate the optimality gap of the dynamic assignment strategy. Numerical results show that the dynamic scheduling and optimization with the proposed approach significantly improve the performance of static scheduling and First Come First Serve (FCFS) strategy.
Document type :
Journal articles
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal-emse.ccsd.cnrs.fr/emse-01109328
Contributor : Amélie Chatagnon <>
Submitted on : Monday, January 4, 2016 - 4:31:29 PM
Last modification on : Thursday, January 11, 2018 - 6:16:31 AM
Long-term archiving on : Thursday, April 7, 2016 - 4:27:13 PM

File

2014 Dynamic Surgery - Zheng.p...
Files produced by the author(s)

Identifiers

Citation

Zheng Zhang, Xiaolan Xie, Na Geng. Dynamic Surgery Assignment of Multiple Operating Rooms With Planned Surgeon Arrival Times. IEEE Transactions on Automation Science and Engineering, Institute of Electrical and Electronics Engineers, 2014, 11 (3), pp.680-691. ⟨10.1109/TASE.2013.2267273⟩. ⟨emse-01109328⟩

Share

Metrics

Record views

348

Files downloads

406