Operating room planning and scheduling: A literature review.

This paper provides a review of recent research on operating room planning and scheduling. We evaluate the literature on multiple fields that are related to either the problem setting (e.g. performance measures or patient classes) or the technical features (e.g. solution technique or uncertainty incorporation). Since papers are pooled and evaluated in various ways, a diversified and detailed overview is obtained that facilitates the identification of manuscripts related to the reader's specific interests. Throughout the literature review, we summarize the significant trends in research on operating room planning and scheduling and we identify areas that need to be addressed in the future.Health care; Operating room; Scheduling; Planning; Literature review;

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

International audienceThis 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

Platform Design For Fleet-Level Efficiency Under Uncertain Demand: Application For Military Cargo Aircraft And Fleet

The aircraft system\u27s role in the United Stated Air Force is crucial. For the U.S. Air Force to maintain its air superiority in the world, the constant maintenance, upgrade, and acquisition of the systems must follow. As the cost of fuel rises and with the recent budget situation, the emphasis is on both running the Air Force fleet more efficiently and acquiring the platform that can reduce the fleet level operating cost and the fuel usage and yet brings same capabilities. The approach presented in the thesis combines approaches from multidisciplinary design optimization and operations research to improve energy efficiency-related defense acquisition decisions. The work focuses upon problems that are relevant to the U.S. Air Force-Air Mobility Command (AMC), which is the largest consumer of fuel in the Department of Defense. To reflect AMC problems, the approach must consider the uncertainty in cargo demand; historical data shows that the cargo demand for AMC varies on a daily basis. The approach selects requirements for a new cargo aircraft; predicts size, weight and performance of that new aircraft; and allocates the new aircraft along with existing aircraft fleet to meet the cargo transportation demand. The approach successfully provides a description of a new cargo aircraft that, given the abstractions and assumptions used, will reduce the fleet-level operating cost and / or the fuel needed to meet air cargo demand. The allocation problem incorporates scheduling-like features to account for time driven operational constraints. The results of this study demonstrate the approach for a simple three-route network and 22-base network, using the Global Air Transportation Execution System (GATES) dataset. With addition of uncertainty in demand and random home base generation, the simulation result will suggest an aircraft design that is more flexible to the fluctuations in demand. The 22-base network represents one day of operation of the AMC randomly selected from the GATES data. The result from the 22-base network simulation under uncertain demand scenario for the strategic fleet suggests the introduction of five new aircraft that are capable of 24 pallets and 3,300 nautical miles of unrefueled design range which will save 1.10 percent in the expected direct operating cost and 4.20 percent in expected fuel usage compared to the baseline allocation result without introduction of the new aircraft

Robust Optimization Framework to Operating Room Planning and Scheduling in Stochastic Environment

Arrangement of surgical activities can be classified as a three-level process that directly impacts the overall performance of a healthcare system. The goal of this dissertation is to study hierarchical planning and scheduling problems of operating room (OR) departments that arise in a publicly funded hospital. Uncertainty in surgery durations and patient arrivals, the existence of multiple resources and competing performance measures are among the important aspect of OR problems in practice. While planning can be viewed as the compromise of supply and demand within the strategic and tactical stages, scheduling is referred to the development of a detailed timetable that determines operational daily assignment of individual cases. Therefore, it is worthwhile to put effort in optimization of OR planning and surgical scheduling. We have considered several extensions of previous models and described several real-world applications. Firstly, we have developed a novel transformation framework for the robust optimization (RO) method to be used as a generalized approach to overcome the drawback of conventional RO approach owing to its difficulty in obtaining information regarding numerous control variable terms as well as added extra variables and constraints into the model in transforming deterministic models into the robust form. We have determined an optimal case mix planning for a given set of specialties for a single operating room department using the proposed standard RO framework. In this case-mix planning problem, demands for elective and emergency surgery are considered to be random variables realized over a set of probabilistic scenarios. A deterministic and a two-stage stochastic recourse programming model is also developed for the uncertain surgery case mix planning to demonstrate the applicability of the proposed RO models. The objective is to minimize the expected total loss incurred due to postponed and unmet demand as well as the underutilization costs. We have shown that the optimum solution can be found in polynomial time. Secondly, the tactical and operational level decision of OR block scheduling and advance scheduling problems are considered simultaneously to overcome the drawback of current literature in addressing these problems in isolation. We have focused on a hybrid master surgery scheduling (MSS) and surgical case assignment (SCA) problem under the assumption that both surgery durations and emergency arrivals follow probability distributions defined over a discrete set of scenarios. We have developed an integrated robust MSS and SCA model using the proposed standard transformation framework and determined the allocation of surgical specialties to the ORs as well as the assignment of surgeries within each specialty to the corresponding ORs in a coordinated way to minimize the costs associated with patients waiting time and hospital resource utilization. To demonstrate the usefulness and applicability of the two proposed models, a simulation study is carried utilizing data provided by Windsor Regional Hospital (WRH). The simulation results demonstrate that the two proposed models can mitigate the existing variability in parameter uncertainty. This provides a more reliable decision tool for the OR managers while limiting the negative impact of waiting time to the patients as well as welfare loss to the hospital

Surgery scheduling heuristic considering OR downstream and upstream facilities and resources

Background: Surgical theater (ST) operations planning is a key subject in the healthcare management literature, particularly the scheduling of procedures in operating rooms (ORs). The OR scheduling problem is usually approached using mathematical modeling and made available to ST managers through dedicated software. Regardless of the large body of knowledge on the subject, OR scheduling models rarely consider the integration of OR downstream and upstream facilities and resources or validate their propositions in real life, rather using simulated scenarios. We propose a heuristic to sequence surgeries that considers both upstream and downstream resources required to perform them, such as surgical kits, post anesthesia care unit (PACU) beds, and surgical teams (surgeons, nurses and anesthetists). Methods: Using hybrid flow shop (HFS) techniques and the break-in-moment (BIM) concept, the goal is to find a sequence that maximizes the number of procedures assigned to the ORs while minimizing the variance of intervals between surgeries’ completions, smoothing the demand for downstream resources such as PACU beds and OR sanitizing teams. There are five steps to the proposed heuristic: listing of priorities, local scheduling, global scheduling, feasibility check and identification of best scheduling. Results: Our propositions were validated in a high complexity tertiary University hospital in two ways: first, applying the heuristic to historical data from five typical ST days and comparing the performance of our proposed sequences to the ones actually implemented; second, pilot testing the heuristic during ten days in the ORs, allowing a full rotation of surgical specialties. Results displayed an average increase of 37.2% in OR occupancy, allowing an average increase of 4.5 in the number of surgeries performed daily, and reducing the variance of intervals between surgeries’ completions by 55.5%. A more uniform distribution of patients’ arrivals at the PACU was also observed. Conclusions: Our proposed heuristic is particularly useful to plan the operation of STs in which resources are constrained, a situation that is common in hospital from developing countries. Our propositions were validated through a pilot implementation in a large hospital, contributing to the scarce literature on actual OR scheduling implementation

Scheduling the hospital-wide flow of elective patients

In this paper, we address the problem of planning the patient flow in hospitals subject to scarce medical resources with the objective of maximizing the contribution margin. We assume that we can classify a large enough percentage of elective patients according to their diagnosis-related group (DRG) and clinical pathway. The clinical pathway defines the procedures (such as different types of diagnostic activities and surgery) as well as the sequence in which they have to be applied to the patient. The decision is then on which day each procedure of each patient’s clinical pathway should be done, taking into account the sequence of procedures as well as scarce clinical resources, such that the contribution margin of all patients is maximized. We develop two mixed-integer programs (MIP) for this problem which are embedded in a static and a rolling horizon planning approach. Computational results on real-world data show that employing the MIPs leads to a significant improvement of the contribution margin compared to the contribution margin obtained by employing the planning approach currently practiced. Furthermore, we show that the time between admission and surgery is significantly reduced by applying our models

Improving surgeon utilization in an orthopedic department using simulation modeling

Purpose: Worldwide more than two billion people lack appropriate access to surgical services due to mismatch between existing human resource and patient demands. Improving utilization of existing workforce capacity can reduce the existing gap between surgical demand and available workforce capacity. In this paper, the authors use discrete event simulation to explore the care process at an orthopedic department. Our main focus is improving utilization of surgeons while minimizing patient wait time. Methods: The authors collaborated with orthopedic department personnel to map the current operations of orthopedic care process in order to identify factors that influence poor surgeons utilization and high patient waiting time. The authors used an observational approach to collect data. The developed model was validated by comparing the simulation output with the actual patient data that were collected from the studied orthopedic care process. The authors developed a proposal scenario to show how to improve surgeon utilization. Results: The simulation results showed that if ancillary services could be performed before the start of clinic examination services, the orthopedic care process could be highly improved. That is, improved surgeon utilization and reduced patient waiting time. Simulation results demonstrate that with improved surgeon utilizations, up to 55% increase of future demand can be accommodated without patients reaching current waiting time at this clinic, thus, improving patient access to health care services. Conclusion: This study shows how simulation modeling can be used to improve health care processes. This study was limited to a single care process; however the findings can be applied to improve other orthopedic care process with similar operational characteristics. Keywords: waiting time, patient, health care processpublishedVersio