Question

I really am not understand some of the questions my teacher is asking for this class, any help would be apreciated. This question is an assignemnt problem to be solved with exahustive search

1) Use the exhaustive search method to solve this assignment problem. Each table entry represents the cost of person n to complete job m Job-3 P-1 P-2 P-3

Answer 1

Given solution Let N workers and N jobs it can be perform any job then depend on the work job assignment To perform the jobs assign by exact one worker to each and every job Such that total cost of the optimized is minimum Calculate the cost function choose the job has minimum cost list is unassigned job process choose worker has lowest cost for that job step 1: calculate the cost when job 2 has assign to the person p - 1 since job 2 has assign the person p - 1 (green color) cost becomes to unavailable indicate red color Now assign job 3 to Person p - 2 as it has minimum cost from the list of unassigned jobs Cost become 2 + 3 = 5 job 3 and Person p - 2 becomes unavailable process Finally job 1 has get to assign to worker p - 3 it has minimum cost unassigned jobs 2 + 3 + 5 = 10 Finally job assignment problem green values has show the optimal job