University Of Baghdad

Petroleum Engineering Department

Assignment Problems

By:
Balsam Qusay Mohammed
Abstract
The objective of the assignment problem is to assign a fleet a set of trains while satisfying a rich set of
operational and budget constraints and optimizing one or more crucial objectives. This paper presents a
survey on optimization models for this class of scheduling problems. Depending on the context of
application, the kind of model used to solve the varies; accordingly, this influences the solution
methodology and algorithms used.
In this paper, we review and also suggest a classification of the various models.

Introduction
Assignment problems deal with the question how to assign n objects to m other objects in an injective
fashion in the best possible way. An assignment problem is completely specified by its two components: the
assignments - which represent the underlying combinatorial structure and the objective function to be
optimized which models the best possible way". In the classical assignment problem one has N = n and
most of the problems with N>n can be transformed or are strongly related to analogous problems with N
= n. Therefore, we will consider N = n through the rest of this chapter, unless otherwise spiced.

Definition The name “Assignment problem" originates from the classical problems. Where the
objectives is to assign a number of origins to equal number of destinations at a minimum cost or to assign
number of jobs to equal number of reasons with a maximum profit.

Need to study
The element Cij represents the cost of assigning worker I to job (i, j= 1, 2, -n). There is no loss in generality
in assuming that the number of workers always equals the number of jobs because we can always add
fictitious (untrue or fabricated) workers or fictitious jobs to affect this result.

Scope of study:
The assignment model is actually a special case of the transportation model in which the workers represent
the sources and the jobs represent the destinations.

Objectives:
formulate an assignment problem;
determine the optimal solutions of assignment problems using the Hungarian method;
obtain the solutions for special cases of assignment problems, i.e, maximisation problem,
unbalanced assignment problem, alternative optimal solutions and restriction on assignments; and
solve the travelling salesman problem as an assignment problem.

Methodology:
The project is descriptive & exploratory but constructive in nature.
The secondary data is collected through books, journals, magazines
The primary data is collected through descriptive with acumination expect.
ASSIGNMENT PROBLEM AND ITS SOLUTION

An assignment problem may be considered as a special type of transportation problem in which the
number of sources and destinations are equal. The capacity of each source as well as the requirement of
each destination is taken as 1. In the case of an assignment problem, the given matrix must necessarily be
a square matrix which is not the condition for a transportation problem.
Suppose there are n persons and n jobs and the assignment of jobs has to be done on a one-to-one basis.
This assignment problem can be stated in the form of an n×n matrix of real numbers (known as the cost
matrix) as given in the following table:

where cij represents the amount of time taken by ith person to complete the jth job. Let xij denote the jth
job assigned to the ith person. Then, mathematically, the assignment problem can be stated as follows:

The constant cij in the above problem represents time. It may be cost or some other parameter which is to
be minimized in the assignment problem under consideration.
Note that an assignment problem is a special type of transportation problem and may be solved as one.
However, we use another method known as the Hungarian method for solving it. This method is shorter and
easier compared to any other method of finding the optimal solution of a transportation problem. Let us
explain the Hungarian method of finding the optimal solution of an assignment problem.
Hungarian method

Special algorithms exist to solve assignment problems. The most common is probably
the Hungarian solution method. The Hungarian method of assignment provides us
with an efficient means of finding the optimal solution without having to make a
direct comparison of every assignment option. It operates on a principle of matrix
reduction, which means that by subtracting and adding appropriate numbers in the
cost table or matrix, we can reduce the problem to a matrix of opportunity costs.
Opportunity costs show the relative penalties associated with assigning any person
to a project as opposed to making the best or least-cost assignment. We would like
to make assignments such that the opportunity cost for each assignment is zero.
The steps involved in the Hungarian method are outlined below.

1. Check whether the given matrix is square. If not, make it square by adding a suitable number of dummy rows (or
columns) with 0 cost/time elements.
2. Locate the smallest cost element in each row of the cost matrix. Subtract the smallest element of each row from
every element of that row.
3. In the resulting cost matrix, locate the smallest element in each column and subtract the smallest element of each
column from every element of that column.
4. In the resulting matrix, search for an optimum assignment as follows:
i) Examine the rows successively until a row with exactly one zero is found. Draw a rectangle around this zero (as 0 )
and cross out all other zeroes in the corresponding column. Proceed in this manner until all the rows have been
examined. If there is more than one zero in any row, do not touch that row; pass on to the next row.
ii) Repeat step (i) above for the columns of the resulting cost matrix.
iii) If a row or column of the reduced matrix contains more than one zeroes, arbitrarily choose a row or column having
the minimum number of zeroes. Arbitrarily select any zero in the row or column so chosen. Draw a rectangle around it
and cross out all the zeroes in the corresponding row and column. Repeat steps (i), (ii) and (iii) until all the zeroes have
either been assigned (by drawing a rectangle around them) or crossed.
iv) If each row and each column of the resulting matrix has one and only one assigned 0, the optimum assignment is
made in the cells corresponding to 0 . The optimum solution of the problem is attained and you can stop here.
Otherwise, go to the next step.
5. Draw the minimum number of horizontal and/or vertical lines through all the zeroes as follows:
i) Tick mark ( √ ) the rows in which assignment has not been made.
ii) Tick mark ( √ ) columns, which have zeroes in the marked rows.
iii) Tick mark ( √ ) rows (not already marked) which have assignments in marked columns. Then tick mark ( √ )
columns, which have zeroes in newly marked rows, if any. Tick mark ( √ ) rows (not already marked), which have
assignments in these newly marked columns.
iv) Draw straight lines through all unmarked rows and marked columns.
6. Revise the cost matrix as follows:
i) Find the smallest element not covered by any of the lines.
ii) Subtract this from all the uncovered elements and add it to the elements at the intersection of the two lines.
iii) Other elements covered by the lines remain unchanged.
7. Repeat the procedure until an optimum solution is attained.
Example:

Suppose we have to allocate 4 tasks (1,2,3,4) between 4 people (W,X,Y,Z). The costs are set out in the
following table:

The entries in the table denote the costs of assigning a task to a particular person.

Solution:

Step 1 of the Hungarian method

Subtract the minimum value from each row

The next step is to check whether optimal assignment can be made. This is done by finding the
minimum number of lines necessary to cross-out all the zero cells in the table. If this is equal to n
(the number of people/tasks) then the solution has been found. The minimum number of lines
necessary to cross through all the zeros (see Table 29)is 3 ¡ n = 4 so that an optimal allocation
has not been found.
(Note that there may be more than one way to draw the lines through the zero cells. It does not
matter which way you choose as long as there is no alternative way involving fewer lines)

Checking if an optimal assignment can been made

Next we revise the table by
(a) Finding the minimum uncovered cell.
(b) Subtracting the value obtained in (a) .
(c) Adding to all the cells at the intersection of the two lines.
The result of the above steps is given in .
We then check if the revised allocation is optimal. This is done by finding the minimum number of
lines required to cover all zeros.

This time the minimum number of lines necessary to cross through all the zeros is n = 4 so that an
optimal allocation has been found.
To make the final allocation we use the following steps.
• Find a row or column with only one zero cell.
• Make the assignment corresponding to that zero cell. • eliminate that row and column from the
table.
• Continue until all assignments have been found.

• Assign person W to task 1 and eliminate row W and column 1.

• Assign person Y to task 2 and eliminate row Y and column 2.
• Assign person Z to task 4 and eliminate row Z and column 4.
• This leaves final person X assigned to remaining task 3.

From the original cost table, we can determine the costs associated with the optimal assignment:
Total Cost = 48
Maximization Problem
There may be an assignment problem in the form of maximization problem. For
example, profits (or anything else like revenues), which need maximization may be
given in the cells instead of costs/times. To solve such a problem, we find the
opportunity loss matrix by subtracting the value of each cell from the largest value
chosen from amongst all the given cells. When the value of a cell is subtracted from
the highest value, it gives the loss of amount caused by not getting the opportunity
which would have given the highest value. The matrix so obtained is known as the
opportunity loss matrix and is handled in the same way as the minimization
problem.

ASSIGNMENT IS USED
In assigning machines to factory orders.
In assigning sales/marketing people to sales territories.
In assigning contracts to bidders by systematic bid-evaluation. In assigning
teachers to classes. In assigning accountants to accounts of the clients.

SUMMARY

1. In an assignment problem, the number of operations is assigned to an equal number of

operators where each operator performs only one operation. So, an assignment problem may be
considered as a special type of transportation problem in which the capacity of each of the
sources as well as the requirement of each of the destinations is taken as 1. In an assignment
problem, the given matrix must necessarily be a square matrix, which is not the condition for a
transportation problem. Such problems are solved using the Hungarian method, which is shorter
and easier compared to any other method of finding the optimal solution.
2. There may be assignment problems where maximization is required to be done instead of
minimization. To handle such a problem, we find the opportunity loss matrix by subtracting the
value of each cell from the largest value chosen from amongst all the given cells. When the value
of a cell is subtracted from the highest value, it gives the loss of amount caused by not getting the
opportunity which would have given the highest value. The matrix so obtained is known as the
opportunity loss matrix and is handled in the same way as the minimization problem.
CONCLUSION

Assignment is used to assign the jobs on one-on-one basis. * It is used to maximize

the profit and minimize the cost. If all the steps followed in the proper way the
optimality reached will be effectively useful.

References
Handbook of Optimization From Classical to Modern Approach

Wiley StatsRef: Statistics Reference Online