I.

Definition

Assignment method is a special type of linear programming problem which deals

with the allocation of the various resources to the various activities on one to one

basis. It does it in such a way that the cost or time involved in the process is minimum

and profit or sale is maximum

An assignment is optimum if the number of lines used is equal the number of rows

or the number of columns.

II. Procedures

There are three main steps to follow in solving an assignment problem:

1. Subtract the smallest cost from each entry in each row. If each zero can now be

assigned one-to-one correspondence with the “workers”, and optimal solution is

reached. If it cannot, go on to step 2.

2. Subtract the smallest cost in each column. If the zero entries can now be

distributed one-to-one correspondence with the “workers”, an optimal solution is

reached. If it cannot go to step 3.

3. Cover the zero entries by vertical or horizontal lines, using the least number of

lines possible. (This can be done by covering first the row or column having the

most number of zeros.) Subtract the smallest uncovered cost from the uncovered

cost but add it to the entry found at the intersection of the lines. If an assignment

is already possible, an optimal solution is already reached. If not, repeat step 3.

 III. Illustration

Four engineers are to work on four projects of PSV Construction Company. The

problem is to decide which engineer should be assigned to which project. Each

engineer charges different fees on each project, due to the distances of the projects

and the complexity of the work. The cost of assigning particular engineers to

particular projects are as follows:

Projects
A B C D
1 $ 11,000 $ 8,000 $ 10,000 $ 7,000
2 $ 6,000 $ 5,000 $ 3,000 $ 8,000
Engineers 3 $ 4,000 $ 8,000 $ 10,000 $ 9,000
4 $ 11,000 $ 10,000 $ 5,000 $ 7,000

The objective is to find the least cost of assignment

Solution:

11 8 10 7 RESULT AFTER REMOVING THREE ZEROS IN EACH

6 5 3 8
4 8 10 9 ENTRY
11 10 5 7

4 1 3 0 RESULT AFTER SUBTRACTING THE SMALLEST ENTRY IN

3 2 0 5
0 4 6 5 EACH ROW
6 5 0 2
 4 0 3 0 RESULT AFTER SUBTRACTING THE SMALLEST ENTRY IN
3 1 0 5
0 3 6 5 EACH COLUMN
6 4 0 2

4 0 3 0 COVERING ZERO ENTRIES WITH THE LEAST VERTICAL AND

3 1 0 5
0 3 6 5 HORIZONTAL LINES
6 4 0 2

Assigning the projects to the engineers: (giving each zero to each engineer)

Engineer 1 can go to project B or D

Engineer 2 can go to project B or C
Engineer 3 can go to project A
Engineer 4 can go to project C

Final Decision:

Cost
Engineers 1 to D 7,000
2 to B 5,000
3 to A 4,000
4 to C 5,000
21,000 minimum cost

Explanation: Since engineers 4 and 3 cannot go to any project except C and A respectively, then
engineer 2 must go to project B, while engineer 1 has no other choice but D.