Distributionally robust scheduling of stochastic knapsack arrivals

DOI10.1016/J.COR.2024.106641MaRDI QIDQ6568455zbMATH OpenFDO

Authors Hayo Bos, Richard J. Boucherie, Erwin W. Hans, Gréanne Leeftink

Publication date 8 July 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106641

zbMATH Keywords

cyclic scheduledistributionally robust optimizationmaster surgical schedulescheduled arrivalsstochastic knapsackWasserstein distance

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A discrete-time queueing network
• A distributionally robust optimization approach for outpatient colonoscopy scheduling
• A distributionally robust optimization approach for stochastic elective surgery scheduling with limited intensive care unit capacity
• Data-driven distributionally robust capacitated facility location problem
• Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
• Distributionally robust facility location with bimodal random demand
• Distributionally robust optimization under moment uncertainty with application to data-driven problems
• Distributionally robust scheduling on parallel machines under moment uncertainty
• Finite Horizon Stochastic Knapsacks with Applications to Yield Management
• Globalized Distributionally Robust Counterpart
• scientific article; zbMATH DE number 3134565 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Infinite-server queues with batch arrivals and dependent service times
• Integer Programming
• Loss networks
• Master surgery scheduling with consideration of multiple downstream units
• Multiservice loss models for broadband telecommunication networks
• On the distributions of infinite server queues with batch arrivals
• Optimal project selection: Stochastic knapsack with finite time horizon
• Product forms for queueing networks with state-dependent multiple job transitions
• Reducing the number of required beds by rearranging the OR-schedule
• Robust recycling facility location with clustering
• Robust stochastic facility location: sensitivity analysis and exact solution
• Scheduling arrivals to queues
• Scheduling Arrivals to Queues: A Single-Server Model with No-Shows
• Scheduling surgery groups considering multiple downstream resources
• The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• Theory and applications of robust optimization
• Two-stage robust optimization approach to elective surgery and downstream capacity planning

Cited in

(1)

• A multiobjective -constraint based approach for the robust master surgical schedule under multiple uncertainties

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)