In the examples (as you mention also), interchangeable resources with some total availability are expected. However, you can treat schedule as multiple networks of single schedule. In the algorithms, there is a step where you select next eligible activity: here you can decide not only on resource availability, but also dependencies (to activities of different resources).
As you ask for keywords, try "Parallel schedule generation scheme".
To quote the resource linked below, giving the gist of the method:
" A parallel schedule generation scheme iterates over the time horizon of the project (i.e. a time incrementation) instead of iterating over the priority list (i.e. an activity incrementation) and adds activities that are eligible to be scheduled. More precisely, the scheme starts at time point t = 0 and schedules activities before the time pointer is increased. It selects at each decision point t the eligible activities E and assigns a scheduling sequence of these eligible activities according to the priority list. At each decision point, the eligible activities are scheduled with a starting time equal to the decision point (on the condition that there is no resource conflict). Activities that cannot be scheduled due to a resource conflict are skipped and become eligible to schedule at the next decision point t’ > t, which equals the earliest completion time of all activities active at the current decision point t. "
Check the following link, it lists couple resource-based scheduling approaches http://www.pmknowledgecenter.be/page/2011/52/resource-scheduling