Given: A company has four machines that can accomplish three jobs. Each job can be assigned to one, and only one machine. The objective is to assign the jobs to the machines in the most cost-efficient manner. Costs for each job-machine combination are given in the following table.
|
Machine 1 |
Machine 2 |
Machine 3 |
Machine 4 |
|
|
Job 1 |
19 |
23 |
28 |
31 |
|
Job 2 |
7 |
14 |
16 |
19 |
|
Job 3 |
10 |
15 |
20 |
22 |
Required: Solve for the minimum cost.