Scribd
Upload
8 views21 pages

Assignment Problem

The document discusses the assignment problem, which involves efficiently assigning resources to activities to minimize costs. It covers definitions, properties, and methods like the Hungarian Method, along with examples of balanced and unbalanced assignment problems. Additionally, it presents practical problems related to salesmen assignments and machine placements with proposed solutions.

Uploaded by

Anikk Hassan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
8 views21 pages

Assignment Problem

The document discusses the assignment problem, which involves efficiently assigning resources to activities to minimize costs. It covers definitions, properties, and methods like the Hungarian Method, along with examples of balanced and unbalanced assignment problems. Additionally, it presents practical problems related to salesmen assignments and machine placements with proposed solutions.

Uploaded by

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

Md.

Aktar Kamal
Assistant Professor
( Management)
Areas to be covered
Definition
Properties
Hungarian Method of
Assignment Problem With some
application.
Definition
Assignment problem involves
determining most efficient
assignment of people to projects,
jobs to machines, salespersons to
territories, contracts to bidders
and so on.
Cont.…
The problem of assigning ‘n’
resources to ‘m’ activities in
such a way that only one
resource is assigned to one
activity, every activity has a
recourse assigned to it and the
cast of completing all jobs is
minimized.
Properties
The assignment problem is made
on a one-to-one basis, i,e, each
origin can be associated with one
and only one destination, e.g.,
allocation of n jobs to m persons
and allocation of n projects to m
contractors.
Properties
Matrix formation of an assignment
problem is a square matrix, i,e, no
of rows is equal to the no. of
column. If it is not so add dummy
row or dummy column.
The capacity at each of the
resources and the requirement at
each of the destinations is taken to
be unity
It has an optimal solution
Balance Assignment Problem
An assignment problem in which
the number of activities is exactly
equal to the number to the
resources, in other words the
payoff matrix of an assignment
problem is a square matrix, is
called a balanced assignment
A B C
problem. For Instance,
P 8 5 3
Q 7 4 6
R 4 8 2
Unbalance Assignment Problem
Whenever, the pay off matrix of an
assignment problem is not a square
matrix the assignment problem is
called unbalanced assignment
problem. For Instance
A B C
P 6 7 3
Q 7 9 2
P 7 4 1
S 4 2 6
Problem
A marketing manager has four
salesmen and four areas.
Considering the capabilities of the
salesmen and the nature of areas
the manager estimated the
salaries (in thousand taka per
month) for each salesman in each
area are as follows:
Cont..

A B C D

S1 10 14 15 13
S2 18 19 21 18
S3 6 10 10 9
S4 12 15 17 15
Solution: Row reduction

A B C D

S1 o 4 5 3
S2 0 1 3 0
S3 0 4 4 3
S4 0 3 5 3
Column reduction

A B C D

S1 o 3 2 3
S2 0 0 0 0
S3 0 3 1 3
S4 0 2 2 3
Revised solution

A B C D

S1 o 2 1 2
S2 1 0 0 0
S3 0 2 0 2
S4 0 1 1 2
Again Revised solution

A B C D

S1 o 1 0 1
S2 2 0 0 0
S3 1 2 0 2
S4 0 0 0 1
Optimum solution

Salesme Areas Salaries


n
S1 A 10,000
S2 D 18,000
S3 c 10,000
S4 B 15,000
Total 53,000
Problem-2
Solve the following assignment problem. The
data given in the table refer to production in
certain units:

Machines
Operatio A B C D
ns

1 10 5 7 8
2 11 4 9 10
3 8 4 9 7
4 7 5 6 4
5 8 9 7 5
Problem-3

Four new machines M1, M2, M3 &


M4 are to be installed in a machine
shop. There are five vacant places A,
B, C, D & E available. Because of
limited space machine M2 cannot be
placed at C and M3 cannot be placed
A. The assignment cost (In
thousands) of machine to vacant
places is given below:
Cont.…

A B C D E
M1 4 6 10 5 6
M2 7 4 - 5 4
M3 - 6 7 6 2
M4 9 3 7 2 3
Problem-3
Inn-style department store has 4 sales person
and 3 departments. Since each person has a
different level of experience and ability, each
will generate different sales in each
department. The store manager has estimates
the sales volume that can be expected from
each person in each department are given
below:
Sales Persons Daily sales (in Taka)
Garments Cosmetics Shoes
Taylor 3000 3000 2000
John 6000 6000 -
Nancy 4000 4000 1000
Jem 2000 - 5000

John does not have interest, knowledge on ability to sale shoes. Jem
has always trouble in selling cosmetics, Therefore, the store manager
does not want to assign Jhon to shoes and Jem to cosmetics.
Which sales person should be assigned to which department to
maximize sales?
THANK YOU

You might also like