Stochastic Optimization Approaches for Outpatient Appointment Scheduling under Uncertainty
Shehadeh, Karmel
2019
Abstract
Outpatient clinics (OPCs) are quickly growing as a central component of the healthcare system. OPCs offer a variety of medical services, with benefits such as avoiding inpatient hospitalization, improving patient safety, and reducing costs of care. However, they also introduce new challenges for appointment planning and scheduling, primarily due to the heterogeneity and variability in patient characteristics, multiple competing performance criteria, and the need to deliver care within a tight time window. Ignoring uncertainty, especially when designing appointment schedules, may have adverse outcomes such as patient delays and clinic overtime. Conversely, accounting for uncertainty when scheduling has the potential to create more efficient schedules that mitigate these adverse outcomes. However, many challenges arise when attempting to account for uncertainty in appointment scheduling problems. In this dissertation, we propose new stochastic optimization models and approaches to address some of these challenges. Specifically, we study three stochastic outpatient scheduling problems with broader applications within and outside of healthcare and propose models and methods for solving them. We first consider the problem of sequencing a set of outpatient procedures for a single provider (where each procedure has a known type and a random duration that follows a known probability distribution), minimizing a weighted sum of waiting, idle time, and overtime. We elaborate on the challenges of solving this complex stochastic, combinatorial, and multi-criteria optimization problem and propose a new stochastic mixed-integer programming model that overcomes these challenges in contrast to the existing models in the literature. In doing so, we show the art of, and the practical need for, good mathematical formulations in solving real-world scheduling problems. Second, we study a stochastic adaptive outpatient scheduling problem which incorporates the patients’ random arrival and service times. Finding a provably-optimal solution to this problem requires solving a MSMIP, which in turn must optimize a scheduling problem over each random arrival and service time for each stage. Given that this MSMIP is intractable, we present two approximation based on two-stage stochastic mixed-integer models and a Monte Carlo Optimization approach. In a series of numerical experiments, we demonstrate the near-optimality of the appointment order (AO) rescheduling policy, which requires that patients are served in the order of their scheduled appointments, in many parameter settings. We also identify parameter settings under which the AO policy is suboptimal. Accordingly, we propose an alternative swap-based policy that improves the solution of such instances. Finally, we consider the outpatient colonoscopy scheduling problem, recognizing the impact of pre-procedure bowel preparation (prep) quality on the variability of colonoscopy duration. Data from a large OPC indicates that colonoscopy durations are bimodal, i.e., depending on the prep quality they can follow two different probability distributions, one for those with adequate prep and the other for those with inadequate prep. We define a distributionally robust outpatient colonoscopy scheduling (DRCOS) problem that seeks optimal appointment sequence and schedule to minimize the worst-case weighted expected sum of patient waiting, provider idling, and provider overtime, where the worst-case is taken over an ambiguity set characterized through the known mean and support of the prep quality and durations. We derive an equivalent mixed-integer linear programming formulation to solve DRCOS. Finally, we present a case study based on extensive numerical experiments in which we draw several managerial insights into colonoscopy scheduling.Subjects
Appointment Scheduling Stochastic Programming Distributionally Robust Optimization Mixed-Integer Programming OR in Health Services Outpatient Clinics
Types
Thesis
Metadata
Show full item recordCollections
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.