Assignment Problem. - Topic
Uploaded by
ScribdTranslationsAssignment Problem. - Topic
Uploaded by
ScribdTranslationsOperations Research 1
2.3.- ASSIGNMENT PROBLEM
Izar (1996) mentions that these problems involve assigning workers to different tasks,
considering the times it takes to perform them, aiming to minimize
the total time.
Hillier & Lieberman (2010) mention that the assignment problem is a special type of
linear programming problem in which the assigned are resources that are allocated to the
task execution. For example, those assigned may be employees who are expected
to assign work. The allocation of people to jobs is a common application of the problem
of assignment. However, the assigned do not have to be people. They can also be
machines, vehicles or plants, or even periods to which tasks are assigned.
In order to fit the definition of an assignment problem, it is necessary for this type of
Applications should be formulated in such a way that the following assumptions are met (Hillier &
Lieberman, 2010):
The number of assignees is equal to the number of tasks.
Each assignee is granted only one task.
3. Each task must be carried out only by an assignee (although sometimes it is not)
possible to meet this criterion).
4. There is a cost Cijassociated with the assigned i (i = 1, 2, 3, ..., n) that performs the task
j (j = 1, 2, ..., 3).
5. The objective is to determine how the 'n' assignments should be made to minimize
total costs.
The first three assumptions according to Hilier & Lieberman (2010) are quite restrictive.
Many potential applications do not fully satisfy them. It is often possible
reformulate the problem to make it fit. For example, many times it can be used
assigned fictitious or fictitious tasks for this purpose
A special algorithm for assignment problems.
Assignment problems can be solved by the simplex method, however there is
a more efficient algorithm to solve this type of problem, which is known as
UNIT II. NETWORK ANALYSIS TOPIC 2.3 ASSIGNMENT PROBLEM
Operations Research 2
the “Hungarian method” because it was developed by mathematicians from Hungary. This method
consists of the following (Izar, 1996):
1. Place the problem information in the assignment matrix where the elements
the same will be the times in which the workers are positioned as lines,
they execute the tasks, positioned as columns.
2. Identify the smallest element of each row and subtract it from each of the
elements of the line in which it was located.
3. Identify the smallest element of each column and subtract it from each of the
elements of the column in which it was found.
4. Verify the convergence, which consists of checking if there is in the assignment matrix
"n" zero elements, where "n" is the number of lines in the matrix, located
in such a way that each row and each column has one of them without repeating
none in the same line or in the same column. If this is fulfilled, the problem
it will have been resolved, with the solution being precisely to assign according to
to the location of these "n" zeros.
In case the convergence is not satisfied, go to the next step:
5. Cover all the zeros in the assignment matrix with the smallest possible number of
horizontal and vertical lines, where each of these must pass through the entire
line or column to which it corresponds. The total number of lines must be less
a 'n'.
6. Locate the smallest element of the matrix that is not covered by any line, the
what must be subtracted from each element not covered by any line and added to each
element covered by 2 lines.
7. From here, return to step 4.
Example (to resolve in class):
The BETTER PRODUCTS COMPANY has decided to start the manufacturing of four new
products in three plants that at the moment have excess production capacity. The
products require a comparable productive effort per unit, so the
available production capacity in the plants is measured by the number of units of
UNIT II. NETWORK ANALYSIS TOPIC 2.3 ASSIGNMENT PROBLEM
Operations Research 3
any product that can be manufactured per day, as shown in the last column of
Table 1. The last row shows the daily production needed to meet the ...
projected sales. Each plant can produce any of these products, except for the
plant 2 that cannot manufacture product 3, however the variable cost per unit of each
The product differs from one plant to another, as shown in the main body of Table 1.
Management needs to make the decision on how to divide production among the plants.
for which there are two options:
1. Allow the separation of products, in such a way that the same product can be
manufacturing in more than one plant (this option may incur hidden costs, such as; costs
preparation, distribution, and administration supplements.
Do not authorize the separation of product
Table 1. Data of the Better Products Co. problem.
Unit cost per product ($) Capacity
1 2 3 4 Available
1 41 27 28 24 75
Plant 2 40 29 -- 23 75
3 37 30 27 21 45
Production rate 20 30 30 40