Car-sharing between two locations: online scheduling with flexible advance bookings

DOI10.1016/j.dam.2022.01.016zbMath1485.90045OpenAlexW4220840994MaRDI QIDQ5896897

Erlebach, Thomas, Kelin Luo, Yin-Feng Xu

Publication date: 28 March 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.016

zbMATH Keywords

schedulingcompetitive analysisbooking horizon

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online \(k\)-server routing problems
• The online prize-collecting traveling salesman problem
• Dynamic pickup and delivery problems
• 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
• Toward Robust Revenue Management: Competitive Analysis of Online Booking
• Tight Bounds for Online TSP on the Line
• Algorithmic Applications in Management
• Approximation and Online Algorithms

This page was built for publication: Car-sharing between two locations: online scheduling with flexible advance bookings