Consider the problem of routing a set of nurses from each individual nurse's home to a set of patients and back home again. Each patient must be visited by a single "feasible" nurse during its time window. Essentially, this is a multi-depot vehicle routing problem with time windows with additional feasibility restrictions on which nurses can visit which patients. This problem is NP-Hard. We give mixed integer linear programming formulations of this problem and a parallel tour-building heuristic for finding a good solution.