A review of robust operations management under model uncertainty
Over the past two decades, there has been explosive growth in the application of robust
optimization in operations management (robust OM), fueled by both significant advances in …
optimization in operations management (robust OM), fueled by both significant advances in …
Operating room planning and scheduling for outpatients and inpatients: A review and future research
L Wang, E Demeulemeester, N Vansteenkiste… - Operations Research for …, 2021 - Elsevier
In hospitals, surgeries are treated either on an outpatient or on an inpatient basis.
Outpatients are normally routine patients that enter and leave the hospital on the same day …
Outpatients are normally routine patients that enter and leave the hospital on the same day …
Ambiguous chance-constrained binary programs under mean-covariance information
We consider chance-constrained binary programs, where each row of the inequalities that
involve uncertainty needs to be satisfied probabilistically. Only the information of the mean …
involve uncertainty needs to be satisfied probabilistically. Only the information of the mean …
Integer programming approaches for appointment scheduling with random no-shows and service durations
We consider a single-server scheduling problem given a fixed sequence of appointment
arrivals with random no-shows and service durations. The probability distribution of the …
arrivals with random no-shows and service durations. The probability distribution of the …
Chance-constrained optimization under limited distributional information: A review of reformulations based on sampling and distributional robustness
S Küçükyavuz, R Jiang - EURO Journal on Computational Optimization, 2022 - Elsevier
Chance-constrained programming (CCP) is one of the most difficult classes of optimization
problems that has attracted the attention of researchers since the 1950s. In this survey, we …
problems that has attracted the attention of researchers since the 1950s. In this survey, we …
Logic-based benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling
The distributed operating room (OR) scheduling problem aims to find an assignment of
surgeries to ORs across collaborating hospitals that share their waiting lists and ORs. We …
surgeries to ORs across collaborating hospitals that share their waiting lists and ORs. We …
Solving 0–1 semidefinite programs for distributionally robust allocation of surgery blocks
We allocate surgery blocks to operating rooms (ORs) under random surgery durations.
Given unknown distribution of the duration of each block, we investigate distributionally …
Given unknown distribution of the duration of each block, we investigate distributionally …
Overcommitment in cloud services: Bin packing with chance constraints
MC Cohen, PW Keller, V Mirrokni… - Management …, 2019 - pubsonline.informs.org
This paper considers a traditional problem of resource allocation: scheduling jobs on
machines. One such recent application is cloud computing; jobs arrive in an online fashion …
machines. One such recent application is cloud computing; jobs arrive in an online fashion …
Distributionally robust appointment scheduling with moment-based ambiguity set
We study appointment scheduling under random service duration with unknown
distributions. Given a sequence of appointments arriving at a single server, we assign their …
distributions. Given a sequence of appointments arriving at a single server, we assign their …
Current trends in operating room scheduling 2015 to 2020: a literature review
The operating room scheduling problem is a popular research topic due to its complexity
and relevance. Previous literature reviews established a useful classification system for …
and relevance. Previous literature reviews established a useful classification system for …