Solution of Assignment Problem

submitted in partial fulfilment for the requirement of the degree of

M. Sc. in Mathematics

by

Jyoti

19001753018

under the supervision of

Dr. Neetu Gupta

(Professor & The Chairperson)

Department of Mathematics

J C Bose University of Science & Technology

YMCA, Faridabad
 CERTIFICATE

This is to certify that the project entitled “ SOLUTION OF ASSIGNEMENT PROBLEM ” submitted in
partial fulfilment for the award of the degree of M.Sc. in Mathematics to the J.C Bose University of
Science and Technology, YMCA Faridabad, done by Ms. JYOTI Roll No. 19001753018 is an
authentic work carried out by her under my guidance . The matter embodied in this project work
has not been submitted earlier for award of any degree or diploma to the best of my knowledge
and belief.

Dr. Neetu Gupta

(Professor & The Chairperson)

Department of Mathematics
J C Bose UST, YMCA
 DECLARATION

This is to certify that the project report entitled “ SOLUTION OF ASSIGNEMENT PROBLEM ”, is
done by me and is an authentic work carried out for the partial fulfilment of the requirements for
the award of the degree of M.Sc. in Mathematics, under the guidance of Dr. Neetu Gupta . The
matter embodied in this project work has not been submitted earlier for award of any degree or
diploma to the best of my knowledge and belief.

Date: JYOTI

19001753018
 ACKNOWLEDGEMENTS

I would like to express my sincere gratitude to my supervisor Dr. Neetu Gupta for giving me the
opportunity to work under him. It would never be possible to prepare this report without his
innovative ideas and his relentless support and encouragement.

I wish to record my sincere thanks to all members of the department of mathematics for
providing incessant help and necessary facilities during the tenure of my work. I also extend my
thanks to staff for their valuable help when required.

The eternal inspiration and unending blessings of my parents Mr. Naresh Kumar and Mrs. Bala
Devi and my intense desire to fulfill their long cherished dreams have been the inspiring factors
that worked at the base of long venture. I am also thankful to other members of family for their
encouragement and sincere wishes that always kept me motivated and in a positive frame of
mind.

Finally the academic environment and support of my institute J.C. Bose University of Science and
Technology is great fully acknowledged
 Contents

1 Abstract ……………………………………………………………………………………………………7

1.2 Introduction ….…………………………………………………………….……………….7

1.3 Objectives ………………………………………………………………..………………….8

1.4 Definition ………………………………………………………………………….…………8

1.5 Compare Transportation Problem And Assignment Problem …………….9

2 Materials and Methods.……………………………………………………………………………9

2.1 Basic Variants of the Deterministic Assignment Problem ..…………………10

2.2 Mathematical Formulation of the Assignment Problem.………………10

2.3 Types of Assignment Problem ……………………………………………………………..11

 2.4 Application of Assignment Problem ……………………………………………….11

3. Hungarian Method for Solving Assignment Problem …………………………….12

3.1 The Hungarian method can be following steps …………………………..12

4. Examples ……….…………………………………………………………………………………….13

5. Conclusion …………………………………………………………………………………………..19

6. Reference ……………………………………………………………………………………………20
Abstract

This paper presents a review pertaining to assignment problem within the education domain,
besides looking into the applications of the present research trend, developments, and publications.
Assignment problem arises in diverse situations, where one needs to determine an optimal way to
assign n subjects to m subjects in the best possible way. With that, this paper classified assignment
problems into two, which are timetabling problem and allocation problem. The timetabling
problem is further classified into examination, course, and school timetabling problems, while the
allocation problem is divided into student-project allocation, new student allocation, and space
allocation problems. Furthermore, the constraints, which are of hard and soft constraints, involved
in the said problems are briefly elaborated. In addition, this paper presents various approaches to
address various types of assignment problem. Moreover, direction and potential paths of problem
solving based on the latest trend of approaches are also highlighted. As such, this review
summarizes and records a comprehensive survey regarding assignment problem within education
domain, which enhances one’s understanding concerning the varied types of assignment problems,
along with various approaches that serve as solution.

Introduction
In earlier discussion, we have dealt with two types of linear programming problems, i.e. Resource
allocation method and Transportation model . We have seen that seen that though we can use
simplex method for solving transportation algorithm for simplicity . we have also discussed that
how a resource allocation model differ from transportation model and similarities between
them.

Now we have another model comes under the class of linear programming model, which looks
alike with transportation model with an objective function of minimizing the time or cost of
manufacturing the products by allocating one job to one machine or one machine to one job . this
type of problem is Assignment Model . Basically assignment model is a minimization model . If we
want to maximize the objective function, then there are two methods. The first one being the pay
of matrix for a given problem is a square matrix and the second is the optimum solution for the
problem is such that there can be one and one assignment in a given row or column of the given
payoff matrix. The transportation model is a special case of linear programming model , therefore
it is also a special case of linear programming model.
Objectives
The objective of assignment problem is to assign a number of jobs to an equal number of
machines so as to minimize the total assignment cost or to minimize the total consumed time for
execution of all the jobs. ... The classical assignment problem refers to a special class of linear
programming problems. 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 model's primary usefulness is for
planning. The assignment problem also encompasses an important sub-class of so-called shortest-
(or longest-) route models. The assignment model is 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.

Definition
It involves assignment of people to projects, jobs to machines , workers to jobs and teachers to
classes etc., while minimizing the total assignment costs .One of the important characteristics
of assignment problem is the only one job is assigned to one machine .An assignment problem is a
special type of linear programming problem where the objectives is to minimize the cost pr time
of completing a number of jobs by a number of persons .

Compare transportation problem and Assignment

problem

Assignment Problem Transportation Problem

(i) Assignment means allocating (i) A transportation problem is concerned
various jobs to various people in the with transportation method or selecting routes
organization. Assignment should be in a product distribution network among the
done in such a way that the overall manufacture plant and distribution warehouse
processing time is less, overall efficiency situated in different regions or local outlets.
 is high, overall productivity is high, etc
(ii) We solve an assignment problem
(ii) We use three methods for solving a transportation
by using two methods.
problem i.e., to find IBFS :

(a) Completer enumeration

(a) VAM (b) NWCR (c) LCM
method.
Thereafter we find the optimum solution by using the MODI
(b) Hungarian method
method.
(iii) In an assignment problem only one (iii) A transportation problem is not subject
allocation can be made in particular row to any such restrictions. Such restriction are
or a column peculiar to assignment problems only. Many
allocations can be done in a particular row or
particular column.
(iv) In assignment problem (iv) In transportation method, management
management aims at assignment jobs to is searching for a distribution route, which can
various people. lead to minimization of cost and maximization
of profit
(v) When no. of jobs no. of workers, it (v) When the total demand is not equal to
is a unbalanced problem. total supply it is unbalanced problem.

Materials and Methods

Basic Variants of the Deterministic Assignment Problem

Suppose there are n jobs to be performed and n persons are available for doing these jobs.
Assume that each person can do each job at a term, though with varying degree of efficiency, let
cij be the cost if the I-th person is assigned to the j-th job. The problem is to find an assignment
(which job should be assigned to which person one on-one basis) So that the total cost of
performing all jobs is minimum, problem of this kind are known as assignment problem.

The assignment problem can be stated in the form of n x n cost matrix C real members as given
in the following table:

Jobs

Persons 1 2 ........................ N

1 c11 c12 ....................... c1n

2 c21 c22 ....................... c2n

3 c31 c32 ....................... c3n

. . . ....................... .....
 . . . ....................... .....

n cn1 cn2 ....................... cnn

Mathematical Formulation of the Assignment Problem:

There are numerous variants of AP. The firstone (AP–1a) maximizes the total efficiency of the
assignment. Additionally, to accomplish all the tasks, it is required to assign exactly one agent to
each job and exclusively one task to each worker (any agent can be assigned to perform any job,
one at a time). The model for AP-1a is presented below:

Types of Assignment Problem:

1) BALANCED ASSIGNMENT PROBLEM

2) UNBALANCED ASSIGNMENT PROBLEM

The assignment problem is classified into balanced assignment problem and unbalanced
assignment problem. If the number of rows is equal to the number of columns, then the problem
is termed as a balanced assignment problem otherwise unbalance problem.
Application Areas of Assignment Problem

• Though assignment problem finds applicability in various diverse business situation , we discuss
some of its main application areas:

• In assignment machines to factory orders.

• In assignment sales/marketing people to sales territories.

• In assignment contracts to bidders by systematic bid-evaluation.

• In assignment teachers to classes.

• In assignment accountants to accounts of the clients etc,.

Hungarian Method for Solving Assignment Problem:

The Hungarian method of assignment provides us with an efficient method of finding the optimal
solution without having to make a-direct comparison of every solution. It works on the principle
of reducing the given cost matrix to a matrix of opportunity costs.

Opportunity cost show the relative penalties associated with assigning resources to an activity as
opposed to making the best or least cost assignment. If we can reduce the cost matrix to the
extent of having at least one zero in each row and column, it will be possible to make optimal
assignment.

The Hungarian method can be summarized in the following steps:

Step 1: Develop the Cost Table from the given Problem:

If the no of rows are not equal to the no of columns and vice versa, a dummy row or dummy
column must be added. The assignment cost for dummy cells are always zero.

Step 2: Find the Opportunity Cost Table:

(a) Locate the smallest

element in each row of the given cost table and then subtract that from each element of that row.

(b) (b) In the reduced

matrix obtained from 2 (a) locate the smallest element in each column and then subtract that
from each element. Each row and column now have at least .
Step 3: Make Assignment in the Opportunity Cost Matrix:

(a) Examine rows successively until a row with exactly one unmarked zero is obtained. Make an
assignment single zero by making a square around it.

(b) For each zero value that becomes assigned, eliminate (Strike off) all other zeros in the same
row and/ or column

(c) Repeat step 3 (a) and 3 (b) for each column also with exactly single zero value all that has not
been assigned.

(d) If a row and/or column has two or more unmarked zeros and one cannot be chosen by
inspection, then choose the assigned zero cell arbitrarily.

(e) Continue this process until all zeros in row column are either enclosed (Assigned) or struck off
(x).

Step 4: Optimality Criterion:

If the member of assigned cells is equal to the numbers of rows column then it is optimal solution.
The total cost associated with this solution is obtained by adding original cost figures in the
occupied cells.

If a zero cell was chosen arbitrarily in step (3), there exists an alternative optimal solution. But if
no optimal solution is found, then go to step (5).

Step 5: Revise the Opportunity Cost Table:

Draw a set of horizontal and vertical lines to cover all the zeros in the revised cost table obtained
from step (3), by using the following procedure:

(a) For each row in which no assignment was made, mark a tick (√)

(b) Examine the marked rows. If any zero occurs in those columns, tick the respective rows that
contain those assigned zeros.

(c) Repeat this process until no more rows or columns can be marked.

(d) Draw a straight line through each marked column and each unmarked row.

If a no of lines drawn is equal to the no of (or columns) the current solution is the optimal
solution, otherwise go to step 6.

Step 6: Develop the New Revised Opportunity Cost Table:

(a) From among the cells not covered by any line, choose the smallest element, call this value K
(b) Subtract K from every element in the cell not covered by line.
(c) Add K to very element in the cell covered by the two lines, i.e., intersection of two lines.
(d) Elements in cells covered by one line remain unchanged.
Step 7: Repeat Step 3 to 6 Unlit an Optimal Solution is Obtained:

Example:

1. In a computer centre after studying carefully the three expert programmes , the head of
computer centre, estimates the computer time in minutes required by the experts for the
application programmes as follows:

Assign the programmers to the programmes in such a way that the total computer time is
minimum

Solution:
The Hungarian method is used to obtain an optimal solution.
Step (1) & (2):
The minimum time element in row 1, 2 and 3 is 80, 80 and 110. resp. Subtract these
elements from all elements in this respective row.

The reduced time matrix is shown in following table (1) Table

Step 3 (a):

Examine all the rows starting from first one- until a row containing only single zero element is
located, Here, rows 1 and 3 have only one zero in the cells (1, C) and (3,A) resp, we assigned these
zeros. All zeros in the assigned column are crossed off as shown in table 3.

(b) We now examine each column starting from A in table 3, There is one zero in column B in the
cell (2, (B) Assign this cell as shown in table 4.
(c) Since the no of Assignments (= 3) equal the no of rows (= 3), the optimal solution is obtained.

The pattern of assignment among programmers and programmes with their respective line (in
minutes) is given below.
Variations of the Assignment Problems:
Unbalanced Assignment Problem:

Any assignment problem is said to be unbalanced if the cost matrix is not a square matrix, i.e. the
no of rows and the no of columns are not equal. To make it balanced we add a dummy row or
dummy column with all the entries is zero.

Example 2:
There are four jobs to be assigned to the machines. Only one job could be assigned to one
machine are given in following matrix.

Find an optimum assignment of jobs to the machines to minimize the total processing time and
also find for which machine no job is assigned. What is the total processing time to complete all
the jobs .

Solution:
Since the cost matrix is not a square matrix the problem is unbalanced. We add a dummy job 5
with corresponding entries zero. Modified matrix.

Step 1 & 2:
We subtract the smallest element from all the elements in the respective row and column.

Step 3 & 4:
Now we give the zero assignment in our usual manners & get the following matrix.

But the solution is not optimal because only four assignments are made
Step 5:
In this step we draw minimum no. of lines to cover all zeros.
The no of lines to cover all zeros = 4 < the order of matrix. We form the 2nd modified matrix by
subtracting the smallest uncovered element (i) from the remaining uncovered elements and add
to the element at the point of intersection of lines.

Step 6:

Again Repeat step (3) & (4) and find following matrix.

Here total no of assignment (= 5) which is equal to no of rows or no of columns. Then this is

optimal solution.

The pattern of assignment is given below:

For machines E no job is assigned, optimum (minimum)

Cost = 10 + 3 + 6 + 1

= Rs.20
Conclusion:

The assignment problem is a combinatorial optimization problem that is flexible as it can be used
as an approach to model any real-world problem. In fact, several components in assignment
problem have been explored, for example, the constraints and solution methodology used within
the education domain. this paper provides several solution approaches in solving assignment
problem, where various approaches were introduced in solving these types of problems.
Moreover, it is very important to choose the right approaches in solving the problem so as to obtain
an optimal or near optimal solution depending on the complexity of the problem. Based on past
literature that had been reviewed, were the top trend to solve the assignment problem because
these approaches produced good, but not certainly optimal solution. It was also found that
numerous proposed approaches that have been discussed are significant to be used and have been
adapted in some real-world situations. The assignment problem will remain an endless puzzle in
the future as its flexibility in diverse applications that can be applied into real-world situations.

REFERENCE

Bufardi , A (2008). On the efficiency of feasible solutions of a multicriteria assignment problem. J.

Operational Research. 2 (27): 2528.

Charnes , A; Cooper, W W; Neihaus, R J; Stedry, A (1969). Static and dynamic assignment models
with multiples objectives and some remarks on organization design. J. Management Science. 15
(8): 365- 375.

Kuhn, H W (2005). The Hungarian method for the assignment problem. Naval Research Logistic
Quarterly. 52 (1): 7-21.

Lee, S M; Schniederjans, M J (1995). A multicriteria assignment problem: a goal programming

approach. J. Socio-Economic Planning Sciences. 29 (3): 245-256. Malhotra, R; Bhatia, M L; Puri, M
C (1982). Bicriteria assignment problem. J. Opsearch. 19 (2): 84-96.

Mazzola, J B; Neebe, A W (1986). Resourceconstrained assignment scheduling. J. Operations

Research. 34 (4): 560-572.

Pentico, D W (2007). Assignment problems: A golden anniversary survey. European J. Operations

Research. 176 (2): 774-793.
Sonia, P M C (2008). Two-Stage Time Minimizing Assignment Problem. Omega articles on
Manufacturing magazines. 36 (5): 730-740.

Taha , H A (2002). Operations Research: An Introduction, Seventh Edition, Thomson Press (1) Ltd,
India. pp: 196 -203.