In this paper, an extension of the classical scheduling problem is considered. It is assumed that tasks are processed on parallel processors, available at different production sites. Each task also requires for its processing additional (reusable) resources which, at the beginning, are available at resource sites and production sites. The problem is to find a schedule for processing all the tasks and transporting the resources required between resource and production sites in order to minimize certain objective functions. In the paper, several variations of the problem are considered and mathematical programming formulations for each subproblem are given.