Robust Appointment Scheduling with Heterogeneous Costs

DOI10.4230/LIPICS.APPROX-RANDOM.2019.25OpenAlexW2977657013MaRDI QIDQ5875477FDOQ5875477

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

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

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)