Scribd
Upload
384 views4 pages

Assignment Problem in Operational Research

The document discusses assignment problems in operational research. An assignment problem aims to assign resources like machines or people to activities or jobs to minimize costs or maximize allocation points. It describes the mathematical formulation of assignment problems as linear programs that assign jobs to machines at minimum cost. Key differences from transportation problems are that each machine can only be assigned one job and vice versa. The Hungarian method is presented as the preferred solution approach as it is designed specifically for assignment problems based on opportunity costs.

Uploaded by

Swetha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
384 views4 pages

Assignment Problem in Operational Research

The document discusses assignment problems in operational research. An assignment problem aims to assign resources like machines or people to activities or jobs to minimize costs or maximize allocation points. It describes the mathematical formulation of assignment problems as linear programs that assign jobs to machines at minimum cost. Key differences from transportation problems are that each machine can only be assigned one job and vice versa. The Hungarian method is presented as the preferred solution approach as it is designed specifically for assignment problems based on opportunity costs.

Uploaded by

Swetha
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

UNIT 1

ASSIGNMENT PROBLEM IN OPERATIONAL RESEARCH


Introduction
An assignment problem is a particular case of transportation problem. The objective is to
assign a number of resources to an equal number of activities. So as to minimize total cost or
maximize total point of allocation.
The problem of assignment arises because available resources such as men, machines etc.
have varying degrees of efficiency for performing different activities, therefore, cost, profit or
loss of performing the different activities is different.
Suppose that we have n jobs to be performed on m machines (one job to one machine). Our
objective is to assign the jobs to the machines at the minimum cost (or maximum profit).
Under the assumption that each machine can perform each job but with varying degree of
efficiencies.

Mathematical Statement of Assignment problem

An assignment problem is a special type of linear programming where the objectives is to


minimize the cost or time of completing a number of jobs by a number of persons.
Furthermore, the structure of an assignment problem is identical to that of a transportation
problem.

Mathematical formulation of an assignment problem

Consider an assignment problem of assigning n jobs to n machines (one job to one machine).
Let c ij be the unit cost of assigning i th machine to the j th job and, i th machine to j th job.

Let x ij = 1 , if j th job is assigned to i th machine.


x ij = 0 , if j th job is not assigned to i th machine.

n n
Minimize Z = ∑ ∑ c ij x ij
i=1 j=1
subject to the constraints
n

∑ x ij = 1, j= 1,2,…,n
i=1

∑ x ij = 1, i= 1,2,…,n
j=1
x ij = 0 or 1.

Matrix form of Assignment problem


The assignment problem can be stated that in the form of m×n matrix c ij called a Cost Matrix
(or) Effectiveness Matrix where c ij is the cost of assigning i th machine to j th job.

[ ]
c11 ⋯ c 1n
⋮ ⋱ ⋮
c m 1 ⋯ c mn
Comparison with Transportation problem

S.No Transportation Problem Assignment problem

1 Supply at any source may be any Supply at any source (machine) will be 1.
positive quantity ai. i.e., a i=1.

2 Demand at any destination may be any Demand at any destination (job) will be 1.
positive bj. i.e., b j = 1.

3 One or more source to any number of One source (machine) to only one
destinations. destination (job).

Balanced and Unbalanced Assignment problem

Balanced Assignment Problem

A balanced assignment problem is one where the number of rows = the number of columns
(comparable to a balanced transportation problem where total demand = total supply

Balanced assignment problem: no. of rows = no. of columns

Unbalanced Assignment Problem

Unbalanced assignment problem is one when the number of rows not equal to the number of
columns and vice versa. E.g. The number of machines may be more than the number of jobs
or the number of jobs may be more than the number of machines.
In such a situation we introduce dummy row/column(s) in the matrix. These rows or columns
have a zero cost element. Thus we can balance the problem and then use Hungarian method
to find optimal assignment.

Unbalanced assignment problem: no. of rows not equal to no. of columns

Prohibited Assignment Problem


A usual assignment problem presumes that all jobs can be performed by all individuals there
can be free or unrestricted assignment of jobs and individuals. A prohibited assignment
problem occurs when a machine may not be in, a position to perform a particular job as there
be some technical difficulties in using a certain machine for a certain job. In such cases the
assignment is constrined by given facts.

To solve this type of problem of restriction on job assignment we will have to assign a very
high cost M. This ensures that restricted or impractical combination does not enter the
optimal assignment plan which aims at minimization of total cost.

Solution methods

1. Enumeration method
2. Simple method
3. Transportation method
4. Hungarian method

1. Enumeration method

This method can be used in case of assignment problems of small size. In such cases a
complete enumeration and evalution of all combinations of persons and jobs is possible.

One can select the optimal combination. We may also come across more than one optimal
combination. The number of combinations increases manifold as the size of the problem
increases as the total number of possible combinations depends on the number of say, jobs,
and machines. Hence the use of enumeration method is not feasible in real world cases.

2. Simplex method

The assignment problem can be formulated as a linear programming problem and hence can
be solved by using simplex method. However solving the problem using simplex method can
be a tedious job.

3. Transportation method

The assignment problem is comparable to a transportation problem hence transportation


method of solution can be used to find optimum allocation. However the major problem is
that allocation degenerate as the allocation is on basis one to one per person per person per
job. Hence we need a method specially designed to solve assignment problems.

4. Hungarian method

This method is based on the concept of opportunity cost and is more efficient in solving
assignment problems.

Method in case of a minimization problem

As we are using the concept “opportunity this means that the cost of any opportunity that is
lost while taking a particular decision or action is taken into account while making
assignment. Given below are the steps involved to solve an assignment roblem by using
Hungarian method.

Step 1: Determine the opportunity cost table


Step 2: Determine the possibility of an optimal assignment
Step 3: Modify the second reduced cost table
Step 4: Make the optimum assignment

Step 1:
Determine the opportunity cost table

Locate the smallest cost in each row and subtract it from each cost figure in that row. This

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy