Вы находитесь на странице: 1из 9

Jomo Kenyatta University of Agri and Tech.

HBC 2122

Assignment Model
The assignment problem is a special type of transportation problem, where the objective is to minimize
the cost or time of completing a number of jobs by a number of persons. In other words, when the
problem involves the allocation of n different facilities to n different tasks, it is often termed as an
assignment problem. The assignment problem also encompasses an important sub-class of so- called
shortest- (or longest-) route models.

The model's primary usefulness is for planning. It is also useful in solving problems such as, assignment
of machines to jobs, assignment of salesmen to sales territories, travelling salesman problem, etc.

It may be noted that with n facilities and n jobs, there are n! possible assignments. One way of finding
an optimal assignment is to write all the n! possible arrangements, evaluate their total cost, and select
the assignment with minimum cost. But, due to heavy computational burden this method is not
suitable. This chapter concentrates on an efficient method for solving assignment problems that was
developed by a Hungarian mathematician D.Konig

Formulation of an assignment problem

Suppose a company has n persons of different capacities available for performing each different job in
the concern, and there are the same number of jobs of different types. One person can be given one
and only one job. The objective of this assignment problem is to assign n persons to n jobs, so as to
minimize the total assignment cost. The cost matrix for this problem is given below:

Job
Worker j1 j2 … jn ai
i1 X11 X12 Xn1
C11 C12 … C1n 1
i2 X22 X22 X2n
C21 C22 … C2n 1
… … … … … …
Xn1 Xn2 Xnn
in Cn1 Cn2 … Cnn 1
bj 1 … … 1

Page 1 of 9
Jomo Kenyatta University of Agri and Tech. HBC 2122

To formulate the assignment problem in mathematical programming terms, we define the activity
variables as:

Xij = 1 if job j is performed by worker i

0 otherwise

for i = 1, 2, ..., n and j = 1, 2, ..., n

In the above table, Cij is the cost of performing jth job by ith worker.

The optimization model is:

Minimize C11X11 + C12X12 + ……………………………. CnnXnn

Subject to:

Xi1 + Xi2 + Xi3 ……….Xin = 1

X1j + X2j + X3j ……….Xnj = 1

Xij = 0 or 1

In Sigma notation

Minimize Xij

Subject to:

Xij = 1 for i = 1 , 2 ………...+ n

Xij = 1 for j = 1, 2, ………. + n

Xij = 0 or 1 for all i and j

Note: An assignment problem can be solved by transportation methods, but due to high degree of
degeneracy the usual computational techniques of a transportation problem become very inefficient.
Therefore, a special method is available for solving such type of problems in a more efficient way.

Page 2 of 9
Jomo Kenyatta University of Agri and Tech. HBC 2122

Assumptions

1. Number of jobs is equal to the number of machines or persons.


2. Each man or machine is assigned only one job.
3. Each man or machine is independently capable of handling any job to be done.
4. Assigning criteria is clearly specified (minimizing cost or maximizing profit).

Hungarian Method

It is an efficient method for solving assignment problems . This method is based on the following
principle:

If a constant is added to, or subtracted from, every element of a row and/or a column of the given cost
matrix of an assignment problem, the resulting assignment problem has the same optimal solution as
the original problem.

Algorithm

1. The objective of this section is to examine a computational method - an algorithm - for deriving
solutions to the assignment problems. The following steps summarize the approach:
2. Identify the minimum element in each row and subtract it from every element of that row.
Identify the minimum element in each column and subtract it from every element of that
column.
3. Make the assignments for the reduced matrix obtained from steps 1 and 2 in the following way:
i. For each row or column with a single zero value cell that has not be assigned or
eliminated, box that zero value as an assigned cell.
ii. For every zero that becomes assigned, cross out (X) all other zeros in the same row and
the same column.
iii. If for a row and a column, there are two or more zeros and one cannot be chosen by
inspection, then you are at liberty to choose the cell arbitrarily for assignment.
iv. The above process may be continued until every zero cell is either assigned or
crossed(X).

4. An optimal assignment is found, if the number of assigned cells equals the number of rows (and
columns). In case you have chosen a zero cell arbitrarily, there may be alternate optimal
solutions. If no optimal solution is found, go to step 5.
5. Draw the minimum number of vertical and horizontal lines necessary to cover all the zeros in
the reduced matrix obtained from step 3 by adopting the following procedure:

Page 3 of 9
Jomo Kenyatta University of Agri and Tech. HBC 2122

i. Mark all the rows that do not have assignments.


ii. Mark all the columns (not already marked) which have zeros in the marked rows. Mark
all the rows (not already marked) that have assignments in marked columns.
iii. Repeat steps 5 (i) to (iii) until no more rows or columns can be marked.
iv. Draw straight lines through all unmarked rows and marked columns.

( You can draw the minimum number of lines by inspection.)

6. Select the smallest element from all the uncovered elements. Subtract this smallest element
from all the uncovered elements and add it to the elements, which lie at the intersection of two
lines. Thus, we obtain another reduced matrix for fresh assignment.
7. Go to step 3 and repeat the procedure until you arrive at an optimal assignment.

For the time being we assume that number of jobs is equal to number of machines or persons.

Page 4 of 9
Jomo Kenyatta University of Agri and Tech. HBC 2122

Example 1

There are six sales representatives to be distributed to six territories. To efficiently assign them, the
Sales Manager has to consider the skill, Experience, Seniority and Attitude of each sales representative
in relaation to each territory.

The Sales Manager evaluated these four factors using an appropriate survey and has obtained for each
sales representative a table showing the total score eg Ki + Si + Ai = Ti

Where

i = the sales representative

Ki = the score obtained by the sales rep for skill

Ei = score obtained by the sales rep for experience

Si = score obtained by sales rep for seniority

Ai = score obtained by sales rep for attitude

Ti = the score necessary by each sales rep to handle each territory

Each territory can be handled by only one representative.

The scores of the six representatives are recorded in the rating table below.

Territories
Reps Nyanza Western Central Coast Eastern Rift Valley
Onyango 15 35 0 25 10 45
Wafula 40 5 45 20 15 20
Kamau 25 60 10 65 25 10
Gona 25 20 35 10 25 60
Makau 30 70 40 5 40 50
Rotich 10 25 30 40 50 15

Obtain a solution for the best distribution of a territory to each of the six sales representatives.

Page 5 of 9
Jomo Kenyatta University of Agri and Tech. HBC 2122

Solution

Step 1

Subtract the smallest value in each column from all entries in that column

Territories
Reps Nyanza Western Central Coast Eastern Rift Valley
Onyango 05 30 0 20 0 35
Wafula 30 0 45 15 5 10
Kamau 15 55 10 60 15 0
Gona 15 15 35 05 15 50
Makau 20 65 40 0 30 40
Rotich 0 20 30 35 40 05

Step 2

Using the resulting matrix, subtract the smallest value in each row from all entries in that row

Territories
Reps Nyanza Western Central Coast Eastern Rift Valley
Onyango 05 30 0 20 0 35
Wafula 30 0 45 15 5 10
Kamau 15 55 10 60 15 0
Gona 10 10 30 0 10 45
Makau 20 65 40 0 30 40
Rotich 0 20 30 35 40 05

Step 3

Draw as few lines as possible to eliminate all zeroes in the table. The number of lines drawn should be
equal the number of rows or columns

In this case only 5 lines will be used to eliminate zeros in rows 1, 2, 3 and 6 and column 4.

Territories
Reps Nyanza Western Central Coast Eastern Rift Valley
Onyango 05 30 0 20 0 35
Wafula 30 0 45 15 5 10
Kamau 15 55 10 60 15 0
Gona 10 10 30 05 10 45
Makau 20 65 40 0 30 40
Rotich 0 20 30 35 40 05

Page 6 of 9
Jomo Kenyatta University of Agri and Tech. HBC 2122

Step 4

Take the smallest value in the undeleted column/row. Subtract it from all entries left undeleted and add
it to all entries occurring at the points of the deleted rows and columns.

In the current case, in the undeleted rows, the smallest value is 10. Hence subtract 10 from all entries
which were were left uncrossed and these are in cells: 1. Gona-Nyanza, 2. Gona-Western, 3. Gona-
Central, 4. Gona-Eastern, 5. Gona-Rift, 6. Makau-Nyanza, 7. Makau-Western, 8. Makau-Central, 9.
Makau-Eastern and 10. Makau-Rift

Territories
Reps Nyanza Western Central Coast Eastern Rift Valley
Onyango 05 30 0 30 0 35
Wafula 30 0 45 25 5 10
Kamau 15 55 10 70 15 0
Gona 0 0 20 0 0 35
Makau 10 55 30 0 20 30
Rotich 0 20 30 45 40 05

Return to step 3

Draw as few lines as possible to eliminate all zeroes in the table.

To obtain an optimal solution, the number of lines drawn should equal the number of rows or columns.

Currently, six lines must be drawn to eliminate all zeros in the table. Draw lines a long rows 1, 3, 4 and 5
and columns 1 and 2 as shown in the table below. This is therefore the optimal solution.

Territories
Reps Nyanza Western Central Coast Eastern Rift Valley
Onyango 05 30 0 30 0 35
Wafula 30 0 45 25 5 10
Kamau 15 55 10 70 15 0
Gona 0 10 20 0 0 35
Makau 10 55 30 0 20 30
Rotich 0 20 30 45 40 05

Having drawn the required number of lines for eliminating the zeros, the next thing now is to assign the
sales representative to their respective territories.

Page 7 of 9
Jomo Kenyatta University of Agri and Tech. HBC 2122

Assign:

1. Wafula to Western territory. This is an obvious choice since it is the only zero in row 2.
2. Similarly assign:

Kamau to Rift territory and


Rotich to Nyanza territory as they are the only zeros in rows 3 and 6

3. Assign Onyango to central territory as this is the only zeros in column 3

Onyango cannot be assigned to Eastern territory since he hs already been assigned to central
territory in row 1. Assign Gona to Eastern territory in order to have an assigned zero in column 5.

Gona cannot be assigned to Coast territory since the fourth row already has Gona assigned to
Eastern territory. Hence Makau must be chosen to go to Coast territory.

The optimal assignment table of a territory to each of the six sales representatives

Territories
Reps Nyanza Western Central Coast Eastern Rift Valley Men
Onyango - - 1 - - - 1
Wafula - 1 - - -- - 1
Kamau - - - - - 1 1
Gona - - - - 1 - 1
Makau - - - 1 - - 1
Rotich 1 - - - - - 1
Territory 1 1 1 1 1 1

The sales manager is bound to get the most efficient results by assigning:

1. Onyango to Central
2. Wafula to Western
3. Kamau to Rift
4. Gona to Eastern
5. Makau to Coast
6. Rotich to Nyanza

Page 8 of 9
Jomo Kenyatta University of Agri and Tech. HBC 2122

Exercise

Question One

The Dean of the School of Business wants to assign some five responsibilities to five academic members
of staff. To assign each member a responsibility, the dean conducted an objective survey to evaluate the
pros and cons of the assignments. After the evaluation of staff, he prepared a rating table, where the
scores represented the cost of assigning responsibility to each staff. The rating table was as follows:

Scores of ability of the five staff members in relation to each responsibility

Responsibility
Academic Staff Library Time-Table Exams Research Computing
Okello 40 15 25 30 35
Gupta 30 10 30 40 35
Barton 35 25 40 10 45
Shalpiro 10 10 55 10 50
Ngeny 35 55 50 15 45

Assign each academic staff to each responsibility.

Question Two

The Funny Toys Company has four men available for work on four separate jobs. Only one man can work
on any one job. The cost of assigning each man to each job is given in the following table. The objective
is to assign men to jobs in such a way that the total cost of assignment is minimum. Proceed with the
task.

Person
Person 1 2 3 4
A 20 25 22 28
B 15 18 23 11
C 19 17 21 24
D 25 23 24 24

Page 9 of 9

Вам также может понравиться