Answered

Get personalized and accurate responses to your questions with IDNLearn.com. Our platform is designed to provide quick and accurate answers to any questions you may have.

Suppose two workers could be hired, F and G, and they take the same time to complete tasks as the current five workers. F and G can be assigned to work on the same pair of tasks as one of the current workers. For example, F could be assigned tasks T1 and T2 (just like worker A) while G is assigned T5 and T6 (just like worker C). They cannot be assigned tasks that are currently assigned to two workers. For example, F cannot be assigned to tasks T2 and T3 (because they are currently being done by workers A and B). What is the capacity of this process with workers F and G included ( toothbrushes per minute)?

Sagot :

Ajeigbeibraheemidn

Answer:

Explanation:

The missing table is attached below.

Recall that:

The capacity of the interaction is controlled by the capacity of the bottleneck workers.

The extra resources accessible ought to be added to workers with the most noteworthy preparing times.  

For this situation, they are Worker A and Worker E.  

Summing up of resources halves the handling times for Worker A and E.

SO;

Worker    Old time(sec)    New time (sec)   Capacity  

A                65                       32.5                     1.85

B                 35                       35                        1.71

C                 25                       25                        2.40

D                 30                       30                        2.00

E                  60                       30                       2.00

Along these lines, the new capacity of the framework is characterized by new bottleneck B.  

So the capacity of the cycle is 60/35 = 1.71 toothbrush per each minute

View image Ajeigbeibraheem
Your participation means a lot to us. Keep sharing information and solutions. This community grows thanks to the amazing contributions from members like you. Your search for solutions ends here at IDNLearn.com. Thank you for visiting, and come back soon for more helpful information.