Table 9-1
-A company must assign mechanics to each of four jobs.The time involved varies according to individual abilities.Table 9-1 shows how many minutes it takes each mechanic to perform each job.If the optimal assignments are made,how many total minutes would be required for completing the jobs?
A)0
B)4
C)17
D)16
E)None of the above

Question

Table 9-1 
-A company must assign mechanics to each of four jobs.The time involved varies according to individual abilities.Table 9-1 shows how many minutes it takes each mechanic to perform each job.If the optimal assignments are made,how many total minutes would be required for completing the jobs?
A)0 
B)4 
C)17 
D)16 
E)None of the above

Quizplus · Accepted Answer

The optimal assignments can be found using the Hungarian Algorithm, which assigns the lowest cost to each job while ensuring that each mechanic is assigned to only one job. The resulting assignments are:

Mechanic 1: Job 1
Mechanic 2: Job 3
Mechanic 3: Job 2
Mechanic 4: Job 4

The total time required for completing the jobs is the sum of the times for each assignment:

1 + 5 + 6 + 4 = 16

Therefore, the best choice is D, with a total time of 16 minutes.

Table 9-1 -A Company Must Assign Mechanics to Each of Four Jobs.The