• Alternative

• Possibility
• Selection
• Choosing •Nomination
•Preference
•Picking
•Election
•Adoption
 What is decision making….??

Decision Making :
Decision making is the process of making choices by identifying a decision,
gathering information, and assessing alternative resolutions.
Course : Decision Science
Course Code GC05202
Credits-2
Marks-50
Course Outcome:
•CO.GC05C202.1: (Remember) Define the terms associated with quantitative techniques.
•CO.GC05C202.2: (Understand) Summarize the terms associated with quantitative techniques.
•CO. GC05C202.3: (Apply) Choose appropriate quantitative techniques in problem solving for a
given business scenario.
•CO. GC05C202.4: (Analyse): Infer optimum solution for a given set of data
•CO. GC05C202.5: (Evaluate) Justify a solution considering different aspects of a given business
problem.
•CO. GC05C202.6: (Create) Solve a business problem using decision making techniques..
What is Decision Science?
Decision Science : is the application that uses
scientific approach and solves the management
problems. It also helps managers to make best
decisions.
The RIGHT way is Decision Sciences……..

Decision :
Meaning 1: a conclusion or resolution reached after consideration.
Meaning 2: the action or process of deciding something or of resolving a question.
Science :
Meaning 1 : the intellectual and practical activity encompassing the systematic study
of the structure and behaviour of the physical and natural world through observation
and experiment.
Meaning 2 : a systematically organized body of knowledge on a particular subject.
Various Techniques To Learn:

• Assignment Problems
• Transportation Models
• Decision Theory
• Game Theory
• Queuing Theory
• CPM PERT
• Sequencing Problem
Assignment Problems
in QT: A
Comprehensive Guide
Welcome to this presentation on assignment problems in QT, a
fundamental concept in optimization with applications across
various domains. We will explore key aspects of these problems,
from their formulation to algorithms and real-world applications.

NJ
by Nitin Joshi
Introduction to Assignment Problems
Definition Key Features

Assignment problems involve allocating resources, They involve a finite set of resources and activities,
such as workers, tasks, or machines, to different each with associated costs or benefits. The objective is
activities, aiming to minimize cost or maximize to find the most efficient allocation of resources to
efficiency. The goal is to create the optimal one-to-one activities, resulting in the lowest total cost or highest
mapping between resources and activities. total benefit.
Formulation and Representation
Matrix Representation Mathematical Model Example
Assignment problems can be A mathematical model can be Consider assigning workers to
represented using a cost matrix, formulated to represent the tasks, where each worker has a
where rows represent resources assignment problem, using different cost for each task. The
and columns represent activities, decision variables, objective objective is to find the assignment
and each cell contains the cost of function, and constraints to define that minimizes the total cost of
assigning a specific resource to an the optimal solution. assigning all workers.
activity.
Matching Algorithms for Assignment Problem
1 Hungarian Algorithm 2 Kuhn-Munkres Algorithm 3 Hopcroft-Karp Algorithm
The Hungarian Algorithm is a The Kuhn-Munkres Algorithm is The Hopcroft-Karp Algorithm is
classic and widely used another popular algorithm for a more sophisticated algorithm
algorithm for solving solving assignment problems. It that solves the assignment
assignment problems. It finds uses a similar approach to the problem with a faster running
the optimal assignment in Hungarian Algorithm and is time, particularly for dense
polynomial time, making it often referred to as the graphs. It finds maximum
efficient for large datasets. Hungarian Algorithm. matching in bipartite graphs.
The Hungarian Algorithm
Step 1
1
Reduce the cost matrix by subtracting the smallest element in each row from all elements in that row.

Step 2
2 Further reduce the cost matrix by subtracting the smallest element in each column from all elements in
that column.

Step 3
3 Cover all zeros in the reduced cost matrix with the minimum number of lines. If the
number of lines is equal to the number of rows (or columns), an optimal assignment has
been found.

Step 4
If the number of lines is less than the number of rows (or columns),
4 find the smallest uncovered element. Subtract this element from all
uncovered elements and add it to the elements covered by two lines.
Repeat steps 3 and 4 until an optimal assignment is found.
Applications of Assignment Problems

1 2
Resource Allocation Machine Scheduling
Assigning workers to tasks to minimize the total cost or maximize the total Assigning machines to jobs, considering factors like machine capacity and
efficiency. job processing time.

3 4
Transportation Project Management
Assigning trucks to delivery routes to minimize the total distance traveled Assigning team members to project tasks based on their skills and experience.
or delivery time.
 Types of Assignment
Problem
1)Balanced
2)Unbalanced
3)Maximisation
4)Multiple Optimal Assignment
5)Restricted
6)Travelling Salesman Problem
 BALANCED ASSIGNMENT PROBLEM

Example : Four jobs J1, J2, J3 and J4 are to be assigned

to four persons P1, P2, P3 and P4. The processing
costs are given in the following matrix. Find the
optimal assignment which will lower the total
processing cost.
The Cost Matrix is given as under

The Rows represent the

Resources and Column
represent the activities and
each cell denotes the cost
associated with the allocation
of resources to the activity

Let the cost of ith persons assigned to jth jobs be represent by Cij.
Let the number of unites by assignment the persons ith to a jobs jth be
represent by Xij.
Xij = 1 if i person is assigned j job.
Or Xij = 0 if i person is not assigned j job.
The objective function is:
Min Z=
Subject to the constraint
and , =1 and and Xij =1or 0
For all i=1,2,...,n and j =1,2,...,n
Example : Four jobs J1, J2, J3 and J4 are to be assigned
to four persons P1, P2, P3 and P4. The processing
costs are given in the following matrix. Find the
optimal assignment which will lower the total
processing cost.

J1 J2 J3 J4

P1

P2

P3

P4
Steps in Hungarian Method :
Step (1): select the smallest number from each row and subtract it from the other
numbers in the same row as well as for the columns.
Step (2): Draw the minimum number of vertical and horizontal lines to cover all
zeros in all rows and columns in the matrix. Let the minimum number of lines is L
and the number of columns or rows is n.
If L = n, the matrix then an optimal assignment can be find, then proceed to step
(5).
If L < n then proceed to step (3).
Step (3): Determine the smallest number in the matrix, not covered by L lines.
Subtract this minimum number from all uncovered numbers and add the same
number at the intersection of horizontal and vertical lines.
Step (4): Repeat step (2) and step (3) until L = n become.
Step (5): To find assignment by test assigning all the zeroes in the rows and
columns. The solution is optimal when assigning one and only one zero per row and
column in given matrix.
Step (6): Repeat the step (5) until to exactly find one zero to be assignment in each
row (column), then process ends.
Step (7): Write the numbers that corresponding to the zeros assigned in the
previous step in the main matrix and calculate the objective function.
This is Minimisation Assignment
Problem :
First: Solution by Hungarian
method.
Step (1): Row subtraction
Step (1): select the smallest
number from each row and subtract
it from the other numbers in the
same row Column
Step (1):
subtraction
select the smallest number
from each Column and
subtract it from the other
J1 J2 J3 J4
P1
numbers in the same Column
P2
P3
P4
Step (2): Draw the minimum number
of vertical and horizontal lines to
cover all zeros in all rows and columns
in the matrix.

Let the minimum number of lines is L

and the number of columns or rows is
n.

If L = n, the matrix then an optimal

Here L = 3 and n =
assignment can be find, then proceed
to step (5). 4
Hence L # n i.e. 3
If L < n then proceed to step (3). # 4
Step (3): Determine the smallest
number in the matrix, not covered by L
lines. Subtract this minimum number
from all uncovered numbers and add
the same number at the intersection of
horizontal and vertical lines.

L=n
Step (5): To find assignment by
test assigning all the zeroes in the
rows and columns. The solution is
optimal when assigning one and
only one zero per row and column
in given matrix.
Step (7):
So the optimal assignment for all persons to jobs as shown in the
following:
P1 → J1 =8 Total minimum cost is
P2 → J3 =12
P3 → J2 =19 Z= 8 × 1+ 12 × 1+ 19× 1+9× 1 = 48
P4 → J4 =9
Ref: Applied Mathematical Sciences, Vol. 11, 2017, no. 54, 2663 – 2670 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/a
 Unbalanced Assignment Problem

A manager has 4 jobs on hand to be assigned to 3 of his

clerical staff. Clerical staff differs in efficiency. The efficiency is
a measure of time taken by them to do various jobs. The
manager wants
to assign the duty to his staff, so that the total time taken by
the staff should be minimum. The matrix given below shows
the time taken by each person to do a particular job. Help the
manager in assigning the jobs to the personnel.
Jobs Men (Time taken to job in Hrs.)
X Y Z
A 10 27 16
B 14 28 7
C 36 21 16
D 19 31 21
The given matrix is unbalanced. To balance the matrix, open a dummy column with time
coefficients as zero. (DC = Dummy column).
Add an Dummy column as rows and column are not equal

Men (Time taken to job Now Row Subtraction will

Jobs in Hrs.)
X Y Z DC remain as it is . So just carry out
A 10 27 16 0 Column Subtraction
B 14 28 7 0
C 36 21 16 0
D 19 31 21 0

Men (Time taken to job in The assignment is: A to X, B to Z,

Jobs Hrs.)
DC and C to Y and D is not assigned.​
X Y Z
A 0 6 9 0 Total time required is:
B 4 7 0 0 10 + 7 + 21 = 38 Hours.​
C 26 0 9 0
D 9 10 14 0
 Maximisation Problem

For maximization same procedure is adopted, once we convert the

maximization problem into minimization problem by multiplying the
matrix by (-1) or by subtracting all the elements of the matrix from
highest element in the matrix. Once we do this, the entries in the matrix
gives us relative costs, hence the problem becomes minimisation
problem.

Example : A company has five jobs V, W, X, Y and Z and five machines A,

B, C, D and E. The given matrix shows the return in Rs. of assigning a job
to a machine. Assign the jobs to machines for maximizing the total
returns.
 Jobs A B C D E

V 5 11 10 12 4
W 2 4 6 3 5
X 3 12 5 14 6
Y 6 14 4 11 7
Z 7 9 8 12 5

As the objective function is to maximize the returns, we must convert the given
problem into minimization problem.
Method: Here highest element in the matrix is 14, hence subtract all the
element form 14 and write the relative costs. (Transformed matrix).
Jobs A B C D E
V 9 3 4 2 10
W 12 10 8 11 9
X 11 2 9 0 8
Y 8 0 10 3 7
Z 7 5 6 2 9
Jobs A B C D E Jobs A B C D E
Row reduction
V 9 3 4 2 10 V 7 1 2 0 8
W 12 10 8 11 9 W 4 2 0 3 1
X 11 2 9 0 8 X 11 2 9 0 8
Y 8 0 10 3 7 Y 8 0 10 3 7
Z 7 5 6 2 9 Z 5 3 4 0 7
Column Reduction

Jobs A B C D E Jobs A B C D E
V 3 1 2 0 7 V 3 1 2 0 7
W 0 2 0 3 0 W 0 2 0 3 0
X 7 2 9 0 7 X 7 2 9 0 7
Y 4 0 10 3 6 Y 4 0 10 3 6
Z 1 3 4 0 6 Z 1 3 4 0 6
Jobs A B C D E Jobs A B C D E
V 3 1 2 0 7 V 2 1 1 0 6
W 0 2 0 3 0 W 0 3 0 4 0
X 7 2 9 0 7 X 6 2 8 0 6
Y 4 0 10 3 6 Y 3 0 9 3 5
Z 1 3 4 0 6 Z 0 3 3 0 5
A company has five jobs V, W, X, Y and Z and five machines A, B, C, D and E. The given
matrix shows the return in Rs. of assigning a job to a machine. Assign the jobs to
machines so as to maximize the total returns.

Jobs A B C D E
V 5 11 10 12 4
W 2 4 6 3 5
X 3 12 5 14 6
Y 6 14 4 11 7
Z 7 9 8 12 5
Maximisation Problem: As the objective function is to maximize the returns, we must convert the given
problem into minimization problem.
Method 1. Here highest element in the matrix is 14, hence subtract all the element form 14 and write the
relative costs. (Transformed matrix).
Jobs A B C D E
V 9 3 4 2 10
W 12 10 8 11 9
X 11 2 9 0 8
Y 8 0 10 3 7
Z 7 5 6 2 9
Jobs A B C D E Row Reduction Matrix

V
7 1 2 0 8
W
4 2 0 3 1
X
11 2 9 0 8
Y
8 0 10 3 7
Z
5 3 4 0 7

Jobs A B C D E Column Reduction Matrix

V 3 1 2 0 7
W 0 2 0 3 0
X 7 2 9 0 7
Y 4 0 10 3 6
Z 1 3 4 0 6
Solution

Job Machine Return in Rs

V C 10
W E 5
X D 14
Y B 14
Z A 7
Total in Rs. 50
 Multiple Assignment Problem

• Four different jobs are to be done

on four machines, one job on Machine Time in Hours
each machine, as set up costs and
times are too high to permit a job Jobs A B C D
being worked on more than one
machine. The matrix given below P 10 14 22 12
gives the times of producing jobs
on different machines. Assign the Q 16 10 18 12
jobs to machine so that total time
of production is minimized. R 8 14 20 14

S 20 8 16 6
 RESTRICTED ASSIGNMENT PROBLEM
In a Modification of a plant layout of a factory four new
machine M1, M2, M3, M4 are to be installed in a machine shop.
There are five vacant places A,B, C,D and E available. Because
of Limited space Machine M2 cannot be placed at C and M3
cannot be placed at A the cost of locating Machine i to place j
in rupees is shown below. Find Optimum assignment schedule
A B C D E
M1 9 11 15 10 11
M2 12 9 ---- 10 9
M3 --- 11 14 11 7
M4 14 8 12 7 8
Conclusion and Q&A
Assignment problems are a powerful tool for optimizing resource
allocation in a variety of situations. We have covered the
fundamental concepts, algorithms, and applications of these
problems, highlighting their importance in both practical and
theoretical contexts. Let's open the floor to any questions you may
have.