0% found this document useful (0 votes)
34 views21 pages

Introduction To Operation Research: Section 7

The document discusses the assignment model for allocating jobs to workers or machines. It shows an example person-job matrix and machine-worker matrix. It then provides the step-by-step process to calculate the minimum time needed to accomplish all the jobs by assigning each job to a specific worker or machine. This includes identifying opportunity costs, reducing columns, assigning based on zeros, and reporting the final assignment and total minimum time. Alternative solutions are also considered when there are double zeros.

Uploaded by

asmaa5m3
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
34 views21 pages

Introduction To Operation Research: Section 7

The document discusses the assignment model for allocating jobs to workers or machines. It shows an example person-job matrix and machine-worker matrix. It then provides the step-by-step process to calculate the minimum time needed to accomplish all the jobs by assigning each job to a specific worker or machine. This includes identifying opportunity costs, reducing columns, assigning based on zeros, and reporting the final assignment and total minimum time. Alternative solutions are also considered when there are double zeros.

Uploaded by

asmaa5m3
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

Introduction to

Operation Research
Section 7

1
The assignment model in the form of person- job matrix
is show below:
Persons
Jobs A B C D
1 10 20 18 14
2 15 25 9 25
3 30 19 17 12
4 19 24 20 10

Calculate the time needed to accomplish the jobs


2
Step 1: Opportunity Cost
From the last table, choose the least number in each row
and subtract it from numbers of the same row
Persons

Jobs A B C D
1 0 10 8 4
2 6 16 0 16
3 18 7 5 0
4 9 14 10 0

3
Step 2: Reduction of Columns
Repeat the column containing zero, choose the least
number in each column and subtract it from numbers
of the same column
Persons

Jobs A B C D
1 0 3 8 4
2 6 9 0 16
3 18 0 5 0
4 9 7 10 0

4
Step 3: Assignment: machine for each worker
Assign zero values in rows containing one zero, then cross over
double zeros in columns

Persons

Jobs A B C D
1 0 3 8 4
2 6 9 0 16
3 18 0 5 0X
4 9 7 10 0

5
Step 4: Assignment: machine for each worker
All rows = All columns = all lines

Persons

Jobs A B C D
1 0 3 8 4
2 6 9 0 16
3 18 0 5 0X
4 9 7 10 0

6
Step 5: Report

Jobs Persons Time


1 A 10
2 C 9
3 B 19
4 D 10
TOTAL 48

Minimum Time= 48 hours per person

7
If we have two zeros at the same row or column we
seek an alternative solution
Alternative solution

Persons

Jobs A B C D
1 0 3 8 4
2 6 9 0 16
3 18 0 5 0
4 9 7 10 0X

8
Report for alternative solution
Jobs Persons Time
1 A 10
2 C 9
3 D 12
4 B 24
TOTAL 55

Minimum Time= 48 hours per person in the first


solution which is the minimum hours rate
9
The assignment model in the form of Machine-worker
matrix is show below:
Machines
Workers A B C D
1 19 7 3 21
2 15 21 18 6
3 11 14 15 22
4 7 10 13 15

Calculate the time needed to accomplish the jobs


10
Step 1: Opportunity Cost
From the last table, choose the least number in each row
and subtract it from numbers of the same row
Machines

Workers A B C D
1 16 4 0 18
2 9 15 12 0
3 0 3 4 11
4 0 3 6 8

11
Step 2: Reduction of Columns
Repeat the column containing zero, choose the least
number in each column and subtract it from numbers
of the same column
Machines

Workers A B C D
1 16 1 0 18
2 9 12 12 0
3 0 0 4 11
4 0 0 6 8

12
Step 3: Assignment: machine for each worker
Assign zero values in rows containing one zero, then cross over
double zeros in columns

Machines

Workers A B C D
1 16 1 0 18
2 9 12 12 0
3 0 X0 4 11
4 0X 0 6 8

13
Step 4: Assignment: machine for each worker
All rows = All columns = all lines

Machines

Workers A B C D
1 16 1 0 18
2 9 12 12 0
3 0 X0 4 11
4 0X 0 6 8

14
Step 5: Report

Workers Machines Time


1 C 3
2 D 6
3 A 11
4 B 10
TOTAL 30

Minimum Time= 30 hours per person

15
If we have two zeros at the same row or column we
seek an alternative solution
Alternative solution

Machines

Workers A B C D
1 16 1 0 18
2 9 12 12 0
3 X0 0 4 11
4 0 X0 6 8

16
Report for alternative solution
Workers Machines Time
1 C 3
2 D 6
3 B 14
4 A 7
TOTAL 30

Minimum Time= 30 hours per person

17
In Marcov analysis we look at a sequence of
events, and analyze the tendency of one event
to be followed by another.
A B C A B C
[current state] A =1
B Transitional =1
Probabilities
C =1
18
Marcov Analysis_ Illustrative Example

A B C
A 0.7 0.2 0.1
A B C
B 0.2 0.6 0.2
[0.5 0.3 0.2]
C 0.3 0.2 0.5
COMPUTATION
0.7 (0.5) + 0.2(0.3) + 0.3(0.2)
= 0.35 + 0.06 + 0.06 = 0.47 (A)
0.2(0.5) + 0.6(0.3) + 0.2(0.2)
= 0.10 + 0.18 + 0.04 = 0.32 (B)
0.1(0.5) + 0.2(0.3) + 0.5(0.2)
= 0.05 + 0.06 + 0.10 = 0.21 (C)
Note: 0.47 + 0.32 + 0.21 = 1 19
Marcov Analysis_ Illustrative Example

A B C
A 0.7 0.2 0.1
A B C
B 0.2 0.6 0.2
[0.47 0.32 0.21]
C 0.3 0.2 0.5
COMPUTATION of Next Year
0.7 (0. 47) + 0.2(0. 32) + 0.3(0. 21)
0.329 + 0.064 + 0.063= 0.456 (A)
0.2(0. 47) + 0.6(0. 32) + 0.2(0. 21)
= 0.094 + 0.192 + 0.042= 0.328 (B)
0.1(0. 47) + 0.2(0. 32) + 0.5(0. 21)
= 0.456 + 0.328 + 0.260= 0.216 (C)
Note: 0.456 + 0.328 + 0.216 = 1 20
21

You might also like