PREMIER UNIVERSITY, CHITTAGONG.

FACULTY OF BUSINESS STUDIES.

Course Title : Operation Research

Assignment On : Assignment Problem

SUBMITTED TO:
Mr. Touhidul Islam
Lecturer,
Premier University, Chittagong.

SUBMITTED BY:

Sl Name: ID:
0 Mithila Afrin 1503210108660
1
0 Samia Farha 1503210108667
2
0 Ablin Hoq 1503210108664
3
0 Umme Haney Mishaka 1503210108707
4
0 Ami Chakma 1402810106823
5

Batch : 32nd
Program : BBA
Semester : 5th
Section :B
Submission Date : 02/07/2018
Assignment Problem

Question 1: A manager has four workers.A,B,C and D

who are to be assign jobs 1,2,3, and 4 .The alternative
and estimated jobs compliation cost are given below:
A B C D
1 $15 $20 $18 $24
2 $12 $17 $16 $15
3 $14 $15 $19 $17
4 $11 $14 $12 $13
Solution:
Row reduction : Original Cost:
Employee

Job A B C D Row
Minimum
1 15 20 18 24 15
2 12 17 16 15 12
3 14 15 19 17 14
4 11 14 12 13 11

Cost after row reduction:

Employee
Job A B C D
1 0 5 3 9
2 0 5 4 3
3 0 1 5 3
4 0 3 1 2
Column Reduction of opportunity costs revised
(row reduction) cost:
Employee

Job A B C D
1 0 5 3 9
2 0 5 4 3
3 0 1 5 3
4 0 3 1 2
Column 0 1 1 2
minimum
Column Reduction:
Employee

Job A B C D
1 0 4 2 7
2 0 4 3 1
3 0 0 4 1
4 0 2 0 0
Determine the minimum number of liner
needed to cover the zeros:
Employee

Job A B C D

1 0 4 2 7
2 0 4 3 1

3 0 0 4 1

4 0 2 0 0

1 is the smallest uncovered cost

Further Revision of the cost table revised cost:

Employee
Job A B C D
 1 0 3 1 6

2 0 3 2 0

3 1 0 4 1

4 1 2 0 0

Optimal Assignment:
Assignment Cost
1. A 15
2. B 15
3. C 15
4. D 12
Total cost $57
Problem 2 :
The following table contains processing cost 2 job’s
on various machines each job must be procied one
machine determine asset of baring that will
minimize total proceeding cost.

Jobs
Machine 1 2
A 8 7
B 5 4
C 3 1

Solution :
Assignment technique required square tables . There are
3 machine & only 2 job’s so a third (dummy) job must be
added resulting in this table.

Jobs
Machine 1 2 3
A 8 7 0
 B 5 4 0

C 3 1 0

Smallest value in each row is zero. Consiquently a

row reduction will result in the same value. There
fore we move to the next step which is a column
reduction.

Job

Machine 1 2 3 Column
reduction
A 8 7 0 3
B 5 4 0 1

C 3 1 0 0

Cost after column reduction

 Job

Machine 1 2 3
A 5 6 0
B 2 3 0
C 0 0 0

Determining minimum no. of line require to cover

the zeros:
Job

Machine 1 2 3
A 5 6 0
B 2 3 0
C 0 0 0
2 is the smallest value.
Further revision of the cost table.
 Jobs

Machine 1 2 3
A 3 4 0
B 0 1 0
C 0 0 0

Optimal Assignment:
Assignment Cost
A.3 0
B. 1 5
C. 2 1

Total cost $6
problem- 3
There are five registrations centers 5 persons are
available for service
 Person
center A B C D E
1 30 37 40 28 40
2 40 24 27 21 36
3 40 32 33 30 35
4 25 38 40 36 36
5 29 62 41 34 39

How should the centers be assigned to person so as to

maximize the profit.

Solution:
Identify the highest value and substract each value from
highest value we get,

Person
center A B C D E
1 32 25 22 34 22
2 22 28 35 41 26
 3 22 30 29 32 27
4 27 24 22 26 27
5 33 0 21 28 23

Row reduction :
Person
center A B C D E Row
Minimum
1 32 25 22 34 22 22
2 22 38 35 41 26 22
3 22 30 29 32 27 22
4 37 24 22 26 26 22
5 33 0 21 28 23 0
Value after Row reduction:
Person
center A B C D E Column
minimum
1 10 3 0 8 0 0
2 0 16 13 15 4 0
3 0 8 7 6 5 0
4 15 2 0 0 4 4
5 33 0 21 24 23 0
Column reduction of the value after row reduction

Value after column reduction:

Person
Center A B C D E
1 10 3 0 8 0
2 0 16 13 15 4
3 0 8 7 6 5
4 15 2 0 0 4
5 33 0 21 24 23
Determining the minimum no. of line needed to cover
the zeros
Person
Center A B C D E
1 10 3 0 8 0
2 0 16 13 15 4
3 0 8 7 6 5
4 15 2 0 0 4
5 33 0 21 24 23

Further revision of the table

person
 Center A B C D E
1 14 3 0 8 0
2 0 12 9 11 0
3 0 4 3 2 1
4 19 2 0 0 4
5 37 0 21 24 23

Optimal Assignment :
Assignment Value
1–C 40
2–E 36
3–A 40
4–D 36
5–B 62
Total= $214
So, total maximize profit 214 .