Hardness results for the probabilistic traveling salesman problem with deadlines