Profit-based latency problems on the line

We consider a latency problem with a profit pipi for each client. When serving a client, a revenue of pi−tpi−t is collected. The goal is to find routes for the servers such that total collected revenue is maximized. We study the complexity of different variants of this problem on the line.