Scribd
Upload
6 views3 pages

OR Project Part B

The document outlines the steps to solve an assignment problem using the Hungarian Assignment Method based on a provided cost matrix. It details the row and column reductions, the covering of zeros, the adjustment of the matrix, and the optimal assignment of employees to projects. The final solution indicates that the optimal assignments minimize the total cost to 59 thousand rupees.

Uploaded by

dalvik295
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views3 pages

OR Project Part B

The document outlines the steps to solve an assignment problem using the Hungarian Assignment Method based on a provided cost matrix. It details the row and column reductions, the covering of zeros, the adjustment of the matrix, and the optimal assignment of employees to projects. The final solution indicates that the optimal assignments minimize the total cost to 59 thousand rupees.

Uploaded by

dalvik295
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Part B : Numerical Question

Let’s solve the assignment problem step by step using the Hungarian Assignment Method based
on the cost matrix provided.

❖ Cost Matrix:

Employees/Projects Project A Project B Project C Project D


Employee 1 18 26 17 11
Employee 2 13 28 14 15
Employee 3 11 16 15 10
Employee 4 19 24 19 13

❖ Step 1: Row Reduction

For each row, subtract the smallest value in the row from all elements in that row:

Employees/Projects Project A Project B Project C Project D


Employee 1 7 15 6 0
Employee 2 0 15 1 2
Employee 3 1 6 5 0
Employee 4 6 11 6 0

❖ Step 2: Column Reduction

For each column, subtract the smallest value in the column from all elements in that column:

Employees/Projects Project A Project B Project C Project D


Employee 1 7 9 5 0
Employee 2 0 9 0 2
Employee 3 1 0 4 0
Employee 4 6 5 6 0

❖ Step 3: Cover Zeros with Minimum Lines


▪ Cover all zeros in the matrix using the minimum number of lines (horizontal or vertical).
▪ In this case, 3 lines are required to cover all zeros.
▪ Since the number of lines is less than the matrix size (4), proceed to Step 4.

❖ Step 4: Adjust the Matrix


▪ Identify the smallest uncovered value: 1.
▪ Subtract this value from all uncovered elements and add it to elements at intersections of
the lines.
❖ Updated matrix:

Employees/Projects Project A Project B Project C Project D


Employee 1 6 8 4 0
Employee 2 0 8 0 1
Employee 3 0 0 3 0
Employee 4 5 4 5 0

❖ Step 5: Optimal Assignment

Assign tasks based on the zeros in the matrix:

1) Employee 1 → Project D
2) Employee 2 → Project A
3) Employee 3 → Project B
4) Employee 4 → Project C

❖ Step 6: Calculate the Total Cost

The cost of the assignments is:

1) Employee 1 → Project D: 11
2) Employee 2 → Project A: 13
3) Employee 3 → Project B: 16
4) Employee 4 → Project C: 19

Total Cost = 11 + 13 + 16 + 19 = 59 (thousand rupees).

❖ Final Solution:-
The optimal assignment is:

1) Employee 1 → Project D
2) Employee 2 → Project A
3) Employee 3 → Project B
4) Employee 4 → Project C
Minimized Total Cost = 59 (thousand rupees).

You might also like