How stochasticity and emergencies disrupt the surgical schedule

In health care system, the operating theatre is recognized as having an important role, notably in terms of generated income and cost. Its management, and in particular its scheduling, is thus a critical activity, and has been the sub ject of many studies. However, the stochasticity of the operating theatre environment is rarely considered while it has considerable effect on the actual working of a surgical unit. In practice, the planners keep a safety margin, let’s say 15% of the capacity, in order to absorb the effect of unpredictable events. However, this safety margin is most often chosen sub jectively, from experience. In this paper, our goal is to rationalize this process. We want to give insights to managers in order to deal with the stochasticity of their environment, at a tactical–strategic decision level. For this, we propose an analytical approach that takes account of the stochastic operating times as well as the disruptions caused by emergency arrivals. From our model, various performance measures can be computed: the emergency disruption rate, the waiting time for an emergency, the distribution of the working time, the probability of overtime, the average overtime, etc. In particular, our tool is able to tell how many operations can be scheduled per day in order to keep the overtime limited.health care, surgical schedule, emergencies, Markov chain.

Integer programming for building robust surgery schedules.

This paper proposes and evaluates a number of models for building robust cyclic surgery schedules. The developed models involve two types of constraints. Demand constraints ensure that each surgeon (or surgical group) obtains a specific number of operating room (OR) blocks. Capacity con- straints limit the available OR blocks on each day. Furthermore, the number of operated patients per block and the length of stay (LOS) of each operated patient are dependent on the type of surgery. Both are considered stochas- tic, following a multinomial distribution. We develop a number of MIP-based heuristics and a metaheuristic to minimize the expected total bed shortage and present computational results.Constraint; Demand; Distribution; Expected; Heuristic; Integer programming; Model; Models; Resource leveling; Surgery scheduling;

Prioritizing Patients: Stochastic Dynamic Programming for Surgery Scheduling and Mass Casualty Incident Triage

The research presented in this dissertation contributes to the growing literature on applications of operations research models to problems in healthcare through the development and analysis of mathematical models for two fundamental problems facing nearly all hospitals: the single-day surgery scheduling problem and planning for triage in the event of a mass casualty incident. Both of these problems can be understood as sequential decision-making processes aimed at prioritizing between different classes of patients under significant uncertainty and are modeled using stochastic dynamic programming. Our study of the single-day surgery scheduling problem represents the first model to capture the sequential nature of the operating room (OR) manager's decisions during the transition between the generality of cyclical block schedules (which allocate OR time to surgical specialties) and the specificity of schedules for a particular day (which assign individual patients to specific ORs). A case study of the scheduling system at the University of Maryland Medical Center highlights the importance of the decision to release unused blocks of OR time and use them to schedule cases from the surgical request queue (RQ). Our results indicate that high quality block release and RQ decisions can be made using threshold-based policies that preserve a specific amount of OR time for late-arriving demand from the specialties on the block schedule. The development of mass casualty incident (MCI) response plans has become a priority for hospitals, and especially emergency departments and trauma centers, in recent years. Central to all MCI response plans is the triage process, which sorts casualties into different categories in order to facilitate the identification and prioritization of those who should receive immediate treatment. Our research relates MCI triage to the problem of scheduling impatient jobs in a clearing system and extends earlier research by incorporating the important trauma principle that patients' long-term (post-treatment) survival probabilities deteriorate the longer they wait for treatment. Our results indicate that the consideration of deteriorating survival probabilities during MCI triage decisions, in addition to previously studied patient characteristics and overall patient volume, increases the total number of expected survivors

Flexible nurse staffing based on hourly bed census predictions

Workload on nursing wards depends highly on patient arrivals and patient lengths of stay, which are both inherently variable. Predicting this workload and staffing nurses accordingly is essential for guaranteeing quality of care in a cost effective manner. This paper introduces a stochastic method that uses hourly census predictions to derive efficient nurse staffing policies. The generic analytic approach minimizes staffing levels while satisfying so-called nurse-to-patient ratios. In particular, we explore the potential of flexible staffing policies which allow hospitals to dynamically respond to their fluctuating patient population by employing float nurses. The method is applied to a case study of the surgical inpatient clinic of the Academic Medical Center (AMC) Amsterdam. This case study demonstrates the method's potential to study the complex interaction between staffing requirements and several interrelated planning issues such as case mix, care unit partitioning and size, and surgical block planning. Inspired by the numerical results, the AMC decided that this flexible nurse staffing methodology will be incorporated in the redesign of the inpatient care operations during the upcoming years

Optimizing a multiple objective surgical case scheduling problem.

The scheduling of the operating theater on a daily base is a complicated task and is mainly based on the experience of the human planner. This, however, does not mean that this task can be seen as unimportant since the schedule of individual surgeries influences a medical department as a whole. Based on practical suggestions of the planner and on real-life constraints, we will formulate a multiple objective optimization model in order to facilitate this decision process. We will show that this optimization problem is NP-hard and hence hard to solve. Both exact and heuristic algorithms, based on integer programming and on implicit enumeration (branch-and-bound), will be introduced. These solution approaches will be thoroughly tested on a realistic test set using data of the surgical day-care center at the university hospital Gasthuisberg in Leuven (Belgium). Finally, results will be analyzed and conclusions will be formulated.Algorithms; Belgium; Branch-and-bound; Constraint; Data; Decision; Experience; Healthcare; Heuristic; Integer; Integer programming; Model; Optimization; Order; Processes; Real life; Scheduling; University;

Healthcare queueing models.

Healthcare systems differ intrinsically from manufacturing systems. As such, they require a distinct modeling approach. In this article, we show how to construct a queueing model of a general class of healthcare systems. We develop new expressions to assess the impact of service outages and use the resulting model to approximate patient flow times and to evaluate a number of practical applications. We illustrate the devastating impact of service interruptions on patient flow times and show the potential gains obtained by pooling hospital resources. In addition, we present an optimization model to determine the optimal number of patients to be treated during a service session.Operations research; Health care evaluation mechanisms; Organizational efficiency; Management decision support systems; Time management; Queueing theory;

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