DECISION SCIENCE (204)

CHAPTER 1:

ASSIGNMENT MODELS,

TRANSPORTATION MODELS
 CHAPTER 1:

PART 1:

ASSIGNMENT MODELS
 APPLICATION:
It is a typical optimization technique
practically useful in a situation where a
certain no. of tasks are required to be
assigned to an equal no. of facilities, on
a one to one basis, so that the resultant
effectiveness is optimized. E.g.

1) Jobs to be assigned to machines

2) salesmen to the sales territories
3) vehicles to routes etc.
 Hungarian method of solution
Numerical 1: Consider a job which requires four
activities cutting, assembly, finishing, packaging.
Four workers are employed who can do all these
activities. The time required by each of them (in
min.) to perform each of the activities is as follows:
Workers
Activiti 1 2 3 4
es
C 14 12 15 15
A 21 18 18 22
F 14 17 12 14
P 6 5 3 6

How should these activities be assigned to the workers so

that the job is completed in min. time?
 Answer:
Activitie Worker Time
s s (Min.)
C 1 14
A 2 18
F 4 14
P 3 3
Total Time 49

 Answer = 49 Rs.
Numerical 1: Consider a job production unit has
four jobs A,B,C,D which can be manufactured on
each of the four machines. The processing cost of
each job for each machine is given. Four workers
are employed who can do all these activities. The
time required by each of them (in min.) to perform
each of the activities is as follows:
MACHINES
JOBS P Q R S

A 31 25 33 25
B 25 24 23 21
C 19 21 23 24
D 38 36 34 40

How should these jobs be assigned to the

machines so as to minimize the processing cost?
 Answer:
Processin
Machin
Jobs g Cost
e
(Rs.)
A Q 25
B S 21
C P 19
D R 34
Total Processing
99 Rs.
Cost
 Answer = 99 Rs.
 Solve the following assignment problem
for minimization:
WORKERS
1 2 3 4 5
A 8 8 8 11 12

ACTIVITI
B 4 5 6 3 4
ES
C 12 11 10 9 8

D 18 21 18 17 15

E 10 11 10 8 12
 Answer:
Assignment
Activitie Worker Time
s s (Min.)
A 2 8
B 1 4
C 3 10
D 5 15
E 4 8
Total Time
45
(Minimum)

 Answer = 45
 Special cases in Assignment
1)problem
Unbalanced Problem:- The no. of
rows are not equal to no. of columns.
Example:- The personal manager of ABC co.
wants to assign Mr. X,Y,Z to the regional
offices for which the costs are given. But the
firm also has the opening in its Chennai
office & would send one of them to that
branch if it is more economical than a move
to Delhi, Mumbai or Kolkata. It will cost Rs.
2000/-, to relocate Mr. X to Chennai, Rs.
1600/- to relocate Mr. Y there & Rs. 3000 to
relocate Mr. Z. What is the optimum
assignment of personnel to the offices?
 Office
Mumbai K
Personnel Delhi (D)
(M) (Kolkata)

X 1600 2000 2400

Y 1000 3200 2600

Z 1000 2000 4600

 Answer:

Assignment
Cost
Personnel Office
(Rs.)
X Mumbai 2000
Y Chennai 1600
Z Delhi 1000
Dummy Kolkata 0000
Total Cost (Minimum) 4600

 Answer = 4600 Rs.

2. Multiple Optimum Solution:-
If after making the assignments (i.e.
after marking the zeroes with ) to the
single unmarked zeroes in all possible
rows & columns, it is found that two or
more rows or columns still contain
more than one unmarked zeroes , then
the problem has multiple optimum
solution.
 Example:- Solve the following
problem of assigning 4 computer
programmers to 4 application
programmes, where the estimated
computer time in minutes required by
each of the programmers to develop
the programmes isProgrammers
given
Programm
1 2 3 4
e
A 120 100 80 90
B 80 90 110 70
C 110 140 120 100
D 90 90 80 90
 Answer:

Assignment Assignment
Program Programm Time Program Programm Time
me er (Min.) me er (Min.)
A 3 80 A 3 80
B 1 80 B 4 70
C 4 100 C 1 110
D 2 90 D 2 90
Total Time Total Time
350 350
(Minimum) (Minimum)

 Answer = 350 Min.

3. Maximisation Problems:-
Example:- Solve the following T.P. for
maximising the production output. The data
refers to the production of an article for the
given operators & machines in a given time.
Machines
Operato
A B C D
rs
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
 Procedure to solve maximization
problems:

1) Convert the given matrix into a

relative loss matrix ( or opportunity
loss matrix) by subtracting all its
elements from the largest element
in it(including itself).
2) Solve further using Hungarian Method
to get the optimal assignments.
3) To find total maximum profit, consider
the original profit elements for the
respective assignments.
 Answer:
Assignment
Operator Machine Producti
s s on
1 A 10
2 D 10
3 C 9
4 Dummy 0
5 B 9
Total Max.
38
Production

 Answer = 38 Articles
4. Prohibited Assignments:-

 For a minimization problem we

assume a very high cost (+∞) for
prohibited position & proceed further
as usual.

 For a maximization problem we

assume a very low profit (-∞) for the
prohibited position & proceed further as
usual.
 Example:- Consider a task of assigning
4 clerks to 4 tasks. The time required
(in hrs.) to complete the task is given.
Find the optimum assignment schedule.
Tasks
Clerk A B C D
1 4 7 8 6
2 ----- 8 7 4
3 3 ---- 8 3
4 6 6 4 2
 Answer:
Assignment
Time
Clerk Tasks
(Hrs.)
1 B 7
2 D 4
3 A 3
4 C 4
Total Time (Hrs.) 18

 Answer = 18 Hrs.
 CHAPTER 1

PART 2

TRANSPORTATION MODELS
 TRANSPORTATION PROBLEMS
1) NWCM (North West Corner Method)
2) LCM (Least Cost Method)
3) VAM (Vogel’s approximation method)

Note:
Production Units
Warehouses
 Example: Solve the following
transportation problem using North
West Corner Method (NWCM)
Suppl
W1 W2 W3 W4
y

P1 190 300 500 100 70

P2 700 300 400 600 90

P3 400 100 400 200 180

Deman
d 50 80 70 140 340
 Example: Solve the following
transportation problem using Least
Cost Method (LCM) method
Suppl
W1 W2 W3 W4
y

P1 190 300 500 100 70

P2 700 300 400 600 90

P3 400 100 400 200 180

Deman
d 50 80 70 140 340
 Example: Solve the following
transportation problem using Vogel’s
Approximation Method (VAM)
Suppl
W1 W2 W3 W4
y

P1 190 300 500 100 70

P2 700 300 400 600 90

P3 400 100 400 200 180

Deman
d 50 80 70 140 340
 Practice sums
Calculate the total transportation cost in
following example using NWCM, LCM,
VAM. (8200, 6100, 6100)
Suppl
1 2 3
y
X 10 3 9 400

Y 12 10 5 300

Z 8 11 12 300

Dema
200 300 500
nd
 MODI (Modified distribution
method) or UV method

Its a Method for finding optimum solution.

Steps:-
1) Determine the initial basic feasible solution & verify
that it is feasible. i.e. it has (m+n-1) occupied cells.
2) Determine the row numbers (denoted as u1, u2, u3
etc.) & the column numbers (denoted as v1, v2, v3
etc.) using the formula Cij=Ui+Vj for each occupied
cell (Cij is the corresponding per unit transportation
cost). Choose here one of the values of Ui or Vj as 0
arbitrarily (prefer that row or column which contains
max. no. of occupied cells.) & then use the formula
to find out the remaining values.
3) Consider unoccupied cells & find the opportunity cost
(improvement index) for each of them by using the
formula,
Opportunity cost ∆(ij) = Cij-(Ui+Vj) for these cells.
4) Check the sign of all opportunity costs. If all of them
are non-negative (0 or +ve) then it implies that the
solution obtained is optimum. If at least one of the
opportunity costs is –ve, it implies that solution is not
optimum & there is further scope of improvement &
then go to step 5.
5) Select the unoccupied cell with highest –ve
opportunity cost. (If there are more than one such
cells then select the cell where more no. of units can
be shifted, as described in further steps)
6) For this cell, trace a closed path using most direct
route through at least 3 occupied cells & then back to
the unoccupied cell. Use only vertical & horizontal
lines & take turns only at occupied cells.
7) Assign (+ve) & negative (-ve) sign
alternately to each of the corner cells
along the closed path, starting with a
+ve sign for the selected unoccupied
cell.
8) Find the maximum no. of units to be
shifted to this unoccupied cell. ( These
are equal to the least
of the no. of units in the cells with (-ve)
signs ).
Add this no. of units to the cells with
(+ve) sign & subtract it from the cells
with (-ve) sign along the closed path.
 Special cases in Transportation

1) Unbalanced problem:
Total supply is not equal to total demand.
If, Total demand > total supply, add a dummy
row or source with its supply equal to the
difference between total demand & total supply.
If, Total supply > total demand, add a dummy
column or destination with its demand equal to
the difference between total supply & total
demand.
Consider the per unit transportation cost for
all its cells as zero.
Solve further the problem as an usual
balanced transportation problem.
 Example: Four petrol dealers A,B,C & D require
50,40,60 & 40 Kl of petrol respectively. It is possible
to supply this from three locations X,Y & Z which
have 80,100 & 50 Kl respectively. The cost in Rs. For
shipping each Kl is shown in the table below.

Dealers
Locatio
A B C D
n
X 7 6 6 6
Y 5 7 6 7
Z 8 5 8 6
Determine the most economical supply pattern for the
company.
 Dealers
Locatio Supp
A B C D
n ly
X 7 6 6 6 80
Y 5 7 6 7 100
Z 8 5 8 6 50
Demand 50 40 60 40
 4. Maximisation problemns
1) Add a dummy source or destination to
it if necessary.
2) Locate the largest per unit
transportation cost in the table &
subtract all profit figures (including
itself) from it.
3) Solve it further as a normal TP.
 Solve the following T.P. to Maximise
profit. Destination

Origin 1 2 3 4 Supply

A 40 25 22 33 100
B 44 35 30 30 30
C 38 38 28 33 70
Deman
40 20 60 30
d

 Answer: A1 – 20, A4- 30, A5 – 50, B1 –

20, B3 - 10, C2 – 20, C3 - 50
5. Prohibited routes
 For a Minimization problem we assume
a very high unit cost (+∞) for prohibited
cell & solve further as usual.
 For a Maximization problem we assume
a very low profit (-∞) for prohibited cell
& solve further as usual.
Example:- Solve the following T.P.
Availabilit
X Y Z
y
A 9 ---- 5 45
B ----- 7 6 35
Requireme