An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline

The Resource Constrained Traveling Salesman Problem (RCTSP) is introduced and an optimal algorithm for its solution is presented. The RCTSP is shown to subsume the Prize Collecting TSP and Orienteering Problem. Computational results are presented for sequential and parallel computations for problems containing up to 200 cities. The RCTSP algorithm is used to optimally schedule a processing facility involving sequence dependent transition costs and an aggregate due date on all job completion times. A penalty is incurred for each job not completed by the aggregate due date.