A prediction-optimization approach to surgery prioritization in operating room scheduling

Author(s):  
Abdulaziz Ahmed ◽  
Lu He ◽  
Chun-an Chou ◽  
Mohammad Firouz ◽  
Mohammad M. Hamasha
Author(s):  
Vahid Kayvanfar ◽  
Mohammad R. Akbari Jokar ◽  
Majid Rafiee ◽  
Shaya Sheikh ◽  
Reza Iranzad

2015 ◽  
pp. 847-867
Author(s):  
Irem Ozkarahan ◽  
Emrah B. Edis ◽  
Pinar Mizrak Ozfirat

Surgical units are generally the most costly and least utilized units of hospitals. In order to provide higher utilization rates of surgical units, scheduling of operating rooms should be done effectively. Inefficient or inaccurate scheduling of operating room time often results in delays of surgery or cancellations of procedures, which are costly to the patient and the hospital. Therefore, operating room scheduling and management problems have been an important area of research both for operations researchers and artificial intelligence researchers since the 1960s. In this chapter, the operations research and artificial intelligence solutions developed for operating room scheduling problems in the operational level are examined and discussed. The studies are classified according to the approaches employed. The chapter is aimed to be helpful for researchers who are willing to make contributions in this area as well as the practitioners who are looking for efficient and effective ways to handle the operating room management problem of their own.


2020 ◽  
Vol 22 (5) ◽  
pp. 958-974 ◽  
Author(s):  
Chaithanya Bandi ◽  
Diwakar Gupta

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.


Sign in / Sign up

Export Citation Format

Share Document