Management Science

(Operations Research)
Faculty:-

Mr. Ravi Lakhani (Asst. Prof. – SOM)

BE (Elx), MBA (HR), UGC-NET Qualified (Management)
Microsoft (MCSE), Cisco (CCNA) & Compaq (ASE) Certified
Pursuing Ph.D (Management)

JLU – BMS IV (2016-17) : Operations Research ( ~ RL)

JLU – BMS IV (2016-17) : Operations Research ( ~ RL)
Can be solved by complete enumeration
– ruled out since the number of
alternatives is very large (equal to n!)

Can be formulated and solved as a

transportation problem – not efficient
because the solution would be severely
degenerate

Can be formulated and solved an LPP (a

0-1 IPP) – also not an efficient way of
solving the problem

Can be solved by Hungarian Assignment

Method (HAM)

HAM is most efficient of all methods

JLU – BMS IV (2016-17) : Operations Research ( ~ RL)

 Job
Worker Supply
A B C D
1 45 40 51 67 1

2 57 42 63 55 1

3 49 52 48 64 1

4 41 45 60 55 1

Demand 1 1 1 1 4

JLU – BMS IV (2016-17) : Operations Research ( ~ RL)

Step 1
Balance the problem if it is
unbalanced
Place an M as the cost element if
some assignment is prohibited
Convert into equivalent min
problem if it is a max problem
For this conversion, subtract each
value of the matrix from a
constant value, K ( generally the
largest value in the given matrix)
Step 2
Obtain zeros in every row and
column by row reductions and
column reductions
JLU – BMS IV (2016-17) : Operations Research ( ~ RL)
 (…continued)
Step 3
Cover all zeros by least number of
horizontal/ vertical lines
If number of lines = n move to step
4 else, make adjustment: select
least uncovered value; subtract it
from every uncovered value; and
add to each one at intersection of
lines
Again cover zeros with lines to find
if you could go to 4

Step 4
Make assignments by considering
zeros
JLU – BMS IV (2016-17) : Operations Research ( ~ RL)
Select a row/column with a single
zero
Make an assignment at zero by
placing a square around it
Cross out zero/s, if any, in the
corresponding column/row
Continue in this manner until all
assignments are made
If there are multiple zeros left in all
rows and columns, select a zero
arbitrarily, make assignment and
cancel other zeros in the row and
column involved
Multiple zeros in all rows and
columns remaining indicates
multiple optimal solutions
JLU – BMS IV (2016-17) : Operations Research ( ~ RL)
Solve the Problem: Time (in hours)
Job
Person
1 2 3 4 5
A 27 18 X 20 21

B 31 24 21 12 17

C 20 17 20 X 16

D 22 28 20 16 27

X indicates prohibited assignment

To solve this problem:

Balance by adding a dummy
person
Place an M for each prohibited
assignment

JLU – BMS IV (2016-17) : Operations Research ( ~ RL)

 Job
Person
1 2 3 4 5
A 27 18 M 20 21

B 31 24 21 12 17

C 20 17 20 M 16

D 22 28 20 16 27

E 0 0 0 0 0

Row Reductions: RCT-1

Job
Person
1 2 3 4 5
A 9 0 M 2 3

B 19 12 9 0 5

C 4 1 4 M 0

D 6 12 4 0 11

E 0 0 0 0 0
JLU – BMS IV (2016-17) : Operations Research ( ~ RL)
 (…continued)
Number of lines covering zeros (=4)
in RCT-1 is smaller than n (=5)
So, revise the table:(the least
uncovered value = 4)
RCT-2 is the resulting table
In RCT- 2, number of lines covering all
zeros = 5, which is equal to n, so
make assignments
RCT-2
Job
Person
1 2 3 4 5
A 9 0 M 6 3

B 15 18 5 0 1

C 4 1 4 M 0

D 2 8 0 0 7

E 0 0 0 4 0
JLU – BMS IV (2016-17) : Operations Research ( ~ RL)
To make assignments in RCT-2,
Make an assignment at zero by placing a
square around it
Select column 1, assign E-1
Cross out zeros in row E
Select column 2, assign A-2
Select column 3, assign D-3
Select row 2, assign B-4
Cross out zero in column 4
Select row 5, assign C-5

Optimal Assignment Solution:

A-2; B-4; C-5; D-3 and
Job 1: unassigned
Total Time = 66 hours
JLU – BMS IV (2016-17) : Operations Research ( ~ RL)
 An Airline, operating 7 days a week,
has given the following schedule of
it’s flights between New Delhi &
Mumbai. The Crews should have a
minimum 5 hrs. between the flights.
Obtain the pairing of flights that
minimizes layover time away from
home. For any given pairing, the
crew will be based at the city that
results in the smallest layover.
New Delhi – Mumbai Mumbai – New Delhi

Flight No. Dep. Arrival Flight No. Dep. Arrival

101 5 AM 7 AM 201 7 AM 9 AM

102 7 AM 9 AM 202 8 AM 10 AM

103 1 PM 3 PM 203 1 PM 3 PM

104 7 PM 9 PM 204 6 PM 8 PM

JLU – BMS IV (2016-17) : Operations Research ( ~ RL)

 Layover Time Matrix – Crew at New Delhi

Flight 201 202 203 204

101 24 25 6 11

102 22 23 28 9

103 16 17 22 27

104 10 11 16 21

Layover Time Matrix – Crew at Mumbai

Flight 201 202 203 204

101 20 19 14 9

102 22 21 16 11

103 28 27 22 17

104 10 9 28 23

JLU – BMS IV (2016-17) : Operations Research ( ~ RL)

 (…continued)
Layover Time Matrix – Crew at New Delhi / Mumbai

Flight 201 202 203 204

101 20* 19* 6 9*

102 22 21* 16* 9

103 16 17 22 17*

104 10 9* 16 21

(*) indicates that crew is based at Mumbai

Other values indicate crew is based at New Delhi

The above matrix is derived by

comparing various pairs of flights and
taking the lower of the two layover
values involved; since for a given pair
of flights, crew will be based where
the layover time is smaller
JLU – BMS IV (2016-17) : Operations Research ( ~ RL)
 (…continued)

Reduced Cost Table 1

Flight 201 202 203 204

101 14 13 0 3

102 13 12 7 0

103 0 1 6 1

104 1 0 7 12

Optimal Pairing of Flights:

Layover
Flight Flight Crew-Base
Time
101 203 6 New Delhi

102 204 9 New Delhi

103 201 16 New Delhi

104 202 9 Mumbai

JLU – BMS IV (2016-17) : Operations Research ( ~ RL)