Scribd
Upload
236 views

Solved Example Assignment Problem

This document provides steps to solve an assignment problem to assign 3 jobs to 3 machines to minimize total cost. The steps are: 1) Subtract minimum entry in each column/row from all entries to get opportunity cost matrices; 2) Check for optimality by drawing lines to cover all zeros - if lines equal rows, solution is optimal; 3) If not optimal, subtract 1 from uncovered entries and add 1 at line junction; 4) Re-check optimality - if lines now equal rows, assignment is optimal. 5) Assign jobs based on zeros in revised cost matrix. The optimal assignment has a total cost of Rs. 30.

Uploaded by

shishunal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
236 views

Solved Example Assignment Problem

This document provides steps to solve an assignment problem to assign 3 jobs to 3 machines to minimize total cost. The steps are: 1) Subtract minimum entry in each column/row from all entries to get opportunity cost matrices; 2) Check for optimality by drawing lines to cover all zeros - if lines equal rows, solution is optimal; 3) If not optimal, subtract 1 from uncovered entries and add 1 at line junction; 4) Re-check optimality - if lines now equal rows, assignment is optimal. 5) Assign jobs based on zeros in revised cost matrix. The optimal assignment has a total cost of Rs. 30.

Uploaded by

shishunal
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Solved Example Assignment Problem

Assign three jobs on three machines for following cost matrix: Machines Jobs M1 J1 J2 J3 Solution Step 1: Subtract minimum entry in each column from all the entries on that column. This is a job opportunity cost matrix. Rs. 14 Rs.11 Rs.20 M2 Rs.12 Rs.17 Rs. 8 M3 Rs.16 Rs.21 Rs. 7

Job-opportunity cost matrix Step 2: Subtract minimum entry in each row of job-opportunity cost matrix from all the entries of that row. This is a total opportunity cost matrix:

Total opportunity cost matrix Step 3: Check for Optimality Draw minimum number of horizontal and vertical lines to cover all zeros. This can be done in 2 lines, which is one less than the number of rows (which is 3). Thus, the solution is yet not final. Hence, go to step 4.

Check for optimality Step 4: From the uncovered entries, the minimum is 1. Thus, subtract 1 from all entries, which are uncovered. Add one at junction of lines, i.e., at J3-M1. We get the following matrix now, as the received opportunity cost matrix.

Revised total opportunity cost matrix Now, go to step 3 to check the optimality. We can cover all zeros of above matrix by at least three lines (which is also equal to number of rows). Hence, above solution may be used for optimal assignment. Step 5: Assignment Scheme Refer revised total opportunity cost matrix. Row J2 has only one zero at M1 column. Hence, assign J2 to M1. Remove row J2 and column M1. Column M3 of remainder matrix has one zero at J3 row. Assign J3 to M3. The last assignment is remainder job J1 to M2. Thus, the final assignment is: Job J1 J2 J3 Machine M2 M1 M3 Cost Rs.12 Rs.11 Rs. 7

Total Cost

Rs.30

You might also like