What class of scheduling problem models jobs which require multiple machines simultaneously?

Question

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.

Answer 1

The sequencing models (flow/job shops or hybrid too) are the basic (concept) in the scheduling. It means that to use them into the real world scheduling problems you will have to modify them. (adding some constraints to the model which represent your limitations).

AFAIK, as you mentioned constraints, it can be expressed as a specific project scheduling with resource constraints. would you search for some of the practical scheduling software such as SAP-APO, ASPROVA or some of the online sequencing software? (some of them have a trial version)

They have some nice features such as resource leveling, flexible Gantt chart, exact or heuristic algorithms and other facilities that might be useful.