Operating Room Staffing and Scheduling

被引:38
作者
Bandi, Chaithanya [1 ]
Gupta, Diwakar [2 ]
机构
[1] Northwestern Univ, Kellogg Sch Management, Evanston, IL 60208 USA
[2] Univ Texas Austin, McCombs Sch Business, Austin, TX 78712 USA
基金
美国国家科学基金会;
关键词
operating rooms; staffing and scheduling; robust optimization; SURGERY; ALGORITHMS; TIME;
D O I
10.1287/msom.2019.0781
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Problem definition: We consider two problems faced by an operating room (OR) manager: (1) how many baseline (core) staff to hire for OR suites, and (2) how to schedule surgery requests that arrive one by one. The OR manager has access to historical case count and case length data, and needs to balance the fixed cost of baseline staff and variable cost of overtime, while satisfying surgeons' preferences. Academic/practical relevance: ORs are costly to operate and generate about 70% of hospitals' revenues from surgical operations and subsequent hospitalizations. Because hospitals are increasingly under pressure to reduce costs, it is important to make staffing and scheduling decisions in an optimal manner. Also, hospitals need to leverage data when developing algorithmic solutions, and model tradeoffs between staffing costs and surgeons' preferences. We present a methodology for doing so, and test it on real data from a hospital. Methodology: We propose a new criterion called the robust competitive ratio for designing online algorithms. Using this criterion and a robust optimization approach to model the uncertainty in case mix and case lengths, we develop tractable optimization formulations to solve the staffing and scheduling problems. Results For the staffing problem, we show that algorithms belonging to the class of interval classification algorithms achieve the best robust competitive ratio, and develop a tractable approach for calculating the optimal parameters of our proposed algorithm. For the scheduling phase, which occurs one or two days before each surgery day, we demonstrate how a robust optimization framework may be used to find implementable schedules while taking into account surgeons' preferences such as back-to-back and same-OR scheduling of cases. We also perform numerical experiments with real and synthetic data, which show that our approach can significantly reduce total staffing cost. Managerial implications: We present algorithms that are easy to implement and tractable. These algorithms also allow the OR manager to specify the size of the uncertainty set and to control overtime costs while meeting surgeons' preferences.
引用
收藏
页码:958 / 974
页数:17
相关论文
共 31 条
[1]   powerlaw: A Python']Python Package for Analysis of Heavy-Tailed Distributions [J].
Alstott, Jeff ;
Bullmore, Edward T. ;
Plenz, Dietmar .
PLOS ONE, 2014, 9 (01)
[2]  
[Anonymous], 2017, INN MOD
[3]   Tractable stochastic analysis in high dimensions via robust optimization [J].
Bandi, Chaithanya ;
Bertsimas, Dimitris .
MATHEMATICAL PROGRAMMING, 2012, 134 (01) :23-70
[4]   Operating Room Pooling and Parallel Surgery Processing Under Uncertainty [J].
Batun, Sakine ;
Denton, Brian T. ;
Huschka, Todd R. ;
Schaefer, Andrew J. .
INFORMS JOURNAL ON COMPUTING, 2011, 23 (02) :220-237
[5]   Kaiser Permanente Oakland Medical Center Optimizes Operating Room Block Schedule for New Hospital [J].
Benchoff, Brittney ;
Yano, Candace Arai ;
Newman, Alexandra .
INTERFACES, 2017, 47 (03) :214-229
[6]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53
[7]  
Bertsimas D, 2005, OPTIMIZATION INTEGER
[8]  
Coffman E. G., 2013, Handbook of combinatorial optimization, P455, DOI DOI 10.1007/978-1-4419-7997-135
[9]   Nurse Staffing in Medical Units: A Queueing Perspective [J].
de Vericourt, Francis ;
Jennings, Otis B. .
OPERATIONS RESEARCH, 2011, 59 (06) :1320-1331
[10]  
Denton B, 2003, IIE TRANS, V35, P1003, DOI [10.1080/07408170304395, 10.1080/07408170390230169]