License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2019.25
URN: urn:nbn:de:0030-drops-112407
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/11240/
Go to the corresponding LIPIcs Volume Portal

Schulz, Andreas S. ; Udwani, Rajan

Robust Appointment Scheduling with Heterogeneous Costs

pdf-format:
LIPIcs-APPROX-RANDOM-2019-25.pdf (0.5 MB)

Abstract

Designing simple appointment systems that under uncertainty in service times, try to achieve both high utilization of expensive medical equipment and personnel as well as short waiting time for patients, has long been an interesting and challenging problem in health care. We consider a robust version of the appointment scheduling problem, introduced by Mittal et al. (2014), with the goal of finding simple and easy-to-use algorithms. Previous work focused on the special case where per-unit costs due to under-utilization of equipment/personnel are homogeneous i.e., costs are linear and identical. We consider the heterogeneous case and devise an LP that has a simple closed-form solution. This solution yields the first constant-factor approximation for the problem. We also find special cases beyond homogeneous costs where the LP leads to closed form optimal schedules. Our approach and results extend more generally to convex piece-wise linear costs.
For the case where the order of patients is changeable, we focus on linear costs and show that the problem is strongly NP-hard when the under-utilization costs are heterogeneous. For changeable order with homogeneous under-utilization costs, it was previously shown that an EPTAS exists. We instead find an extremely simple, ratio-based ordering that is 1.0604 approximate.

BibTeX - Entry

@InProceedings{schulz_et_al:LIPIcs:2019:11240,
  author =	{Andreas S. Schulz and Rajan Udwani},
  title =	{{Robust Appointment Scheduling with Heterogeneous Costs}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
  pages =	{25:1--25:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-125-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{145},
  editor =	{Dimitris Achlioptas and L{\'a}szl{\'o} A. V{\'e}gh},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/11240},
  URN =		{urn:nbn:de:0030-drops-112407},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2019.25},
  annote =	{Keywords: Appointment scheduling, approximation algorithms, robust optimization}
}

Keywords: Appointment scheduling, approximation algorithms, robust optimization
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Issue Date: 2019
Date of publication: 17.09.2019

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI