Kirk Pruhs

Jul 17, 2023 | arxiv.org | Josh Ascher |Kirk Pruhs

We consider the online transportation problem set in a metric space containing parking garages of various capacities. Cars arrive over time, and must be assigned to an unfull parking garage upon their arrival. The objective is to minimize the aggregate distance that cars have to travel to their assigned parking garage.