2026-08-10T10:53:15Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9632 2024-03-06T10:44:35Z ddc:004 open_access

Car-Sharing between Two Locations: Online Scheduling with Two Servers Luo, Kelin Erlebach, Thomas Xu, Yinfeng Car-sharing system Competitive analysis On-line scheduling In this paper, we consider an on-line scheduling problem that is motivated by applications such as car sharing, in which users submit ride requests, and the scheduler aims to accept requests of maximum total profit using two servers (cars). Each ride request specifies the pick-up time and the pick-up location (among two locations, with the other location being the destination). The length of the time interval between the submission of a request (booking time) and the pick-up time is fixed. The scheduler has to decide whether or not to accept a request immediately at the time when the request is submitted. We present lower bounds on the competitive ratio for this problem and propose a smart greedy algorithm that achieves the best possible competitive ratio. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Kelin Luo and Thomas Erlebach and Yinfeng Xu 2018 Is Part Of LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2018.50 urn:nbn:de:0030-drops-96325 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.50 eng https://creativecommons.org/licenses/by/3.0/legalcode