Dynamic Surgery Assignment of Multiple Operating Rooms With Planned Surgeon Arrival Times - Mines Saint-Étienne Access content directly
Journal Articles IEEE Transactions on Automation Science and Engineering Year : 2014

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.
Fichier principal
Vignette du fichier
2014 Dynamic Surgery - Zheng.pdf (327.09 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

emse-01109328 , version 1 (04-01-2016)

Identifiers

Cite

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, 2014, 11 (3), pp.680-691. ⟨10.1109/TASE.2013.2267273⟩. ⟨emse-01109328⟩
253 View
378 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More