Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.

DOI10.4230/LIPIcs.ISAAC.2018.64OpenAlexW2906896471MaRDI QIDQ5091058

Erlebach, Thomas, Kelin Luo, Yin-Feng Xu

Publication date: 21 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.ISAAC.2018.64

zbMATH Keywords

competitive analysison-line schedulingcar-sharing system

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

Online scheduling of car-sharing request pairs between two locations ⋮ Online car-sharing problem with variable booking times ⋮ Tight competitive analyses of online car-sharing problems

Cites Work

• From theory to practice: maximizing revenues for on-line dial-a-ride
• Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs
• Tight Bounds for Online TSP on the Line
• Approximation and Online Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.