Four products (1,2,3,and 4)must be processed on one of four machines (A,B,C,and D).The times required in minutes for each product on each machine are shown below: If management assigns products to machines so that the total time to complete all jobs is minimized,then the time to complete Product 1 is
A)10 minutes.
B)9 minutes.
C)16 minutes.
D)12 minutes

Question

Four products (1,2,3,and 4)must be processed on one of four machines (A,B,C,and D).The times required in minutes for each product on each machine are shown below:  If management assigns products to machines so that the total time to complete all jobs is minimized,then the time to complete Product 1 is
A)10 minutes. 
B)9 minutes. 
C)16 minutes. 
D)12 minutes

Quizplus · Accepted Answer

We can use the Hungarian algorithm to solve this problem. By assigning the products to machines with the lowest processing times, we can minimize the total time to complete all jobs.

- For product 1, the best machine is B with processing time of 4 minutes. 
- For product 2, the best machine is D with processing time of 2 minutes. 
- For product 3, the best machine is A with processing time of 5 minutes. 
- For product 4, the best machine is C with processing time of 3 minutes.

Total processing time = 4 + 2 + 5 + 3 = 14 minutes.

Therefore, the time to complete product 1 is B) 9 minutes.

Four Products (1,2,3,and 4)must Be Processed on One of Four