Question: A company wishes to assign a set of jobs to a set of machines. The following table provides data on the cost of production of each job when performed on a specific machine.
|
Machine
|
|
Job
|
A
|
B
|
C
|
D
|
|
1
|
27
|
29
|
28
|
30
|
|
2
|
30
|
29
|
27
|
26
|
|
3
|
31
|
25
|
29
|
26
|
|
4
|
29
|
31
|
25
|
28
|
(i) Applying the Hungarian manual method, make optimal assignments of jobs to machines such that overall cost is minimized.
(ii) Assign variables using a systematic nomenclature and place them in a travel chart of jobs and machines like the above chart.
(iii) Formulate this assignment as an LP problem to be solved using some software such as excel solver. Write the objective function, the constraints and the non-negativity equation. [You are not being asked to fully solve the problem using the excel solver program.]