gmatt1476

A factory assembles Product X from three components, A, B, and C. One of each component is needed for each Product X and all three components must be available when assembly of each Product X starts. It takes two days to assemble one Product X. Assembly of each Product X starts at the beginning of one day and is finished at the end of the next day. The factory can work on at most five Product Xs at once. If components are available each day as shown in the table above, what is the largest number of Product Xs that can be assembled during the three days covered by the table?
A. 3
B. 5
C. 6
D. 9
E. 10
PS56441.01
Attachment:
2019-09-21_1841.png
Given :All three components A,B,C necessary to start producing X.
It takes two days to assemble product X.
We can only work at most product Xs at any given time.
To Find:Maximum number of Product Xs that can be assembled in 3 days under given constraints.
Process:The maximum number of Product Xs we can work on a day is the minimum of (A,B,C) on a given day.
On Day 1:
min(A,B,C) = 3. So on Day 1 we start working on 3 Xs.
These will continue till end of Day 2.
On Day 2:
We are currently working on 3 Xs from Day 1 and min(A,B,C) on Day 2 = 3.
So we can start working on 3 more Xs on Day 2, but as we can work on only 5 Xs at any time, so only two more Xs can be worked upon.
Now total Xs in progress = 5.
On Day 3:
3 Xs were finished on Day 2, 2 Xs started on Day 2 are still in progress.
If we start any new Xs today, they won't be finishd by end of Day 3, so no point in starting.
At the end of Day 3, total 5 Product X have been produced.
Hence B is correct.