On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis

Abstract

We consider an online problem where a server operates on an edge-weighted graph G and an adversarial sequence of requests to vertices is released over time. Each request requires one unit of servicetime. The server is free to choose the ordering of service and intends to minimize the total flowtime of the requests.

A natural class of algorithms for this problem are Ignore algorithms. From worst-case perspective we show that Ignore algorithms are not competitive for flowtime minimization. From an average-case point of view, we obtain a more detailed picture. In our model, the adversary may still choose the vertices of the requests arbitrarily. But the arrival times are according to a stochastic process (with some rate λ> 0), chosen by the adversary out of a natural class of processes. The class contains the Poisson-process and (some) deterministic arrivals as special cases. We then show that there is an Ignore algorithm that is competitive if and only if $\lambda \not = 1$. Specifically, for $\lambda \not = 1$, the expected competitive ratio of the algorithm is within a constant of the length of a shortest cycle that visits all vertices of G. The reason for this is that if $\lambda \not = 1$ the requests either arrive slow enough for our algorithm or too fast even for an offline optimal algorithm. For λ= 1 the routing-mistakes of the online algorithm accumulate just as in the worst case.

As an additional result, we show how Ignore tours are constructed optimally in polynomial time, if the underlying graph G is a line.