Assignment Model

Assignment model is a special application of Linear Programming Problem (LPP), in which the main objective
is to assign the work or task to a group of individuals such that;
i) There is only one assignment.
ii) All the assignments should be done in such a way that the overall cost is minimized (or profit is
maximized, in case of maximization).
→ In assignment problem, the cost of performing each task by each individual is known.
→ It is desired to find out the best assignments, such that overall cost of assigning the work is minimized.

Applications of Assignment Problem

Few applications of assignment problem are as follows:

• Assignment of employees to machines.

• Assignment of operators to jobs.
• Effectiveness of teachers and subjects.
• Allocation of machines for optimum utilization of space.
• Allocation of salesmen to different sales areas.
• Allocation of clerks to various counters.

In all the cases, the objective is to minimize the total time and cost or otherwise maximize the sales and
returns.

Hungarian Method

Hungarian method is named after Hungarian mathematician D Konig who developed the assignment
problem. The Hungarian method is also known as Flood’s Technique or the Reduced Matrix method. This
method of assignment provides an efficient means of finding the optimal solutions without having to make a
direct comparison of every option. It operates on a principle of matrix reduction.

Steps in Hungarian Method

Hungarian method of assignment problem (minimization case) can be summarized in the following steps:

Step 1: Note the Matrix

From the given problem, find out the cost table. Note that if the number of origins is not equal to the number
of destinations, then a dummy origin or destination must be added.

Step 2: Row Reduction

In each row of the table find out the smallest cost element, subtract this smallest cost element from each
element in that row. So, that there will be at least one zero in each row of the new table. This new table is
known as First Reduced Cost Table.
Step 3: Column Reduction

In each column of the table find out the smallest cost element, subtract this smallest cost element from each
element in that column. As a result of this, each row and column has at least one zero element. This new
table is known as Second Reduced Cost Table.

Step 4: Mark Assignments

Now determine an assignment as follows:

▫ For each row or column with a single zero element cell that has not be assigned or eliminated, box
that zero element as an assigned cell.
▫ For every zero that becomes assigned, cross out all other zeros in the same row and for column.
▫ If for a row and for a column there are two or more zero and one can’t be chosen by inspection,
choose the assigned zero cell arbitrarily.
▫ The above procedures may be repeated until every zero-element cell is either assigned (boxed) or
crossed out.
An optimum assignment is found, if the number of assigned cells is equal to the number of rows (and
columns). In case a zero cell had chosen arbitrarily, there may be an alternate optimum. If no optimum
solution is found i.e., some rows or columns without an assignment then go to Step 6.

Step 5: Marking Rows and Columns

Draw a set of lines equal to the number of assignments which has been made in Step 4, covering all the
zeros in the following manner:
• Mark check (√) to those rows where no assignment has been made.
• Examine the checked (√) rows. If any zero-element cell occurs in those rows, check (√) the
respective columns that contains those zeros.
• Examine the checked (√) columns. If any assigned zero element occurs in those columns, check (√)
the respective rows that contain those assigned zeros.
• The process may be repeated until more rows or column can be checked.
• Draw lines through all unchecked rows and through all checked columns.

Step 6: Reassignment

Examine those elements that are not covered by a line. Choose the smallest of these elements and subtract
this smallest from all the elements that do not have a line through them. Add this smallest element to every
element that lies at the intersection of two lines. Then the resulting matrix is a new revised cost table.
Flow Chart of Steps in the Hungarian Method
Example 1: Balanced Assignment Problem

Manual Solution

The Atlantic Coast Conference (ACC) has four basketball games on a particular night. The conference office
wants to assign four teams of officials to the four games in a way that will minimize the total distance traveled
by the officials. The supply is always one team of officials, and the demand is for only one team of officials at
each game. The distances in miles for each team of officials to each game location are shown in the following
table:

Game Sites
Officials Team Raleigh Atlanta Durham Clemson
A 210 90 180 160
B 100 70 130 200
C 175 105 140 170
D 80 65 105 120
Table 1: Cost Opportunity Table

The linear programming formulation of the assignment model is similar to the formulation of the transportation
model, except all the supply values for each source equal one, and all the demand values at each destination
equal one. Thus, our example is formulated as follows:

Objective Function: Minimize the distance traveled by the officials.

Minimize Z=210XAR+90XAA+180XAD+160XAC+100XBR+70XBA
+130XBD+200XBC+175XCR+105XCA+140XCD+170XCC+80XDR
+65XDA+105XDD+120XDC

Subject to:
XAR+XAA+XAD+XAC=1
XBR+XBA+XBD+XBC=1
XCR+XCA+XCD+XCC=1
XDR+XDA+XDD+XDC=1
XAR+XBR+XCR+XDR=1
XAA+XBA+XCA+XDA=1
XAD+XBD+XCD+XDD=1
XAC+XBC+XCC+XDC=1
Xij≥0
Step 1: Create an Opportunity Cost Table. It is accomplished by first subtracting the minimum value in each
row from each value in the row. These calculations are called row reduction.

Answer
Game Sites Game Sites
Officials Raleigh Atlanta Durham Clemson Officials Raleigh Atlanta Durham Clemson
A 210 90 180 160 A 120 0 90 70
B 100 70 130 200 B 30 0 60 130
C 175 105 140 170 C 70 0 35 65
D 80 65 105 120 D 15 0 40 55

Table 1-A: Row Reduction Table

Step 2: The minimum value in each column is subtracted from all column values. These calculations are
called column reduction.

Answer
Game Sites Game Sites
Officials Raleigh Atlanta Durham Clemson Officials Raleigh Atlanta Durham Clemson
A 120 0 90 70 A 105 0 55 15
B 30 0 60 130 B 15 0 25 75
C 70 0 35 65 C 55 0 0 10
D 15 0 40 55 D 0 0 5 0

Table 1-B: Column Reduction Table

Note: In Table 1-B, Team A assignment to Atlanta means no other team can be assigned to the game. Once
this assignment is made, the zeros in row B are invalid, indicating that there is no unique optimal assignment
for Team B. Therefore, Table 1-B does not contain optimal solutions. (An optimal solution occurs when the
number of independent unique assignments equals the number of rows or columns.)

Step 2-A: A test to determine if four unique assignments exist in Table 1-B is to draw the minimum number
of horizontal or vertical lines necessary to cross out all zeros through the rows and columns of the table. For
example, Table 1-C shows that three lines are required to cross out all zeros.

Game Sites
Officials Raleigh Atlanta Durham Clemson
A 105 0 55 15
B 15 0 25 75
C 55 0 0 10
D 0 0 5 0

Table 1-C: Opportunity Cost Table with Line Test

Step 2-B: Subtract the minimum value that is not crossed out from all values not crossed out. Then add this
minimum value to those cells where two lines intersect. The minimum value not crossed out in Table 1-C is
15. The second iteration for this model with the appropriate changes is shown in Table 1-D.

Answer
Game Sites Game Sites
Officials Raleigh Atlanta Durham Clemson Officials Raleigh Atlanta Durham Clemson
A 105 0 55 15 A 90 0 40 0
B 15 0 25 75 B 0 0 10 60
C 55 0 0 10 C 55 15 0 10
D 0 0 5 0 D 0 15 5 0

Table 1-D: Second Iteration

Step 3: Check whether there is at least one zero in each row and each column and make an assignment as
follows.

i. Examine the rows successively until a row with exactly one zero is found. Mark that zero by ,
that means an assignment is made there. Cross (X) all other zeros in its column. Continue this until
all the rows have been examined.
ii. Examine the columns successively until a column with exactly one zero is found. Mark that zero
by , that means an assignment is made there. Cross (X) all other zeros in its row. Continue this
until all the columns have been examined

A B
Game Sites Game Sites
Officials Raleigh Atlanta Durham Clemson Officials Raleigh Atlanta Durham Clemson
A 90 0 40 X A 90 X 40 0
B 0 X 10 60 B X 0 10 60
C 55 15 0 10 C 55 15 0 10
D X 15 5 Optimal
0 Solution D 0 15 5 X
A B
Assignment Game Sites Distance Assignment Game Sites Distance
Team A Atlanta 90 Team A Clemson 160
Team B Raleigh 100 Team B Atlanta 70
Team C Durham 140 Team C Durham 140
Team D Clemson 120 Team D Raleigh 80
450 miles 450 miles

Table 1-E: Optimal Assignment

There are two options on the ACC Basketball Games sites, as shown in Table 1-E. These two assignments
represent multiple optimal solutions, and both assignments require officials to travel a total distance of 450
miles.
Excel Solution

QM for Windows Solution

Example 2: Unbalanced Assignment Problem

Whenever the cost matrix of an assignment problem is not a square matrix, that is, whenever the number of
sources is not equal to the number of destinations, the assignment problem is called an unbalanced
assignment problem. In such problems, dummy rows (or columns) are added ion the matrix so as to complete
it to form a square matrix. The dummy rows or columns will contain all costs elements as zeroes.

Manual Computation

A company has five machines that are used for four jobs. Each job can be assigned to one and only one
machine. The cost of each job on each machine is given in the following table.

Machines
Jobs A B C D E
1 5 7 11 6 7
2 8 5 5 6 5
3 6 7 10 7 3
4 10 4 8 2 4
Table 2: Cost Opportunity Table

Objective Function: Minimize the cost of each job per machine

Minimize Z=5X1A+7X1B+11X1C+6X1D+7X1E+8X2A+5X2B
+5X2C+6X2D+5X2E+6X3A+7X3B+10X3C+7X3D+3X3E+10X4A
+4X4B+8X4C+2X4D+4X4E

Subject to:
X1A+X1B+X1C+X1D+X1E=1
X2A+X2B+X2C+X2D+X2E=1
X3A+X3B+X3C+X3D+X3E=1
X4A+X4B+X4C+X4D+X4E=1
X1A+X2A+X3A+X4A=1
X1B+X2B+X3B+X4B=1
X1C+X2C+X3C+X4C=1
X1D+X2D+X3D+X4D=1
X1E+X2E+X3E+X4E=1
Xij≥0
Step 1: Since this is an unbalanced assignment, add a dummy row to convert it to a 5x5 matrix.

Machines Machines
Jobs A B C D E Jobs A B C D E
1 5 7 11 6 7 1 5 7 11 6 7
2 8 5 5 6 5 2 8 5 5 6 5
3 6 7 10 7 3 3 6 7 10 7 3
4 10 4 8 2 4 4 10 4 8 2 4
D5 0 0 0 0 0
Table 2-A: Balanced Matrix

Step 2: Row Reduction

Answer
Machines Machines
Jobs A B C D E Jobs A B C D E
1 5 7 11 6 7 1 0 2 6 1 2
2 8 5 5 6 5 2 3 0 0 1 0
3 6 7 10 7 3 3 3 4 7 4 0
4 10 4 8 2 4 4 8 2 6 2 0
D5 0 0 0 0 0 D5 0 0 0 0 0
Table 2-B: Row Reduction Table

Step 2-A: column-wise reduction is not necessary since all columns contain a single zero. Perform line test
to cover all zeros.

Machines
Jobs A B C D E
1 0 2 6 1 2
2 3 0 0 1 0
3 3 4 7 4 0
4 8 2 6 2 0
D5 0 0 0 0 0
Table 2-C: Opportunity Table with Line Test
Step 2-B: Get the second and subsequent iterations by subtracting the minimum value of the uncovered
element from all other uncovered elements and adding this value to the element at the intersection of the
lines. Repeat this process until you get at least one zero for each row and column.
Answer
Machines Machines
Jobs A B C D E Jobs A B C D E
1 0 2 6 1 2 1 0 1 5 0 2
2 3 0 0 1 0 2 4 0 0 1 1
3 3 4 7 4 0 3 3 3 6 3 0
4 8 2 6 2 0 4 8 1 5 1 0
D5 0 0 0 0 0 D5 1 0 0 0 1
Table 2-D Second iteration

Answer
Machines Machines
Jobs A B C D E Jobs A B C D E
1 0 1 5 0 2 1 0 1 5 0 3
2 4 0 0 1 1 2 4 0 0 1 1
3 3 3 6 3 0 3 2 2 5 2 0
4 8 1 5 1 0 4 7 0 4 0 0
D5 1 0 0 0 1 D5 1 0 0 0 2
Table 2-E: Third Iteration

Step 3: Mark Assignment

Machines Optimal Solution

Jobs A B C D E Job Machine Cost
1 0 1 5 X 3 1 A 5
2 4 0 X 1 1 2 B 5
3 2 2 5 2 0 3 E 3
4 7 X 4 0 X 4 D 4
D5 1 X 0 X 2 D5 C 0
$17.00
Table 2-F: Optimal Assignment
Excel Solution

QM for Windows Solution

Example 3: Maximization Assignment Problem

Manual Computation

A company has 5 jobs to be done. The following matrix shows the return in terms of dollars on assigning i th
(i = 1, 2, 3, 4, 5) machine to the jth job (j = A, B, C, D, E). Assign the five jobs to the five machines so as to
maximize the total expected profit.
Jobs
Machine A B C D E
1 5 11 10 12 4
2 2 4 6 3 5
3 3 12 5 14 6
4 6 14 4 11 7
5 7 9 8 12 5

Table 3: Cost Opportunity Table

Objective Function: Maximize profit

Minimize Z=5X1A+11X1B+10X1C+12X1D+4X1E+2X2A+4X2B
+6X2C+3X2D+5X2E+3X3A+12X3B+5X3C+14X3D+6X3E+6X4A
+14X4B+4X4C+11X4D+7X4E+7X5A+9X5B+8X5C+12X5D+5X5E

Subject to:
X1A+X1B+X1C+X1D+X1E=1
X2A+X2B+X2C+X2D+X2E=1
X3A+X3B+X3C+X3D+X3E=1
X4A+X4B+X4C+X4D+X4E=1
X5A+X5B+X5C+X5D+X5E=1
X1A+X2A+X3A+X4A+X5A=1
X1B+X2B+X3B+X4B+X5B=1
X1C+X2C+X3C+X4C+X5C=1
X1D+X2D+X3D+X4D+X5D=1
X1E+X2E+X3E+X4E+X5E=1
Xij≥0

Step 1: Subtract all the elements from the highest element. Highest element = 14
Answer
Jobs Jobs
Machine A B C D E Machine A B C D E
1 5 11 10 12 4 1 9 3 4 2 10
2 2 4 6 3 5 2 12 10 8 11 9
3 3 12 5 14 6 3 11 2 9 0 8
4 6 14 4 11 7 4 8 0 10 3 7
5 7 9 8 12 5 5 7 5 6 2 9
Table 3-A: Modified Matrix
Step 2: Row Reduction.

Answer
Jobs Jobs
Machine A B C D E Machine A B C D E
1 9 3 4 2 10 1 7 1 2 0 8
2 12 10 8 11 9 2 4 2 0 3 1
3 11 2 9 0 8 3 11 2 9 0 8
4 8 0 10 3 7 4 8 0 10 3 7
5 7 5 6 2 9 5 5 3 4 0 7
Table 3-B: Row Reduction Table

Step 3: Column Reduction.

Answer
Jobs Jobs
Machine A B C D E Machine A B C D E
1 7 1 2 0 8 1 3 1 2 0 7
2 4 2 0 3 1 2 0 2 0 3 0
3 11 2 9 0 8 3 7 2 9 0 7
4 8 0 10 3 7 4 4 0 10 3 6
5 5 3 4 0 7 5 1 3 4 0 6

Table 3-C: Column Reduction Table

Step 3-A: Perform line test to cover all zeroes

Answer
Jobs Jobs
Machine A B C D E Machine A B C D E
1 3 1 2 0 7 1 2 0 1 0 6
2 0 2 0 3 0 2 0 2 0 4 0
3 7 2 9 0 7 3 6 1 8 0 6
4 4 0 10 3 6 4 4 0 10 4 6
5 1 3 4 0 6 5 0 2 3 0 5

Table 3-D: Cost Opportunity Table with Line Test

Step 3-B: Second Iteration

Answer
Jobs Jobs
Machine A B C D E Machine A B C D E
1 2 0 1 0 6 1 1 0 0 0 5
2 0 2 0 4 0 2 0 3 0 5 0
3 6 1 8 0 6 3 5 1 7 0 5
4 4 0 10 4 6 4 3 0 9 4 5
5 0 2 3 0 5 5 0 3 3 1 5

Table 3-E: Second Iteration

Step 4: Mark Assignment

Jobs Jobs
Machine A B C D E Machine A B C D E
1 1 X 0 X 5 1 5 11 10 12 4
2 X 3 X 5 0 2 2 4 6 3 5
3 5 1 7 0 5 3 3 12 5 14 6
4 3 0 9 4 5 4 6 14 4 11 7
5 0 3 3 1 5 5 7 9 8 12 5
Machine Job Profit
Optimal Solution
1 C 10
Machine Job Profit
12 CE 105
23 ED 514
34 DB 1414
45 BA 147
5 A $50.00
7
$50.00
Table 3-F: Optimal Assignment

Excel Solution
QM for Windows Solution
Case Study

New Approach to Solve Assignment Problem

Neha Rai, Khushbu Rai, A. J. Khan

Abstract

Assignment models belong to the class of linear programming models and have objective functions
similar to transport models: By assigning an order to a machine, or a machine to an order, or a destination
to a starting point, or a starting point to only one destination that minimizes the time or cost involved in
producing a product. The study presents a new approach to solving the allocation problem, an alternative
way to solve the allocation problem.
The assignment problem is a special structure of the transportation problem where the number of
jobs (tasks) equals the number of people (facilities). So the goal is how assignments have to be done to
achieve allocation. In the assignment model, workers are the source, and jobs are the destination. For
example, if n = 5 people, then it is assigned to 5 jobs, each supplier will be exactly 1. There are many ways
to develop simple computational techniques for this problem. The Hungarian method is one of them.

Here’s the alternative way in solving assignment model.

The new algorithm is as follows:

1. Subtract the smallest element of each row from every element of the corresponding row.
2. Subtract smallest element of each column from every element of the corresponding column.
3. Consider the location of zero at each row. If row contain only one zero then assign it for the
corresponding row and delete the corresponding row and column after allocation. Otherwise read
the location of zero below for further process.
4. If there is more than one zero then find the successor of zero and compare the maximum value and
assign zero
5. Repeating (3), (4) and find the optimal solution.

As you can see, the Hungarian method and the alternative methods proposed to solve the task problem are
almost identical. The difference is in placement. This study attempts to resolve placement issues. This
solution turned out to be the least achievable result. Using a scientific approach allows for systematic and
transparent solutions. The new alternative method can be applied to all kinds of allocation problems. We may
benefit from the proposed placement and selection approach. It gives the same optimal solution as the
Hungarian method optimal solution. Therefore, this paper presents another approach that can easily solve
the assignment problem.

Source: https://ijisrt.com/wp-content/uploads/2017/10/New-Approach-to-Solve-Assignment-Problem.pdf
Reference

Patro, P. K. (2016). Introduction to Management Science, Ninth Edition.pdf. www.academia.edu.

https://www.academia.edu/28659621/Introduction_to_Management_Science_Ninth_Edition_pdf
Commerceiets. (2020, February 19). ASSIGNMENT -OPERATIONS RESEARCH 1 COMMERCEIETS.
COMMERCEIETS. https://commerceiets.com/assignment/
Unbalanced assignment problems. (2020, March 27). Indiafreenotes.
https://indiafreenotes.com/unbalanced-assignment-problems/
HW1 (pdf) - Course Sidekick. (2023, June 30). https://www.coursesidekick.com/management/219911
Assignment Model | Linear Programming Problem (LPP) | Introduction | Education Lessons. (n.d.).
https://www.educationlessons.co.in/notes/assignment-model-introduction