Assignment Problem using Hungarian Algorithm
Step 1: Original Cost Matrix
| J1 | J2 | J3
W1 | 9 | 2 | 7
W2 | 6 | 4 | 3
W3 | 5 | 8 | 1
Step 2: After Row and Column Reduction
| J1 | J2 | J3
W1 | 4 | 0 | 5
W2 | 0 | 1 | 0
W3 | 1 | 7 | 0
Step 3: Cover All Zeros with Minimum Lines
Zeros at positions:
- (W1, J2)
- (W2, J1), (W2, J3)
- (W3, J3)
Lines used: 3 (Column J2, Row W2, Column J3)
Since 3 lines = n (3), we proceed to assignment.
Step 4: Optimal Assignment (from reduced matrix)
Assignments:
- W1 to J2 (0)
- W2 to J1 (0)
- W3 to J3 (0)
Step 5: Final Result (from original matrix)
| J1 | J2 | J3
W1 | 9 | 2 | 7
W2 | 6 | 4 | 3
W3 | 5 | 8 | 1
Final Assignments:
- W1 to J2 = 2
- W2 to J1 = 6
- W3 to J3 = 1
Total Minimum Cost = 2 + 6 + 1 = 9