Robust Appointment Scheduling with Heterogeneous Costs

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.25OpenAlexW2977657013MaRDI QIDQ5875477

Rajan Udwani, Andreas S. Schulz

Publication date: 3 February 2023

Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.25

zbMATH Keywords

robust optimizationapproximation algorithmsappointment scheduling

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
• Sequencing and scheduling \(N\) customers for a stochastic server
• Robust optimization-methodology and applications
• Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
• Appointment Scheduling with Discrete Random Durations
• Robust Appointment Scheduling
• Increasing Speed Scheduling and Flow Scheduling
• Theory and Applications of Robust Optimization
• Managing Patient Service in a Diagnostic Medical Facility
• The Price of Robustness
• Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations
• Technical Note—A Sampling-Based Approach to Appointment Scheduling
• On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
• A Note on Appointment Scheduling with Piecewise Linear Cost Functions
• Dual Techniques for Scheduling on a Machine with Varying Speed
• A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems

This page was built for publication: Robust Appointment Scheduling with Heterogeneous Costs