We study an on-line scheduling problem that is motivated by applications such as car-sharing. Users submit ride requests, and the scheduler aims to accept requests of maximum total profit using a single server (car). Each ride request specifies the pick-up time and the pick-up location (among two locations, with the other location being the destination). The scheduler has to decide whether or not to accept a request immediately at the time when the request is submitted (booking time). We consider two variants of the problem with respect to constraints on the booking time: In the fixed booking time variant, a request must be submitted a fixed amount of time before the pick-up time. In the variable booking time variant, a request can be submitted at any time during a certain time interval that precedes the pick-up time. We present lower bounds on the competitive ratio for both variants and propose a greedy algorithm that achieves the best possible competitive ratio.
|Title of host publication||Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings|
|Editors||Daming Zhu, Lusheng Wang|
|Place of Publication||Cham|
|Number of pages||13|
|Publication status||Published - 2018|
|Name||Lecture Notes in Computer Science|