Managing Operational Efficiency And Health Outcomes At Outpatient Clinics Through Effective Scheduling

A variety of studies have documented the substantial deficiencies in the quality of health care delivered across the United States. Attempts to reform the United States health care system in the 1980s and 1990s were inspired by the system\u27s inability to adequately provide access, ensure quality, and restrain costs, but these efforts had limited success. In the era of managed care, access, quality, and costs are still challenges, and medical professionals are increasingly dissatisfied. In recent years, appointment scheduling in outpatient clinics has attracted much attention in health care delivery systems. Increase in demand for health care services as well as health care costs are the most important reasons and motivations for health care decision makers to improve health care systems. The goals of health care systems include patient satisfaction as well as system utilization. Historically, less attention was given to patient satisfaction compared to system utilization and conveniences of care providers. Recently, health care systems have started setting goals regarding patient satisfaction and improving the performance of the health system by providing timely and appropriate health care delivery. In this study we discuss methods for improving patient flow through outpatient clinics considering effective appointment scheduling policies by applying two-stage Stochastic Mixed-Integer Linear Program Model (two-stage SMILP) approaches. Goal is to improve the following patient flow metrics: direct wait time (clinic wait time) and indirect wait time considering patient’s no-show behavior, stochastic server, follow-up surgery appointments, and overbooking. The research seeks to develop two models: 1) a method to optimize the (weekly) scheduling pattern for individual providers that would be updated at regular intervals (e.g., quarterly or annually) based on the type and mix of services rendered and 2) a method for dynamically scheduling patients using the weekly scheduling pattern. Scheduling templates will entertain the possibility of arranging multiple appointments at once. The aim is to increase throughput per session while providing timely care, continuity of care, and overall patient satisfaction as well as equity of resource utilization. First, we use risk-neutral two-stage stochastic programming model where the objective function considers the expected value as a performance criterion in the selection of random variables like total waiting times and next, we expand the model formulation to mean-risk two-stage stochastic programming in which we investigate the effect of considering a risk measure in the model. We apply Conditional-Value-at-Risk (CVaR) as a risk measure for the two-stage stochastic programming model. Results from testing our models using data inspired by real-world OBGYN clinics suggest that the proposed formulations can improve patient satisfaction through reduced direct and indirect waiting times without compromising provider utilization

Operating theatre modelling: integrating social measures

Hospital resource modelling literature is primarily focussed on productivity and efficiency measures. In this paper, our focus is on the alignment of the most valuable revenue factor, the operating room (OR) with the most valuable cost factor, the staff. When aligning these economic and social decisions, respectively, into one sustainable model, simulation results justify the integration of these factors. This research shows that integrating staff decisions and OR decisions results in better solutions for both entities. A discrete event simulation approach is used as a performance test to evaluate an integrated and an iterative model. Experimental analysis show how our integrated approach can benefit the alignment of the planning of the human resources as well as the planning of the capacity of the OR based on both economic related metrics (lead time, overtime, number of patients rejected) and social related metrics (personnel preferences, aversions, roster quality)

Scheduling rules to achieve lead-time targets in outpatient appointment systems

This paper considers how to schedule appointments for outpatients, for a clinic that is subject to appointment lead-time targets for both new and returning patients. We develop heuristic rules, which are the exact and relaxed appointment scheduling rules, to schedule each new patient appointment (only) in light of uncertainty about future arrivals. The scheduling rules entail two decisions. First, the rules need to determine whether or not a patient's request can be accepted; then, if the request is not rejected, the rules prescribe how to assign the patient to an available slot. The intent of the scheduling rules is to maximize the utilization of the planned resource (i.e., the physician staff), or equivalently to maximize the number of patients that are admitted, while maintaining the service targets on the median, the 95th percentile, and the maximum appointment lead-times. We test the proposed scheduling rules with numerical experiments using real data from the chosen clinic of Tan Tock Seng hospital in Singapore. The results show the efficiency and the efficacy of the scheduling rules, in terms of the service-target satisfaction and the resource utilization. From the sensitivity analysis, we find that the performance of the proposed scheduling rules is fairly robust to the specification of the established lead-time targets

Capacity Planning for Heterogeneous Patient Populations in Primary Care and Specialty Networks

Access to primary care has a direct impact on morbidity and mortality, and is strongly influenced by indirect waiting time: the delay between the requested and allotted appointment day. Our models describe the heterogeneous appointment seeking patterns of a primary care patient panel using stochastic processes parameterized to reflect the diversity of primary care visit rates in the US. For capacity planning, we estimate the distribution of daily appointments, and show that the distribution variability can be reduced by heuristics that use patient flexibility regarding the day of the appointment. For delays, we demonstrate that in a first-come, first-served system, patients who need the most frequent appointments suffer the greatest delays, motivating the need to reserve slots for high-visit patient classes. To further understand the inequity in delay, we model the primary care appointment system as a Discrete-Time Markov Chain. We derive an analytical expression for delay in terms of the patient’s probability of daily visit. We show that conditions for monotone mapping of the probability of visit to delay are intractable and give numerical results that support monotonicity. In our last chapter, we expand our scope to include specialty care networks. Using patient-level longitudinal data from the Medical Expenditure Panel Survey, we model the sequence of appointments with multiple specialty types and the time intervals between such appointments as a Markov Renewal Process (MRP). We use comorbidity count to model patient heterogeneity and extract the MRP parameters for each patient subgroup. Next, we adapt the steady state results to provide an analytical expression of the expected appointment fill-rate by specialty and patient subgroups. Our analytical results demonstrate that patients with higher comorbidity count typically have a lower fill-rate because of shorter lead time between appointments thereby necessitating either overtime or reserved slots to ensure timely access. We further simulate appointment seeking patterns of a nationally representative panel of patients in the specialty network and estimate the distribution of daily appointment requests for each specialty. Similar to the primary care case, we show that heuristics that leverage patient flexibility regarding the day of the appointment can reduce variability in appointment requests for each specialty

Provider Scheduling at the Worcester VA Community Based Outpatient Clinic

The implementation of a Patient-Centered Medical Home (PCMH) concept, known as the Patient Aligned Care Team (PACT) model at the Worcester Community Based Outpatient Clinic (CBOC), revealed provider scheduling and utilization challenges. A linear programming based planning tool described in this report identifies optimal provider schedules The planning tool, named ProSkedge, is able to be modified to fit the varying operating constraints the CBOC faces. Also included is a simulation model to validate the linear program and to perform scenario analysis. Additional recommendations for improved facility operations are provided based on observation and a review of the literature

Three Essays on Data-Driven Optimization for Scheduling in Manufacturing and Healthcare

This dissertation consists of three essays on data-driven optimization for scheduling in manufacturing and healthcare. In Chapter 1, we briefly introduce the optimization problems tackled in these essays. The first of these essays deals with machine scheduling problems. In Chapter 2, we compare the effectiveness of direct positional variables against relative positional variables computationally in a variety of machine scheduling problems and we present our results. The second essay deals with a scheduling problem in healthcare: the team primary care practice. In Chapter 3, we build upon the two-stage stochastic integer programming model introduced by Alvarez Oh (2015) to solve this challenging scheduling problem of determining patient appointment times to minimize a weighted combination of patient wait and provider idle times for the team practice. To overcome the computational complexity associated with solving the problem under the large set of scenarios required to accurately capture uncertainty in this setting, our approach relies on a lower bounding technique based on solving an exhaustive and mutually exclusive group of scenario subsets. Our computational results identify the structure of optimal schedules and quantify the impact of nurse flexibility, patient crossovers and no-shows. We conclude with practical scheduling guidelines for team primary care practices. The third essay deals with another scheduling problem observed in a manufacturing setting similar to first essay, this time in aerospace industry. In Chapter 4, we propose mathematical models to optimize scheduling at a tactical and operational level in a job shop at an aerospace parts manufacturer and implement our methods using real-life data collected from this company. We generalize the Multi-Level Capacitated Lot-Sizing Problem (MLCLSP) from the literature and use novel computational techniques that depend on the data structure observed to reduce the size of the problem and solve realistically-sized instances in this chapter. We also provide a sensitivity analysis of different modeling techniques and objective functions using key performance indicators (KPIs) important for the manufacturer. Chapter 5 proposes extensions of models and techniques that are introduced in Chapters 2, 3 and 4 and outlines future research directions. Chapter 6 summarizes our findings and concludes the dissertation

Applying and integer Linear Programming Model to an appointment scheduling problem

Dissertação de Mestrado, Ciências Económicas e Empresariais (Economia e Políticas Públicas), 28 de fevereiro de 2022, Universidade dos Açores.A gestão de consultas ambulatórias pode ser um processo complexo, uma vez que envolve vários stakeholders com diferentes objetivos. Para os utentes poderá ser importante minimizar os tempos de espera. Simultaneamente, para os trabalhadores do setor da saúde, condições de trabalho justas devem ser garantidas. Assim, é cada vez mais necessário ter em conta o equilíbrio de cargas horárias e a otimização dos recursos disponíveis como principais preocupações no agendamento e planeamento de consultas. Nesta dissertação, uma abordagem com dois modelos para a criação de um sistema de agendamento de consultas é proposta. Esta abordagem é feita em programação linear, com dois modelos que têm como objetivo minimizar as diferenças de cargas horárias e melhorar o seu equilíbrio ao longo do planeamento. Os modelos foram estruturados e parametrizados de acordo com dados gerados aleatoriamente. Para isso, o desenvolvimento foi feito em Java, gerando assim os dados referidos. O Modelo I minimiza as diferenças de carga horária entre os quartos disponíveis. O Modelo II, por outro lado, propõe uma nova função objetivo que minimiza a diferença máxima observada, com um processo de decisão minxmax. Os modelos mostram resultados eficientes em tempos de execução razoáveis para instâncias com menos de aproximadamente 10 quartos disponíveis. Os tempos de execução mais altos são observados quando as instâncias ultrapassam este número de quartos disponíveis. Em relação ao equilíbrio da carga horária, observou-se que o número de especialidades disponíveis para atendimento e a procura por dia foram o que mais influenciou a minimização da diferença da carga horária. Os resultados do Modelo II mostram melhor tempo de execução e um maior número de soluções ótimas. Uma vez que as diferenças entre os dois modelos não são consideráveis, o Modelo I poderá representar um melhor conjunto de soluções para os decisores já que minimiza a diferença da carga horária total entre quartos em vez de apenas minimizar o valor máximo da diferença de carga horária entre quaisquer dois quartos.ABSTRACT: Outpatient appointment management can be a complex process since it involves many conflicting stakeholders. As for the patients it might be important to minimize waiting time. Simultaneously, for healthcare workers, fair working conditions must be guaranteed. Thus, it is increasingly necessary to have workload balance and resource optimization as the main concerns in the scheduling and planning of outpatient appointments. In this dissertation, a two-model approach for designing an appointment scheduling is proposed. This approach is formulated as two mathematical Integer Linear Programming models that integrate the objective of minimizing workload difference and improving workload balance. The models were structured and parameterized according to randomly generated data. For this, the work was developed in Java, generating said data. Model I minimizes the workload differences among rooms. Model II, on the other hand, proposes a new objective function that minimizes the maximum workload difference, with a minxmax decision process. The computational models behaves efficiently in reasonable run times for numerical examples with less than approximately 10 rooms available. Higher run times are observed when numerical examples surpass these number of available rooms. Regarding workload balance, it was observed that the number of specialties available for appointments and the demand for each day were the most influential in the minimization of workload difference. Model II results show a shorter model run time and more optimal solutions. As the differences between both Models are not considerable, Model I might propose a better set of solution for decision makers since it minimizes the total workload difference amongst rooms instead of only minimizing the maximum workload difference between any two rooms

Performance analysis and scheduling strategies for ambulatory surgical facilities

Ambulatory surgery is a procedure that does not require an overnight hospital stay and is cost effective and efficient. The goal of this research is to develop an ASF operational model which allows management to make key decisions. This research develops and utilizes the simulation software ARENA based model to accommodate: (a) Time related uncertainties – Three system uncertainties characterize the problem (ii) Surgery time variance (ii) Physician arrival delay and (iii) Patient arrival delay; (b) Resource Capture Complexities – Patient flows vary significantly and capture/utilize both staffing and/or physical resources at different points and varying levels; and (c) Processing Time Differences – Patient care activities and surgical operation times vary by type and have a high level of variance between patient acuity within the same surgery type. A multi-dimensional ASF non-clinical performance objective is formulated and includes: (i) Fixed Labor Costs – regular time staffing costs for two nurse groups and medical/tech assistants, (i i) Overtime Labor Costs – staffing costs beyond the regular schedule, (i i i) Patient Delay Penalty – Imputed costs of waiting time experienced patients, and (iv) Physician Delay Penalty – Imputed costs of physicians having to delay surgical procedures due to ASF causes (limited staffing, patient delays, blocked OR, etc.). Three ASF decision problems are studied: (i) Optimize Staffing Resources Levels - Variations in staffing levels though are inversely related to patient waiting times and physician delays. The decision variable is the number of staff for three resource groups, for a given physician assignment and surgery profile. The results show that the decision space is convex, but decision robustness varies by problem type. For the problems studied the optimal levels provided 9% to 28% improvements relative to the baseline staffing level. The convergence rate is highest for less than optimal levels of Nurse-A. The problem is thus amenable to a gradient based search. (ii) Physician Block Assignment - The decision variables are the block assignments and the patient arrivals by type in each block. Five block assignment heuristics are developed and evaluated. Heuristic #4 which utilizes robust activity estimates (75% likelihood) and generates an asymmetrical resource utilization schedule, is found to be statistically better or equivalent to all other heuristics for 9 out of the 10 problems and (iii) Patient Arrival Schedule – Three decision variables in the patient arrival control (a) Arrival time of first patient in a block (b) The distribution and sequence of patients for each surgery type within the assigned windows and (c) The inter arrival time between patients, which could be constant or varying. Seven scheduling heuristics were developed and tested. Two heuristics one based on Palmers Rule and the other based on the SPT (Shortest Processing Time) Rule gave very strong results