Note that a hardness result for execution time follows also from the hardness of the communication cost when using a sin­gle object for all transactions, since the optimal TSP tour for an object provides the best time bound for scheduling the object in its transactions.
this reduction does not prove that the execution time is hard to approximate.