Assignment

Objective : To distribute different jobs to different

machines (one job to one machine) so as to
minimize the overall cost (one to one basis).
Definition : To assign each facility to only one job
so as to optimize the given measure of
effectiveness.
Hence assignment models are always square
matrix
1

Steps to solve AP
Prepare the square matrix
Reduce the matrix by subtracting minimum element of a row
with all elements in that row for all rows
Check whether all columns are having atleast one zero, if not
Reduce the matrix further by subtracting minimum element of
a column with all elements in that column for all columns.
Thus IBFS is obtained
Check whether the solution is optimal or not
Optimal solution is arrived when all rows and columns are
assigned with one assignment each
Compute the total cost
2

Problem
A company has 5 jobs (A,B,C,D&E) to be done on five
machines(I,II,III,IV&V). Any job can be done on any
machine. The cost of doing the jobs in different machine are
given below. Assign the jobs for different machines so as to
minimize the total cost.
I

II

III

IV

13

16

18

19

15

24

12

12

12

10

13

15

17

18

20
3

Problem
Four different jobs can be done on four different machines.
The setup and take down time costs are assumed to be high for
changeovers. The matrix below gives the cost in rupees of
proceeding job i on machine j.
M1

M2

M3

M4

J1

11

J2

J3

10

J4

10

Unbalanced & Restriction in AP

The processing time in hours for the jobs (I,II,III,IV&V) when
allocated to different machines (A,B,C&D) are given below.
Allocate the machines for the jobs so that the total processing
time is minimum.
I

II

III

IV

10

Answer
A-I, B-II, C-V, D-IV, E-III
Total: 12 Hrs

Introduction - Travelling salesman problem (TSP)

(Shortest cyclic route models)
To minimize the total cost or distance in starting from one
city and going to several cities and coming back to the same
city while visiting all the cities only once.
Examples
Delivery of courier
Collection of cable TV charge
Visit to all the companies by the owner
Salesman travelling across the country
Assembly line

Travelling salesman problem

(Shortest cyclic route models)
Objective : To find the routes shortest in
distance( time/cost)
Rule :
Starts from his home city, passes through
each city once and only once and returns
to his home city
In general,
For n cities
(n-1)! possible routes
8

Problem
A salesman is planning to tour cities B, C, D and E , starting from his
home city A. The inner-city distances are shown in the following table:
To City

From
City

A
B
C
D
E

4
7
3
4

4
6
3
4

7
6
7
5

3
3
7
7

4
4
5
7
-

How should he plan his tour so that (i) he visits each of the cities only
once, and (ii) travels with minimum cost.
Ans: Optimum route = A-D-B-C-E-A Total cost: Rs. 219

Problem
A salesman is planning to tour cities B, C, D and E , starting from his
home city A. The inner-city distances are shown in the following table:
To City

From
City

A
B
C
D
E

3
6
2
3

3
5
2
3

6
5
6
4

2
2
6
6

3
3
4
6
-

How should he plan his tour so that (i) he visits each of the cities only
once, and (ii) travels with minimum cost.
Ans: Optimum route = A-D-B-C-E-A (or) A-E-C-B-D-A Total
cost: Rs.
10
16