Robust Appointment Scheduling with Heterogeneous Costs

DOI10.4230/LIPICS.APPROX-RANDOM.2019.25MaRDI QIDQ5875477zbMATH OpenOpenAlexFDO

Authors Andreas S. Schulz, Rajan Udwani

Publication date 3 February 2023

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

zbMATH Keywords

approximation algorithmsrobust optimizationappointment scheduling

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 221926 (Why is no real title available?)
• A note on appointment scheduling with piecewise linear cost functions
• A primal-dual approximation algorithm for Min-sum single-machine scheduling problems
• Appointment scheduling with discrete random durations
• Dual techniques for scheduling on a machine with varying speed
• Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
• Increasing speed scheduling and flow scheduling
• Integer programming approaches for appointment scheduling with random no-shows and service durations
• Managing Patient Service in a Diagnostic Medical Facility
• On the performance of Smith's rule in single-machine scheduling with nonlinear cost
• Robust appointment scheduling
• Robust optimization-methodology and applications
• Scheduling arrivals to a stochastic service delivery system using copositive cones
• Sequencing and scheduling \(N\) customers for a stochastic server
• Technical Note—A Sampling-Based Approach to Appointment Scheduling
• The Price of Robustness
• Theory and applications of robust optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875477)