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.STACS.2019.51
URN: urn:nbn:de:0030-drops-102907
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10290/
Go to the corresponding LIPIcs Volume Portal

Luo, Kelin ; Erlebach, Thomas ; Xu, Yinfeng

Car-Sharing on a Star Network: On-Line Scheduling with k Servers

pdf-format:
LIPIcs-STACS-2019-51.pdf (0.5 MB)

Abstract

We study an on-line scheduling problem that is motivated by applications such as car-sharing for trips between an airport and a group of hotels. Users submit ride requests, and the scheduler aims to accept requests of maximum total profit using k servers (cars). Each ride request specifies the pick-up time, the pick-up location, and the drop-off location, where one of the two locations must be the airport. A request must be submitted a fixed amount of time before the pick-up time. The scheduler has to decide whether or not to accept a request immediately at the time when the request is submitted (booking time). In the unit travel time variant, the travel time between the airport and any hotel is a fixed value t. We give a 2-competitive algorithm for the case in which the booking interval (pick-up time minus booking time) is at least t and the number of servers is even. In the arbitrary travel time variant, the travel time between the airport and a hotel may have arbitrary length between t and L t for some L >= 1. We give an algorithm with competitive ratio O(log L) if the number of servers is at least ceil[log L]. For both variants, we prove matching lower bounds on the competitive ratio of any deterministic on-line algorithm.

BibTeX - Entry

@InProceedings{luo_et_al:LIPIcs:2019:10290,
  author =	{Kelin Luo and Thomas Erlebach and Yinfeng Xu},
  title =	{{Car-Sharing on a Star Network: On-Line Scheduling with k Servers}},
  booktitle =	{36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
  pages =	{51:1--51:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-100-9},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{126},
  editor =	{Rolf Niedermeier and Christophe Paul},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2019/10290},
  doi =		{10.4230/LIPIcs.STACS.2019.51},
  annote =	{Keywords: Car-Sharing System, On-Line Scheduling, Competitive Analysis, Star Network}
}

Keywords: Car-Sharing System, On-Line Scheduling, Competitive Analysis, Star Network
Collection: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Issue Date: 2019
Date of publication: 12.03.2019

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