Академический Документы
Профессиональный Документы
Культура Документы
m=n
Consider that we have four jobs and four persons. We want to allot one job
to one person so that the total time taken will be minimum. We shall
formulate a mathematical model for the problem.
Let the decision variable Xij be the assignment of the ith job to the jth person
and Cij be the time taken for ith job by jth person.
The objective function is to minimize
Z
Subject
=
to
Row restrictions:
C ij X ij
restrictions
x41 = 1
for
for
for
for
job
job
job
job
1
2
3
4
for person 1
for person 2
for person 3
for person 4
And xij = 0 or 1
In general:
xi1 + xi2 + xi3 + ..........................+ xin = 1
for
i=1,2,3.............,n
x1j + x2j + x3j + ..........................+ xnj =1 for j=1,2,3.............,n
when compared with a transportation problem, we see that ai =1 and bj =1
for all rows and columns xij =0 or 1
Example 1
A works manager has to allocate 4 different jobs to 4 workmen, depending
on the efficiency and the capacity of the individual. The times taken by each
differ as shown in the following table. How should the tasks be assigned one
job to a worker so as to minimize the total man-hours?
Worker
Job
10
20
18
14
15
25
25
30
19
17
12
19
24
20
10
Solution:
The following steps are followed to find an optimal solution.
Step 1 : Row reduction
Consider each row and select the minimum element in each row.
Subtract this smallest element from all elements in that row. This
results in following table 1:
Table 1
Worker
Job
10
16
16
18
14
10
16
18
10
Worker
Job
18
0
5
10
16
0
0
18
0
7
0
5
10
Example 2:
Worker
A
C
B
D
Time
10
9
19
10
---------The minimum total man-hours =
48
----------
16
0
0
Persons
A
Solution :
Step 1 : Row reduction
Subtract the smallest element of each row from other elements of that
row.
Job
1
Persons
0
4
Persons
0
2
4
0
We get the optimum solution as the number of assignments are 5. The
optimum schedule is:
E
Person
Job
Cost
Example 3
Consider a factory having 4 machines. There are 4 jobs which are to be
loaded in all the 4 machines so that the operating cost is the minimum.
Operating cost matrix is given below in Rs.
M/C
Job
12
15
11
11
16
14
15
12
11
Solution:
Step 1: Row Reduction
M/C
Job
A
0
4
A
0
10
This is the revised effectiveness matrix. Subject the same optimality test
by drawing lines as shown above. Here also we find number of lines N=3
and N<n hence the smallest value of uncovered cell (3,3) =1 is added to
uncovered cells and subtracted from covered cells.
Step 5 Row and Column Assignment
M/C
Job
1
A
0
11
0
0
0
2
Machine
Cost
0
0
15
35
Example 4:
A car hire company has 1 car at each of the 5 depots. A customer in each
of the 5 towns requires a car. The distance between the depots and the
towns where the customers are, is given the following distance matrix.
Depots
Towns
A
160
130
175
190
200
135
120
130
160
175
140
110
155
170
185
50
50
80
80
110
55
35
70
80
105
30
45
60
70
15
10
40
55
30
45
60
75
30
30
60
20
35
45
70
Depot
s
Towns
30
35
30
15
15
10
30
35
30
20
20
20
25
15
15
Depots
Towns
30
35
30
15
15
10
30
35
30
20
20
20
25
15
15
N<n
N=no. of lines = 4
n = no. of depots = 5
Hence assignment is not optimum
Modify the above table by subtracting minimum element 15 from all
uncovered elements and adding to the elements lying at the intersection
of the lines.
Step 4:
Depo
ts
Towns
15
20
15
15
15
10
15
20
15
15
20
10
Here N=n
Hence assignment is optimum
Step 5: Row and Column Assignment
Depot
s
Towns
15
20
15
15
15
10
15
0
20
0
0
15
20
0
5
0
15
0
10
Depot
Distance (miles)
200
130
110
50
80
Total Distance
570
II
III
IV
7 x 252
21
7 x 210
21
7 x 168
21
7 x 126
21
5 x 252
21
5 x 210
21
5 x 168
21
5 x 126
21
5 x 252
21
5 x 210
21
5 x 168
21
5 x 126
21
4 x 252
21
4 x 210
21
4 x 168
21
4 x 126
21
Salesman
II
III
IV
84
70
56
42
Salesman
A
60
50
40
30
60
50
40
30
48
40
32
24
II
III
IV
14
28
42
24
34
44
54
24
34
44
54
36
44
52
60
II
III
IV
14
28
42
10
20
30
10
20
30
16
24
II
III
IV
12
18
Salesman
Row Reduction:
Territory
Salesman
Column Reduction
Territory
Salesman
II
III
IV
10
16
II
III
IV
14
Here N<n
Hence assignment is not optimum
Territory
Salesman
Here N<n
Hence assignment is not optimum
Territory
Salesman
Assignment
Territory
I
II
III
IV
14
Salesman
0
0
Territory
Sales
84000
50000
40000
24000
I
II
III
IV
Total Sales =
198000
85.3
90
87.5
82.4
89.1
91.3
78.9
84.5
99.4
80.4
89.3
88.4
82
31.3
28.5
66.5
80.4
109.7
84.3
34.6
86.2
83.3
85
85.5
Since the fast food chain wants to have each of the new stores ready as
quickly as possible, it has decided to award at most one job to a
construction company. What assignment results in the minimum cost to
the fast food chain?
Solution:
Since the above matrix is a 4x6, thus we add two dummy rows and
multiply the matrix by 10 to remove the decimals. The resultant matrix is
shown below.
Contracto
r
Store
1
853
900
875
824
891
913
789
845
994
804
893
884
820
313
285
665
804
1097
843
346
862
833
850
855
29
76
51
67
89
56
205
15
104
95
535
28
380
519
812
497
516
487
504
509
Since there are sufficient zeros we can go for Row and Column
assignments.
Step 2: Assignments
Contr
actor
Store
1
2
29
76
51
67
89
56
205
0
15
104
95
28
0
516
380
519
812
487
504
509
0
535
497
0
0
Cost
1
2
3
4
4
1
3
2
82.4
78.9
28.5
34.6
-----------Total Cost ( in Rs. 000 )=
224.40
Impossible Asignments
Sometimes in an assignment model we are not able to assign some loads
to some persons or machines. For example, if machines are to be
allocated to locations and if a machine cannot be accommodated in a
particular location, then it is an impossible assignment. To solve
problems in such situations we attach highly prohibited (say infinite) cost
to the cell in the matrix so that there is absolutely no chance to get the
assignmets with the infinite cost in the optimum solution.
Example:
The processing time in hrs for the jobs when allocated to the different
machines are indicated below. When a job is not possible to be made in a
particular manner, it is indicated as -
M/C
I
II
III
IV
V
Job
3
8
8
A
4
7
15
18
8
B
8
12
12
C
5
5
8
3
6
D
10
12
15
10
E
Allocate the machines for the jobs so that the total processing time is
minimum
Solution:
We have the impossible assignments marked as - We introduce
deliberately a high prohibitive time (say infinite) in those places and
proceed with the usual steps of solution procedure for assignment
problem.
Step 1: Row Reduction
M/C
Job
II
III
IV
15
18
12
12
10
12
15
10
M/C
Job
II
III
IV
11
14
II
III
IV
11
14
M/C
Job
II
III
IV
14
Now optimum assignment has not been reached. Now subtract the least
element from the uncovered elements and add it to the intersection
elements. In this case element is 1.
Continue doing this till optimal matrix is reached. The final assignment
matrix is shown below:
M/C
Job
II
III
IV
13
M/C
III
I
V
II
IV
Time (hrs)
8
4
12
5
10
--------Total processing time =
39
---------