In the Flow/Job Shop problems, and other related scheduling problems, a common assumption is that at any given time, a particular job will be being processed on at most one machine (usually... none).
Now imagine a scheduling problem in which a particular job requires multiple "machines" simultaneously, e.g. multiple "resources" instances which are modelled as separate machines. For example, producing a particular type of widget requires 1x human resource A and 1x lathe B and 1x computer server C, at the same time, during which those particular resource instances are locked and cannot work on any other jobs.
What class of scheduling problem is this? (One-to-many job-to-machine model)
ANSWER: "Resource constrained scheduling" seems to be the idea, e.g. as discussed in Chapter 17 of "Principles of Sequencing and Scheduling" by Baker/Trietsch.