@inproceedings{57cdfbfc28b2478ba772d2b32229c7f6,
title = "Online Scheduling of Car-Sharing Request Pairs between Two Locations with Advance Bookings",
abstract = "We consider an online car-sharing problem with advance bookings, in which users (customers) submit their ride requests, and the scheduler aims to maximize the number of satisfied users. For the setting with two locations A and B, every user has a pair of requests where each request specifies the pickup time, the drop-off time, the pick-up location, and the drop-off location: one request from A to B, and one request from B to A, not necessary in this order. The schedule has to decide whether or not to accept a pair of requests immediately at the time when the request pairs are submitted. We present lower bounds on the competitive ratio for this problem and propose a greedy algorithm that achieves the best possible competitive ratio.",
keywords = "Car-sharing System, Competitive Analysis, Online Scheduling, Request Pairs",
author = "Kelin Luo and Yinfeng Xu and Haodong Liu",
note = "Publisher Copyright: {\textcopyright} 2019 IEEE.; 2019 International Conference on Industrial Engineering and Systems Management, IESM 2019 ; Conference date: 25-09-2019 Through 27-09-2019",
year = "2019",
month = sep,
doi = "10.1109/IESM45758.2019.8948087",
language = "英语",
series = "Proceedings of the 2019 International Conference on Industrial Engineering and Systems Management, IESM 2019",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
editor = "Feifeng Zheng and Feng Chu and Ming Liu",
booktitle = "Proceedings of the 2019 International Conference on Industrial Engineering and Systems Management, IESM 2019",
}