On the Power of Greedy Approaches: Online Car Sharing with two servers on Two Locations, with varying booking times and paired requests

Abstract

Expanding upon previous work done upon the online car sharing problem, we explore the consequences of variable booking times on the problem with two servers and two locations. We focus on the special instance that mandates that each request is released alongside an identical request starting from the same location and same time, released at the same time.