Scribd
Upload
14 views

Assignment

The document outlines a 7 step process for solving an assignment problem. Step 1 reduces rows and columns of a cost table. Step 2 further reduces the table. Steps 3-4 assign values until all are assigned or an optimal solution is found. Step 5 revises the table if optimal is not found. Step 6 chooses a smallest uncovered value and adjusts elements. Step 7 repeats steps 3-6 until an optimal solution is obtained.

Uploaded by

Rix Angela
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

Assignment

The document outlines a 7 step process for solving an assignment problem. Step 1 reduces rows and columns of a cost table. Step 2 further reduces the table. Steps 3-4 assign values until all are assigned or an optimal solution is found. Step 5 revises the table if optimal is not found. Step 6 chooses a smallest uncovered value and adjusts elements. Step 7 repeats steps 3-6 until an optimal solution is obtained.

Uploaded by

Rix Angela
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

STEP 1

• Locate smallest element in each row of the given cost table and then subtract that from each
element on that row

STEP 2

• In the reduced matrix obtained from the previous step, locate smallest element in each column
and then subtract that from each element of that column. Each row/column now have atleast
one zero value.

STEP 3

• Examine each rows until a row with exactly one unmarked zero is obtained. Make an assignment
to this single zero by making a square around it

• For each zero that becomes assigned, strike off other zeroes in the same row/column

• Repeat the above steps for each column exactly zero cell

• If a row/column has two or more unmarked zeros and one cannot be chosen by inspection, then
choose the zero arbitrarily

• Continue the process until all zeros in rows are assigned or struck off

STEP 4

• If the number of assigned cells is equal to the number of rows or columns then the solution is
optimal. The total cost associated with this solution is obtained by adding original cost figures in
occupied cells.

• If zero cell was chosen arbitrarily, then there exists alternative solution

• If optimal solution is not found, then proceed to step 5

STEP 5

• Revise the opportunity cost table by the following procedure


• For each row in which no assignment is made, mark a tick ( )
• Examine the marked rows. If any zero cell occurs in those rows, mark a ( ) to the respective
columns that contains those zeros
• Examine marked columns. If any assigned zero occurs in these columns, then tick the respective
rows that contain those zeros
• Repeat this process until no more rows and columns can be marked
• Draw a straight line through each unmarked row and each marked column

• If the number of lines drawn(or total assignments) is equal to the number of rows or columns
then the current solution is optimal, otherwise got to Step 6

STEP 6
• From cells not covered by any line, choose the smallest element. Call this value k

• Subtract k from every element in the cell not covered by a line

• Add k to every element in the cell covered by the two lines, i.e. intersection of two lines

• Element in cells covered by one line remains unchanged

STEP 7

• Repeat Steps 3 to 6 until an optimal solution is obtained

You might also like