Distributionally robust scheduling of stochastic knapsack arrivals
From MaRDI portal
Publication:6568455
DOI10.1016/j.cor.2024.106641MaRDI QIDQ6568455
Erwin W. Hans, Gréanne Leeftink, Hayo Bos, Richard Boucherie
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Wasserstein distancestochastic knapsackdistributionally robust optimizationcyclic schedulemaster surgical schedulescheduled arrivals
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Master surgery scheduling with consideration of multiple downstream units
- Reducing the number of required beds by rearranging the OR-schedule
- Scheduling arrivals to queues
- Loss networks
- Two-stage robust optimization approach to elective surgery and downstream capacity planning
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally robust scheduling on parallel machines under moment uncertainty
- A distributionally robust optimization approach for stochastic elective surgery scheduling with limited intensive care unit capacity
- Data-driven distributionally robust capacitated facility location problem
- Scheduling surgery groups considering multiple downstream resources
- A distributionally robust optimization approach for outpatient colonoscopy scheduling
- On the distributions of infinite server queues with batch arrivals
- The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
- Distributionally robust facility location with bimodal random demand
- Robust recycling facility location with clustering
- INFINITE-SERVER QUEUES WITH BATCH ARRIVALS AND DEPENDENT SERVICE TIMES
- A discrete-time queueing network
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Theory and Applications of Robust Optimization
- Optimal project selection: Stochastic knapsack with finite time horizon
- Integer Programming
- Product forms for queueing networks with state-dependent multiple job transitions
- Scheduling Arrivals to Queues: A Single-Server Model with No-Shows
- The Dynamic and Stochastic Knapsack Problem with Random Sized Items
- Finite Horizon Stochastic Knapsacks with Applications to Yield Management
- Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution
- Globalized Distributionally Robust Counterpart
This page was built for publication: Distributionally robust scheduling of stochastic knapsack arrivals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568455)