Say that an item is an indivisible piece of work that needs to be achieved by one resource (worker).
Each item must be:
- Step 1: prepared by one of the resources from group A,
- Step 2: And then transformed by one of the resources from group B.
Step 1 takes 1 day (one resource achieves one item in one day), while step 2 takes 4 days.
Is there a known math formula or algorithm to determine when all the items will be achieved?
Considering that the number of items is known in advance, as well as the number of resources per group (and one resource cannot move from one group to another). For instance, I can compute when group A will be finished:
= CEILING(Number of items / count of resources in group A) * Work duration
But then I need to compute the (dependent) work for group B that will have a discretely increasing workload (one resource of group B can only start when one item has passed step 1).