8000

1
 5771

2
 5

3
 3

5771

5238

5221

5155

5212
5153

4
 5151

57 5188

5183

5131

5188

5131
5191

5191

5
 5
Linear Programming

Dynamic Programming

Sequencing
8
Decision Making theory

Game theory

Queuing theory

3
Network analysis

Input-Output analysis

Markov analysis

Benefit-Cost analysis

9
Transportation models

Inventory models

6
Replacement models

7
 5 8

5
8
3

1
7

500 2

8
 1

500

50

81
9
5
5
10000
9 0.1
8

3
1210000

9
 121000

8810000
8
51000

5850000 + 585000 + 2250000 = 8685000

9
1100000

839
900100

2900 7 9200 5
3890 3 31000 50
1520 1 78000 30
531000 581 5200 5
9200 1 5800 5
39110 89 1100 2
11180 50020 7
900100 839 9380 3
71100
17000 3100
51000

6600000 + 400500 + 79500 = 7080000

1

50
5850000 * 0.10 = 585000
11
 1
5850000 * 0.05 = 292500
1
2250000 * 0.05 = 112500
8
2250000 * 0.02 = 45000
0.1
5850000 * 0.005 = 29250
2
( 5850000 + 2250000 + 585000 ) * 0.08 = 694800

585000 + 292500 + 112500 + 45000 + 29250 + 694800 = 1759050

1100000
900100
71100
7020000

1759050 + 7080000 = 8839050

1
8839050
 177 -‫‌أ‬
50000
881 -‫ب‬
‌
50000 * 225 = 11250000
11250000 – 8839050 = 2410950
7
585000+112500=697500 900100
9833000 8950110 789010
4233000 – 697500 = 3535500
2410950
‌ * 100%  31.4% ‌‌‌‌‌‌‌‌ 2
7685000
1759050
 4745638 ‌‌‌‌ 1
7080000
1
11250000

11
 1759050
 21092 ‌
7080000
225 
50000
11250000  4745638
‌ * 100%  58%
11250000
8685000
‌  2.79  3 50
2410950  697500
9 81

8 8

8
3
9
1
1

12
 8

5 8 8

70 8
7000
810 380 710 8100
500 510 800 830 100

13
 5100 810 830 800 380 100

3100 500 510 710 8100

1500
P .O .E .   3000
3500
1
7000

20
7000 3500
* 80  8000 * 80  4000
70 70

50 100 5000
80 5000 8000
30 5100 3000
90 8000 9000
10 8100 1000
10 3000 1000
70 3100 7000
20 9000 2000
10 9100 1000
500 1000 50000

3000 30

14
 ‌Z
10000

8000
Y
6000

4000

2000

0
10% 20% 30% 40% 50% 60% 70% 80% 90% 100%
Y 2000 2500 3000 3500 4000 4500 5000 5500 6000 6500
Z 1000 2000 3000 4000 5000 6000 7000 8000 9000 10000

Z Y

7000  3000
L .O .S .  * 100%  57%
7000

10
Profit = 9000 – ( 1500 + 4500 ) = 3000

8
3

8 8 8

15
 3
20 $
Q 1 2 3 4 5 6 7 8
V.C. 18 30 40 55 70 90 120 150

V
Q P T.R. T.C. M.R. M.C.
1 20 20 18 --- --- 2
2 20 40 30 20 12 10
3 20 60 40 20 10 20
4 20 80 55 20 15 25
5 20 100 70 20 15 30
6 20 120 90 20 20 30
7 20 140 120 20 30 20
8 20 160 150 20 30 10

Q=6
30 $ 1

16
 3 8

5 3 8

17
 5000
5510
1150  1000
* 100%  15%
1000
8 3 8
5

P
i Qi
i Ci
i Ti
N
N

 Q .C
i 1
i i
P N

T
i 1
i

9
90
810

2
A

A B C D
710 900 300 5000
9 3 1 8

C1 = 1 A
18
B
(C2) A B
A
3 6 2
C2   0.75 , C 3   1.5 and C4   0.5
4 4 4
4

 Q .C
i 1
i i  750 * 1  400 * 0.75  300 * 1.5  1000 * 0.5  2000 tons
4

T
i 1
i  40 * 250 * 1 * 8  80000 wor ker s .hours

2000
P  0.025 tons / wor ker .hour
80000
8
N

 Q .P
i 1
i i
PL  N

W
i 1
i

i Pi
i Wi

1
X Y

1991 1992 1991 1992

A 200 50000 25000 A 300 50000 60000
B 250 40000 100000 B 500 30000 50000
C 1000 25000 25000
7 100
300

 Q .P
i 1
i i
PL  N

W
i 1
i

50000 * 200  40000 * 250  25000 * 1000  50000 * 300  30000 * 500
P1991   71.43
500 * 300 * 7

25000 * 200  100000 * 250  25000 * 1000  60000 * 300  50000 * 500
P1992   93.33
500 * 300 * 7

19
5118 13.33 5115 75.93
3 3 8
5

9
1

7
2

50

55

58

21
 9 8

5
8
3
9
1
1
7
2
5 9 8
5

21
 8

1
1
7

22
 2

8 9 8

800 5 1

10

50

23
 5 8 3 9 1 1 7 2 1 50 R
A 10 10 11 11 11 11 10 10 10 10 11 50
B 31 39 81 81 30 81 81 30 30 30 81 55
C 581 551 551 551 551 580 580 581 581 581 580 50
D 90 31 31 31 31 31 31 31 31 31 31 1
E 30 30 30 81 81 31 31 82 38 30 30 50

55 + 29 + 120 + 36 + 30 = 270 seconds = 4.5 minutes

2
  n 
2 
 
n

  n X i    X i 
2

i 1  i 1 
m 
 n

  Xi 
 i 1 
 
m
α = 20 10 α
‌ .‌α = 40 ‌ 11
n
Xi

10 10

 X i  290 and X  8552

2
i R = 11 B
i 1 i 1
2
 20 * 10 * 8552  290 2 
m   6.75  7  n  10
 290 
 

500

500
9.1

80

24
 120
4.5 *  5.4 min .
100

20
80
4. 5 *  3.6 min .
100

51

15
4.5  4.5 *  5.175 min .
100
15
5.4  4.5 *  6.075 min .
100
15
3.6  4.5 *  4.275 min .
100

25
 5
5810000 100

500000

50
8 8
5710 3100

71

100
100
31000

500 5 100 5
910 5 510 8
520 50 800 5
580 2 580 5
10 1 500 5
51890
1 50
8 1
0.1
2
0.800

26
(ans.: 191995 , 175082.5 , 38% , 402121 , 68% , 2.2 , yes )

8
810 2

10000

1000
8
8000
8 8 8
510 810 100
8
10
810000

71 1 910 5
800 5 810 5
500 5 510 8
580 5 10 3
7880
7000 5500 100

1 50
8 1
0.1
2
900

(ans.: 137220 , 129020 , 74% , 198 , 80% , 1.23 , yes )

27
 1000 3
500 10
510 110 5110
510 510 310
10 10 8900
3100
(ans.: 2500 )

60 $ 9
40 $
250000 $
(ans.: 750000 , 12500 )

16 $ 1
500000 $ 14 $

1
(ans.: 4000000 , 250000 ; 4000000 , 238095 )

1
300 33
2
X1 X2 X3 X4
100 310 800 100
9 3 1 8
X1
(ans.: 0.0172 )

28
 5
8

9
1

5000

50

5 3

29
 ‫المدير‬

‫مالحظ‬ ‫مالحظ‬ ‫مالحظ‬

‫عمال‬ ‫عمال‬ ‫عمال‬

‫‪8‬‬

‫‪31‬‬
 5
8
3
9

5
8
3
3

31
 ‫التخطيط‬

‫‪58 50‬‬
‫‪1 5‬‬

‫‪5‬‬
‫‪78‬‬ ‫‪58‬‬ ‫‪1‬‬ ‫‪7‬‬ ‫‪1‬‬ ‫‪5‬‬
‫‪938 58 1‬‬ ‫‪1‬‬ ‫‪93‬‬ ‫‪1 1‬‬ ‫‪7‬‬
‫‪8118 58 1 1 1‬‬ ‫‪811‬‬ ‫‪1 1 1 93‬‬
‫‪51118 58 1 1 1 1‬‬ ‫‪5111 1 1 1 1 811‬‬
‫‪13358 58 1 1 1 1 1 1335 1 1 1 1 1 5111‬‬

‫‪32‬‬
 7 78

5
8

5
8

8 3

33
 8

3 3

T1 5
T2 8
T = T1 + T2 T

34
 T
1
T2

7 5
9 8
2 3
1 9
1 1

(7 +4 + 8 + 5 + 6 ) * 4 = 120 min.

‌7 7‌‌

9 9

8 8 8 8

1 ‌1

1 1

35
7 + 4 + 8 + 8 + 8 + 8 + 5 + 6 = 54 min.
T

4–1=3
T = 120 – ( 4 + 4 + 5 + 5 ) * 3 = 66

9 3
5

36
 Operations Research

[ 1 ] Hamdy A. Taha " Operations Research : an introduction" 6th

edition ( 1997), Prentice-Hall.
[ 2 ] Prem Kumar Gupta and D.S. Hira " Operations Research : an
introduction" 2nd edition (1989) S. Chand & Company LTD,
NewDelhi .

37
Linear Programming
Operations research

5221

5
8
3
9
1
Linear programming
5197 5273
Simplex method

38
 5
8
3
9
1
5 9
General form 5
n
max .or min . Z  C j X j Objective function
j 1

 
n
 
S .t .  a ij X j  bi Constra int s
j 1  
 
i  1 ,2 ,...,m
j  1 ,2 ,...,n
Cj
Decision variables Xj
Technical coefficients aij
Availability amounts bi
Canonical form 8
n
max . Z   C j X j Objective function
j 1
n
S .t . a
j 1
ij X j  bi Constra int s

Xj 0 nonnegative constra int s

( Xj ≥ 0 ) 5
.‌)‌≥ 8
maximized 3

39
 maximized minimized 5
max. Z = min. (-Z) 5
‌ ‫≥‌‌بضربب‌التتاينةرف‌ ر‬ ≤ 8
a ij X j  bi    a ij X j  bi ‌‌‌‌‌:‌‫‌أي‌إن‬،‌)-5(
≥ 3
  a ij X j  bi 
 
a ij X j  bi   
  a ij X j  bi 
 
absolute value 9
≥
  a ij X j  bi 
a ij X j  bi   
   a ij X j  bi 
   a ij X j   bi 
or a ij X j  bi  
  a ij X j   bi 


unrestricted sign 1

Xi  Xi  Xi Xi ,Xi  0
' '' ' ''
and
Standard form 3
5
Xj ≥ 0 nonnegative
bi ≥ 0 8
max. min. 3

a ij X j  bi  a ij X j  S i  bi
a ij X j  bi  a ij X j  S i  bi

Slack variables Si
Si ≥ 0
5
min . Z  2X1  3X 2  5 X 3
s .t . X 1  X 2  X 3  5
 6 X 1  7 X 2  9 X 3  15
19 X 1  7 X 2  5 X 3  13
X 1 , X 2  0 , X 3 unrestricted

41
 ' "
X3  X3  X3

min . Z  2 X 1  3 X 2  5 ( X 3'  X 3'' )

s .t .  X 1  X 2  ( X 3'  X '' ) 5
 6 X 1  7 X 2  9( X 3'  X 3'' ) 15
6 X 1 7 X 2  9( X 3'  X 3'' ) 15
19 X 1 7 X 2  5 ( X 3'  X 3'' ) 13
 19 X 1  7 X 2  5 ( X 3'  X 3'' ) 13
X 1 , X 2 , X 3' , X 3"  0

max . Z  2 X  3 X  5 ( X '  X '' )

1 2 3 3
s .t . ''
 X  X  ( X  X ) S 5
'
1 2 3 1
6 X 7 X 9 ( X '  X '' )15
1 2 3 3

19 X 7 X  5 ( X '  X '' ) S 13

1 2 3 3 3
19 X 7 X 5 ( X '  X '' ) S 13
1 2 3 3 4
X , X , X ' , X " ,S , S , S ,S  0
1 2 3 3 1 2 3 4

Formulation of the model 8 9

C B A 8

A B C
I 1 8 5 930
II 3 0 8 910
III 5 9 0 980
3 8 1

41
 3
1 5 1

50

A
0.9 C B
C B A X3 X2 X1

max . Z  3 X 1  2 X 2  5 X 3
s .t . X 1  2 X 2  X 3  430
3 X 1  2 X 3  460
X 1  4 X 2  420
X1 ,X2 ,X3  0

max . Z  3 X 1  2 X 2  5 X 3  6 X 4
s .t . X 1  2 X 2  X 3  3 X 4  430
3 X 1  2 X 3  5 X 4  460
X 1  4 X 2  X 4  420
X1 ,X2 ,X3 ,X4  0

430 - (X1+2X2+X3)+ 460 - (3X1+2X3)+ 420 - (X1+4X2) ≤ 10

→ 5X1 + 6X2 + 3X3 ≥ 1300
‌ :‌‫لذا‌ يلةتوذج‌البنيض ‌سيكون‬
max . Z  3X1  2X2  5X3
s .t . X 1  2 X 2  X 3  430
3 X 1  2 X 3  460
X 1  4 X 2  420
5 X 1  6 X 2  3 X 3  1300
X1 ,X2 ,X3  0
X1
 0.4  X 1  0.4 X 2  0.4 X 3  0
X2  X3

42
 max . Z  3X1  2X2  5 X3
s .t . X 1  2 X 2  X 3  430
3 X 1  2 X 3  460
X 1  4 X 2  420
X 1  0.4 X 2  0.4 X 3  0
X1 ,X2 ,X3  0

3 9

Graphical method 5

Feasible Solutions
Extreme Points Region (F.S.R.)
Optimal values
Simplex method
3
max . Z  120 X  100Y
s .t . 2 X  2.5Y  1000
3 X  1.5Y  1200
1.5 X  4Y  1200
X ,Y  0

1. 2 X  2.5Y  100if X 0 then Y  400  ( 0 ,400 )

if Y 0 then X  500  ( 500.0 )
2 3 X  1.5Y  1200 if X 0 then Y  800  ( 0 ,800 )
if Y 0 then X  400  ( 400 ,0 )
3. 1.5 X  4Y  1200 if X 0 then Y  300  ( 0 ,300 )
if Y 0 then X  800  ( 800 ,0 )
4. X 0
5. Y 0
(F.S.R.)

43
 900
800 8
700
600
500
400
5
300 B 3
200 C
F.S.R. D
100
0 A E
0 100 200 300 400 500

E D C B A
C(4000/17 , 3600/17 ) 3 5
D(1000/3 , 400/3 ) 8 5

Points Z = 120 X +100 Y

A(0,0) Z=0+0=0
B(0,300) Z = 0 +100*300 = 30000
C(4000/17, 3600/17) Z=120*(4000/17)+100*(3600/17)=840000/17
D(1000/3,400/3) Z=120*(1000/3)+100*(400/3)=160000/3 →max.
E(400,0) Z = 120* 400 + 0 = 48000
Z=160000/3 Y=400/3 X=1000/3
9
Z  4 X  5Y
s .t . 2 X  Y  6
X  2Y  5
X  2Y  2
 X Y  2
X Y  1
X ,Y  0

44
1. 2X  Y  6 if X 0 then Y  6  ( 0 ,6 )
if Y 0 then X  3  ( 3 ,0 )
2. X  2Y  5 if X 0 then Y  2.5  ( 0 ,2.5 )
if Y 0 then X  5  ( 5 ,0 )
3. X  2Y  2 if X 0 then Y  1  ( 0 ,1 )
if Y 0 then X  2  ( 2 ,0 )
4.  X  Y  2 if X 0 then Y  2  ( 0 ,2 )
if Y 0 then X  2  ( 2 ,0 )
5. X  Y  1 if X 0 then Y  1  ( 0 ,1 )
if Y 0 then X  1  ( 1 ,0 )
6. X 0
7. Y 0

7
6 5
5 9

4
3
C
2 B
F.S.R D 8
1 A
. E
0 F
G
-1 ‌03 2 4 6
-2 1
-3

C( 1/3 , 7/3 ) 9 8
D( 7/3 , 4/3 ) 8 5
E( 14/5 , 2/5 ) 3 5
Points Z=4X+5Y
A( 0 , 1 ) 0+5=5
B( 0 , 2 ) 0 + 10 = 10
C( 1/3 , 7/3 ) 4/3 +35/3 = 13
D( 7/3 , 4/3 ) 28/3 + 20/3 = 16→max.
E( 14/5 , 2/5 ) 56/5 + 10/5 = 66/5
F( 2 , 0 ) 8+0=8
G( 1 , 0 ) 4 + 0 = 4 →min.

45
Y = 4/3 X = 7/3 51 Z
Y=0 X=1 9 Z
1
max . Z  2 X  4Y  8
s .t .  X  2Y  2
X Y  1
X Y  2
X ,Y  0

1.  X  2Y  2 if X 0 then Y  1  ( 0 ,1 )
if Y 0 then X  2  ( 2 ,0 )
2 X Y  1 if X 0 then Y  1  ( 0 ,1 )
if Y 0 then X  1  ( 1 ,0 )
3. X Y  2 if X 0 then Y  2  ( 0 ,2 )
if Y 0 then X  2  ( 2 ,0 )
4. X 0
5. Y 0

2.5
2
3 1
1.5
A
8
1 F.S.R.
0.5 B
0
-0.5 0 0.5 1 1.5 2 2.5

-1
-1.5

AB
A( 2/3 , 4/3 ) 3 5
B( 3/2 , 1/2 ) 3 8

Points Z = 2X + 4Y + 8
A( 2/3 , 4/3 ) 4/3 + 16/3 + 8 = 44/3 → max.
B( 3/2 , 1/2 ) 3 + 2 + 8 = 13
Z = 44/3 Y = 4/3 X = 2/3

46
 Simplex method 8

Si > 0 Si = 0
Si = 0

≤‌(‌‫‌ميعدا‌قيد‌عدم‌السيلايف‌‌إذ‌ناقى‌أكاب‌مر ‌أ ‌نسري ي‬،‌‌bi‌≤‌0‌‌‫≥)‌‌بشبط‬

5
Starting Basic Feasible Solution(S.B.F.S.) 8

C1 C2 Cn 0 0 0 0
B.C. B.V. X1 X2 Xn S1 S2 Sm R.H.S.
0 S1 a11 a12 a1n 5 0 0 b1
0 S2 a21 a22 a2n 0 5 0 b2

0 Sm am1 am2 amn 0 0 5 bm

Zj – Cj -C1 -C2 -Cn 0 0 0 0

3
Zj – Cj
Optimality min. max.
R.H.S. condition
Leaving Variable
Entering R.H.S.
Feasibility condition Variable
Pivot element
9

47
 Zj – Cj 1
min. max.

Simplex method 3 1

max . Z  120 X  100Y

s .t . 2 X  2.5Y  S 1  1000
3 X  1.5Y  S 2  1200
1.5 X  4Y  S 3  1200
X ,Y , S 1 , S 2 , S 3  0
580 500 0 0 0 0
B.C. B.V. X Y S1 S2 S3 R.H.S. Ratio
0 S1 8 8.1 5 0 0 5000 500
0 S2 3 5.1 0 5 0 5800 400 → min.
0 S3 5.1 9 0 0 5 5800 200
Zj – Cj -120 500 0 0 0 0
0 S1 0 5.1 5 83 0 800 133.3→min.
580 X 5 0.1 0 53 0 900 200
0 S3 0 3.81 0 0.1 5 100 529.1
Zj – Cj 0 90 0 90 0 92000
500 Y 0 5 83 91 0 900 3
580 X 5 0 53 11 0 5000 3
0 S3 0 0 53 1 57 52 5 100 3
Zj – Cj 0 0 20 3 800 1 0 510000 3

max. Zj – Cj
Z = 160000/3 Y = 400/3 X = 1000/3
3

48
 X Zj – Cj 580
3 S2 X S2 900
S3 S1
8 X -2 -1 0 -2/3 0 -800
S1 2 2.5 1 0 0 1000

S1 0 1.5 1 -2/3 0 200

5.1 X -1.5 -0.75 0 -0.5 0 -600

S3 1.5 4 0 0 1 1200

S3 0 3.25 0 -0.5 1 600

)‌≤‌(

Penalty method (M- technique ) M 5

‌‌bi‌≤‌0‌‌‫≥)‌‌بشبط‬

Artificial variables ( Ri)

≤‌

Si ≥
Si ≤
Ri
Ri
(- M ) Ri
M min. (+M) max.
Si

49
 Ri
( S.B.F.S. )
M

7
min . Z  5X1  6X2 7 X3
s .t . X 1  5 X 2  3 X 3  15
5 X 1  6 X 2  10 X 3  20
X1  X2  X3  5
X1 ,X2 ,X3  0

min . Z  5 X 1  6 X 2  7 X 3  MR1  MR2

s .t . X 1  5 X 2  3 X 3  S 1  R1  15
5 X 1  6 X 2  10 X 3  S 2  20
X 1  X 2  X 3  R2  5
X 1 , X 2 , X 3 , S 1 , S 2 , R1 , R2  0
1 1 7 0 0 M M
R.H.S. Ratio
B.C. B.V. X1 X2 X3 S1 S2 R1 R2
M R1 5 1 -3 5 0 5 0 51 3min.
0 S2 1 -6 50 0 5 0 0 80
M R2 5 5 5 0 0 0 5 1 1
Zj – Cj 2M-5 6M+6 -2M+7 -M 0 0 0 20M

1 X2 1/5 5 -3/5 -1/5 0 1/5 0 3

0 S2 31/5 0 32/5 -6/5 5 6/5 0 32 1.1
M R3 4/5 0 8/5 1/5 0 -1/5 5 8 1.25min
Zj – Cj 4/5M-31/5 0 8/5M+53/5 1/5M+6/5 0 -6/5M-6/5 0 2M-18

1 X2 1/2 5 0 -1/8 0 1/8 3/8 15/4

0 S2 3 0 0 8 5 8 9 30
7 X3 1/2 0 5 1/8 0 -1/8 5/8 5/4
Zj – Cj -23/2 0 0 -1/8 0 -M+1/8 -M-53/8 -125/4

Zj – Cj
X3= 5/4 X2=15/4 X1=0
Z= -125/4

51
 Two- Phase technique 8
≥

Phase - I
5
min. R= ∑Ri 8
Ri

R=0 3
Ri
R≠0

Phase-II
Ri 5

8
7 2
Phase – I :
min . R  R1  R2
s .t . X 1  5 X 2  3 X 3  S 1  R1  15
5 X 1  6 X 2  10 X 3  S 2  20
X 1  X 2  X 3  R2  5
X 1 , X 2 , X 3 , S 1 , S 2 , R1 , R 2  0

51
 0 0 0 0 0 1 1
B.C. B.V. X1 X2 X3 S1 S2 R1 R2 Ratio
R.H.S.
1 R1 5 1 -3 5 0 5 0 51 3→min.
0 S2 1 -6 50 0 5 0 0 80
1 R2 5 5 5 0 0 0 5 1 1
Rj – Cj 2 6 -2 -1 0 0 0 20
0 X2 1/5 5 -3/5 -1/5 0 1/5 0 3
0 S2 31/5 0 32/5 -6/5 5 6/5 0 32 1.1
1 R3 4/5 0 8/5 1/5 0 -1/5 5 8 1.25→min
Rj – Cj 4/5 0 8/5 1/5 0 -6/5 0 2
0 X2 1/2 5 0 -1/8 0 1/8 3/8 15/4
0 S2 3 0 0 8 5 8 9 30
0 X3 1/2 0 5 1/8 0 -1/8 5/8 5/4
Rj – Cj 0 0 0 0 0 -1 -1 0

R=0 R2 R1
R2 R1
Phase-II :

1 1 7 0 0
B.C. B.V. X1 X2 X3 S1 S2 R.H.S.

1 X2 1/2 5 0 -1/8 0 15/4

0 S2 3 0 0 8 5 30
7 X3 1/2 0 5 1/8 0 5/4
Zj – Cj -23/2 0 0 -1/8 0 -125/4

min.
X3= 5/4 X2=15/4 X1=0
Z= -125/4

52
 5
1 ) max . Z  X1  3X 2
s .t .  X1  2X2  5
X 1  3 X 2  10
X 1 , X 2 unrestricted in sign

2 ) min . Z  3X1  3X 2  7 X 3
s .t . X 1  X 2  3 X 3  40
X 1  9 X 2  7 X 3  50
2 X 1  3 X 2  20
5 X 2  8 X 3  100
X1 , X 2  0, X 3 unrest .

3 ) min . Z  3 X 1  4 X 2  2 X 3  5 X 4
s .t . 4 X 1  X 2  2 X 3  X 4  2
X 1  X 2  3 X 3  X 4  14
2X1  3X 2  X 3  2X4  2
X 1 , X 2  0 , X 3  0 , X 4 unrest .

M2 , M1 D,C,B,A 8

machines Time per unit ( hours/unit) Cost Availability

A B C D (I.D./hour) hours
M1 8 3 9 8 50 100
M2 3 8 5 8 51 320
Sales price 11 70 11 91
(I.D./unit)

53
 3

Products Operation Cost

machines I II (I.D./day)
I 9 1 8000
II 1 3 8800
III 8 7 5200
IV 2 9 5100
10
71

9
100
510
1000 2000 810

(ans.: 125 , 250 , 2250000)

D,C,B,A 1

A B C D
Raw material-I 2 59 50 1
Raw material-II 8 9 7 1
Labor time ( hours) 8 5 3 5
RM-II 900 RM-I 200
9000 8000 510
5000
91000 13000 10000 90000
( ans.: 65 , 20 , 0 , 0 , 1210000 )

54
 1
1 ) max . Z  4 X  3Y 2 ) max . Z  3 X  2Y
s .t . 2 X  3Y  6 s .t . YX 2
 3 X  2Y  3 X Y  1
2Y  5 X4
2X  Y  4 Y3
X ,Y  0 X ,Y  0

3 ) min . Z  8 X  5Y
4 ) min . Z  2 X  3Y
s .t . X  2Y  10
s .t . X  Y  15
X 5
X  2Y  10
Y2
X ,Y  0
X ,Y  0
( ans.: (X,Y,Z): 1)(3/2,1,9) , 2)(4,3,18) , 3) (5,0,40) , 4) (0,5,15))

7
1 ) max . Z  2 X 1  X 2  3 X 3  5 X 4 2 ) min . Z  X1  3X 2  2X 3
s .t . X 1  7 X 2  3 X 3  7 X 4  46 3X1  X 2  2X 3  7
3X1  X 2  X 3  2X4  8  2 X 1  4 X 2  12
2 X 1  3 X 2  X 3  X 4  10  4 X 1  3 X 2  8 X 3  10
X1 ,X2 ,X3 ,X4  0 X1 ,X2 ,X3  0

( ans.: 1) (0,12/7,0,34/7; 26) , 2) (78/25,114/25,11/10; -319/25))

X6 , X5 , X4 2
(S.B.F.S.)
max . Z  3X1  X 2  2X 3
s .t . 4X1  X2  2X3  X4  3
8 X 1  X 2  4 X 3  2 X 5  10 ( ans.: (0,0,3/2,0,7/2,0;3))
3X1  X6  0
X1 , X2 , X3 , X4 , X5 , X6  0

1
1 ) min . Z  4X1  X2 2 ) max . Z  X 1  5 X 2  3 X 3
s .t . 3X1  X 2  3 s .t . X1  2X2  X3  3
4 X1  3X 2  6 2X1  X2  4
X1  2X2  3 X1 , X2 ,X3  0
X1 , X2  0
(ans.: 1) ( 3/5,6/5;18/5) , 2) (2,0,1;5)) X3
55
 Transportation Model 5 1

5195
5197
5115 5113
Modify Distribution method (MODI)
5119 Stepping Stone
Assignment problem 5111
5117
R.A.M. 5112 V.A.M.
5112
The least cost transportation problem 8 5 1
n m
i Si
j Dj
j i (i,j) Cij
j i Xij
j i

56
 m n
min . Z   C ij X ij
i 1 j 1
n
s .t . X
j 1
ij  ai
m

X
i 1
ij  bj
X ij  0

unbalanced
5
b  a
j
j
i
i

8
a  b
i
i
j
j

S.B.F.S. 5
8

S.B.F.S. 8 5 1

Northwest corner method 5

X11
X11=min.(a1 ,b1 )

Least cost method 8

57
 Vogel's Approximation Method ( V.A.M.) 3

Russel's Approximation Method (R.A.M.) 9

bj ai
ij  C ij  a i  b j
‌ ‫ ‌ نعطر ‌لتتييباري‌أكارب ‌كتيرف‌متكةرف‌ التر‬،‌ ∆ij
‌ .‌‌min.(ai , bj )‌‫تسي ي‬

58
 Optimal Solution 3 5 1
S.B.F.S.
m n m+n-1

Stepping Stone method 5

C ij
C ij

Multipliers method 8
Modified Distribution method (MODI)

Duality theory
Vj j Ui i
Xij
U i  V j  C ij

59
(m+n) (m+n-1) (m+n-1)

U1=0
Xpq C pq
C pq = Cpq- ( Up+Vq)

C pq

81 80 51 S3 , S2 , S1 5
51 58 50 2 C4 , C3 , C2 , C1

C1 C2 C3 C4
S1 8 3 9 1
S2 3 8 1 8
S3 9 5 8 3
(25+20+15=60)
C5 (8+10+12+15=45)
(60-45=15)
S.B.F.S. 5

C1 C2 C3 C4 C5 Supply
8 3 9 1 0
S1
2 7 51
3 8 1 8 0
S2 80
3 58 1
9 5 8 3 0
S3
50 51 81
Demand 2 50 58 51 51 10

61
T.T.C. = 2*8 + 3*7 + 2*3 + 5*12 + 2*5 + 3*10 + 0*15 = 143

C1 C2 C3 C4 C5 Supply
8 3 9 1 0
S1
0 51 51
3 8 1 8 0
S2
1 51 80
9 5 8 3 0
S3
3 50 58 81
Demand 2 50 58 51 51 10

T.T.C. = 2*0 + 0*15 + 3*5 + 2*15 + 4*3 + 1*10 + 2*12 = 91

VAM
C1 C2 C3 C4 C5 Supply P.C.
8 3 9 1 0 2 1 1 3
S1
0 51 51
3 8 1 8 0 2 0 0 11
S2
1 51 80
9 5 8 3 0 1 1 2 11
S3
3 50 58 81
Demand 2 50 58 51 51 10
P.C. 1 5 8 5 0
1 5 8 5
1 5 8 5
1 5
1 5

T.T.C. = 2*0 + 0*15 + 3*5 + 2*15 + 4*3 + 1*10 + 2*12 = 91

61
 RAM
C1 C2 C3 C4 C5 Supply
8 3 9 1 0
S1
2 7 51
3 8 1 8 0
S2
51 1 80
9 5 8 3 0
S3
50 58 3 81
Demand 2 50 58 51 51 10

C1 C2 C3 C4 C5
S1 -7 -5 -6 -5 -5
S2 -6 -6 -5 -8 -5
S3 -4 -6 -7 -6 -4
C4 X24
C1 C2 C3 C5
S1 -6 -4 -5 -4
S2 -6 -6 -5 -5
S3 -4 -6 -7 -4
C3 X33
C1 C2 C5
S1 -5 -3 -3
S2 -4 -4 -3
S3 -4 -6 -4
C2 X32
C1 C5
S1 -4 -2
S2 -4 -3
S3 -4 -4
S3 X35
C1 C5
S1 -3 -2
S2 -3 -3
X15 , S2 X25
X11
T.T.C. = 2*8 + 0*7 + 2*15 + 0*5 + 1*10 + 2*12 + 0*3 = 80

62
RAM 15 VAM ≥ 15 593
20
VAM RAM
VAM S.B.F.S.
RAM

No. of basic cells = m+n-1 = 5+3-1=7

Optimal solution 8
Stepping stone
C ij
C1 C2 C3 C4 C5 Supply
8 3 9 1 0
S1 51
0 51
3 8 1 8 0
S2
1 51 80
9 5 8 3 0
S3 81
3 50 58
Demand 2 50 58 51 51 10

X 12  X 32  X 31  X 11 : C 12  3  1  4  2  4
X 13  X 33  X 31  X 11 : C 13  4  2  4  2  4
X 14  X 24  X 21  X 11 : C 14  5  2  3  2  4
X 22  X 32  X 31  X 21 : C 22  2  1  4  3  2
X 23  X 33  X 31  X 21 : C 23  5  2  4  3  4
X 25  X 15  X 11  X 21 : C 25  0  0  2  3  1
X 34  X 23  X 21  X 31 : C 34  3  2  3  4  0
X 35  X 15  X 11  X 31 : C 35  0  0  2  4  2 most negative

63
 entering variable C 35
leaving variable X35
   
Xij X 35  X 15  X 11  X 31
X31
C1 C2 C3 C4 C5 Supply
8 3 9 1 0
S1
3 58 51
3 8 1 8 0
S2
1 51 80
9 5 8 3 0
S3
50 58 3 81
Demand 2 50 58 51 51 10
T.T.C. = 6 + 0 + 15 + 30 + 10 + 24 + 0 = 85
No. of basic cells = 5 + 3 – 1 = 7

X 12  X 32  X 35  X 15 : C 12  3  1  0  0  2
X 13  X 33  X 35  X 15 : C 13  4  2  0  0  2
X 14  X 24  X 21  X 11 : C 14  5  2  3  2  4
X 22  X 32  X 35  X 15  X 11  X 21 : C 22  2  1  0  0  2  3  0
X 23  X 33  X 35  X 15  X 11  X 21 : C 23  5  2  0  0  2  3  2
X 25  X 21  X 11  X 15 : C 25  0  3  2  0  1 negative
X 31  X 11  X 15  X 35 : C 31  4  2  0  0  2
X 34  X 24  X 21  X 11  X 15  X 35 : C 34  3  2  3  2  0  0  2
X21 X25
C1 C2 C3 C4 C5 Supply
8 3 9 1 0
S1
2 7 51
3 8 1 8 0
S2 80
51 1
9 5 8 3 0
S3
50 58 3 81
Demand 2 50 58 51 51 10
T.T.C. = 16 + 0 + 30 + 0 + 10 + 24 + 0 = 80
No. of basic cells = 7

64
 X 12  X 32  X 35  X 15 : C 12  3  1  0  0  2
X 13  X 33  X 35  X 15 : C 13  4  2  0  0  2
X 14  X 24  X 25  X 15 : C 14  5  2  0  0  3
X 21  X 25  X 15  X 11 : C 21  3  0  0  2  1
X 22  X 32  X 35  X 25 : C 22  2  1  0  0  1
X 23  X 33  X 35  X 25 : C 23  5  2  0  0  3
X 31  X 35  X 15  X 11 : C 31  4  0  0  2  2
X 34  X 35  X 25  X 24 : C 34  3  0  0  2  1

C ij
2
51
58 50

Vj , Ui Multipliers method 8
U1=0 U i  V j  C ij
VAM
C1 C2 C3 C4 C5 Supply
8 3 9 1 0
S1
0 51 51
3 8 1 8 0
S2
1 51 80
9 5 8 3 0
S3
3 50 58 81
Demand 2 50 58 51 51 10
T.T.C. = 91 and no. of basic cells = 7
U 1 0
C 11  U 1  V1  2  V1  2
U 1 0
C 15  U 1  V5  0  V5  0
V1  2
C 21  U 2  V1  3  U2  1
U 2 1
C 24  U 2  V4  2  V4  1
V1  2
C 31  U 3  V1  4  U3  2
U3 2
C 32  U 3  V2  1  V 2  1
U3 2
C 33  U 3  V3  2  V3  0

65
 C ij  C ij  ( U i  V j ) C ij
C 12  C 12  ( U 1  V2 )  3  ( 0  ( 1 ))  4
C 13  C 13  ( U 1  V3 )  4  ( 0  0 )  4
C 14  C 14  ( U 1  V4 )  5  ( 0  1 )  4
C 22  C 22  ( U 2  V2 )  2  ( 0  1 )  2
C 23  C 23  ( U 2  V3 )  5  ( 1  0 )  4
C 25  C 25  ( U 2  V5 )  0  ( 1  0 )  1
C 34  C 34  ( U 3  V4 )  3  ( 2  1 )  0
C 35  C 35  ( U 3  V5 )  0  ( 2  0 )  2 most negative

X35 C ij
   
X 35  X 15  X 11  X 31
X31

C1 C2 C3 C4 C5 Supply
8 3 9 1 0
S1
3 58 51
3 8 1 8 0
S2
1 51 80
9 5 8 3 0
S3
50 58 3 81
Demand 2 50 58 51 51 10
T.T.C. = 6 + 0 + 15 + 30 + 10 + 24 + 0 = 85
No. of basic cells = m + n – 1 = 3 + 5 – 1 = 7
C ij

V1=2 V2=1
V3=2 V4=1 V5=0
C1 C3 C2 C4 C5 Supply
U1=0 S1 2 3 4 5 0
3 2 2 4 12 15
U2=1 S2 3 2 5 2 0
5 0 2 15 -1 20
U3=0 S3 4 1 2 3 0
2 10 12 2 3 25
Demand 8 10 12 15 15 60

66
 X21 C ij X25

V1=2 V2=1 V3=2 V4=2 V5=0 Supply

C1 C2 C3 C4 C5
U1=0 S1 2 3 4 5 0
8 2 2 3 7 15
U2=0 S2 3 2 5 2 0
1 1 3 15 5 20
U3=0 S3 4 1 2 3 0
2 10 12 1 3 25
Demand 8 10 12 15 15 60

T.T.C. = 16 + 0 + 30 + 0 + 10 + 24 + 0 = 80
C ij

2
51
58 50

67
 Assignment model 8 1
Jobs n
m (machines

(n<m) (m – n) m=n
(n>m) (n-m)

minimized
5

8 1
maximized

68
 8
jobs machines
M1 M2 M3 M4 M5
J1 10 11 4 2 8
J2 7 11 10 14 12
J3 5 6 9 12 14
J4 13 15 11 10 7

1 9

M1 M2 M3 M4 M5 M1 M2 M3 M4 M5
J1 10 11 4 2 8 J1 8 9 2 0 6
J2 7 11 10 14 12 J2 0 4 3 7 5
J3 5 6 9 12 14 J3 0 1 4 7 9
J4 13 15 11 10 7 J4 6 8 4 3 0
J5 0 0 0 0 0 J5 0 0 0 0 0

9
5 1

1 M1 M2 M3 M4 M5
J1 1 9 2 0 7
J2 0 3 2 6 5
J3 0 0 3 6 9
J4 6 7 3 2 0
J5 1 0 0 0 1

Jobs Machines
J1 M4
J2 M1
J3 M1 , M2
J4 M5
J5 M2 , M3 , M4

69
 9 8 8 3 5
5 3 1
8 9 5
7 5 8
1 8 3
88  7 1 9
3 88

3
Machines
Jobs M1 M2 M3 M4
J1 50 3 8 9
J2 1 9 5 3
J3 2 1 5 1
J4 7 1 8 1

50

Machines Machines
Jobs M1 M2 M3 M4 Jobs M1 M2 M3 M4
J1 0 7 8 6 J1 0 7 8 6
J2 1 6 9 7 J2 0 5 8 6
J3 2 5 9 5 J3 0 3 7 3
J4 3 4 8 4 J4 0 1 5 1

Machines
Jobs M1 M2 M3 M4
J1 0 6 3 5
J2 0 4 3 5
J3 0 2 2 2
J4 0 0 0 0
8 9 8

71
 Machines
Jobs M1 M2 M3 M4
J1 0 4 1 3
J2 0 2 1 3
J3 0 0 0 0
J4 2 0 0 0
5 9 3

Machines
Jobs M1 M2 M3 M4
J1 0 3 0 2
J2 0 1 0 2
J3 1 0 0 0
J4 3 0 0 0
9

Jobs Machines
J1 M1 , M3
J2 M1 , M3
J3 M2 , M3 , M4
J4 M2 , M3 , M4

Jobs Mach. profit Jo. Ma. Pr. Jo. Ma. Pr. Jo. Mach. Pr.
J1 M1 10 J1 M1 10 J1 M3 2 J1 M3 2
J2 M3 1 J2 M3 1 J2 M1 9 J2 M1 9
J3 M2 5 or J3 M4 5 or J3 M2 5 or J3 M4 5
J4 M4 6 J4 M2 6 J4 M4 6 J4 M2 6
∑ 22 ∑ 22 ∑ 22 ∑ 22

88

71
 5
a) Destinations Supply b) Destinations Supply
Sources D1 D2 D3 Sources D1 D2 D3
S1 1 2 6 7 S1 5 1 8 12
S2 0 4 2 12 S2 2 4 0 14
S3 3 1 5 11 S3 3 6 7 4
Demand 10 10 10 30 Demand 9 10 11 30

c) Dest. Sup. Dest. Sup.

Sou. D1 D2 D3 Sou. D1 D2 D3 D4
S1 5 1 7 10 S1 10 20 5 7 10
S2 6 4 6 80 S2 13 9 12 8 20
S3 3 2 2 15 S3 4 15 7 9 30
Dem. 75 20 50 S4 14 7 1 0 40
S5 3 12 5 19 50
Dem. 60 60 20 10 150
( ans. : a)(7,0,0,2,0,10,1,10,0;40) , b)(2,10,0,3,0,11,4,0,0;38) ,
c)(0,10,0,35,10,35,0,0,15,40,0,0;500) ,
d)(0,0,10,0,0,20,0,0,30,0,0,0,0,30,0,10,30,10,10,0;820))

M5 , M4 , M3 , W4 , W3 , W2 , W1 8
30 10 90 70 M2 , M1
10 10 30 80 90

Warehouses Markets
M1 M2 M3 M4 M5
W1 7 1 1 9 8
W2 1 7 3 1 3
W3 2 2 7 3 5
W4 9 3 5 8 5

(ans.: (30,0,0,40,0,0,0,30,0,10,0,0,0,20,40,10,20,0,0,0;690))

72
 S4 D1 3
Destinations
Sources D1 D2 D3 Supply
S1 5 1 0 20
S2 3 2 4 10
S3 7 5 2 15
S4 9 6 0 15
Demand 5 10 15
(ans.: (0,10,5,5,5,0,0,0,10,0,0,0,15,5,0,10,0;55))

9
80 80 30 80 30 81
M4 81 50 30
J4
Jobs
machines J1 J2 J3 J4 J5
M1 10 2 3 15 9
M2 5 10 15 2 4
M3 15 5 14 7 15
M4 20 15 13 ---- 8
(ans.:(0,0,25,0,0,20,0,0,10,0,0,20,0,0,0,0,0,5,0,25;560))

1
machines Machines
a) Jobs M1 M2 M3 M4 b) Jobs M1 M2 M3 M4 M5
J1 10 5 5 2 J1 3 8 2 10 3
J2 9 8 4 3 J2 8 7 2 9 7
J3 7 7 6 4 J3 6 4 2 7 5
J4 8 7 5 5 J4 8 4 2 3 5
J5 9 10 6 9 10
(ans.:a) 1-2,2-4,3-1,4-3 or 1-4,2-3,3-1,4-2;20, b) 1-5 , 2-3 , 3-2 , 4-4 , 5-1 ;21 )

1
Machines
Jobs M1 M2 M3 M4 M5
J1 3 9 2 3 7
J2 6 1 5 6 6
J3 9 4 7 10 3
J4 2 5 4 2 1
J5 9 6 2 4 6
(ans.:1-2 , 2-5 , 3-4 , 4-3 , 5-1 ;38 )
73
 P1 7
M4 P3 M3
machines
Processes M1 M2 M3 M4
P1 5 5 --- 2
P2 7 4 2 3
P3 9 3 5 ---
P4 7 2 6 7
(ans.: 1-4 , 2-3 , 3-2 , 4-1 ; 14)

2
Lines
Engineering L1 L2 L3 L4
E1 2 1 1 9
E2 1 7 7 2
E3 50 55 1 2
E4 3 1 1 7

L4 E1

(ans.: a)1-4 , 2-2 , 3-3 , 4-1;20 , b)1-3 , 2-2 , 3-4 , 4-1 ; 24 ; 4 )

74
 Network planning

Critical Path 5 1

Event

Activity
Duration

Path

Critical Path (C.P.)

C.P.time
Forward pass
Earliest time
(ESj)
ES j  max .ES j  Dij  ( i , j )activities
i

(i,j) Dij ES1 = 0

75
 Backward pass
Latest time (LCi)

LC i  min . LC i  Dij
j
 ( i , j )activities
LCn = ESn
(i,j)
ESj – ESi = LCj –LCi =Dij
Free Float Time (F.F.)

FFij = ESj – ESi - Dij

5
a) Act. Pre-act. b) Act. Pre-act. c) Act. Pre-act.
A ---- A ---- A ----
B ---- B A B ----
C A,B C A C A,B
D A D B D A,B
E C,D E B,C E B
F D,E F D,E
G C,F
H D,E
I G,H

a)
A 2 D

1 4 E 5

B 3 C
b)
B 3 D
A F
1 2 5 6

C 4 E

76
 C 5
‌3 G
A
6 I 7
1 F
D
H
B ‌4
2 E

8
C,B,A
D B,A
H,F,E B
G F,C
J,I H,E
K J,F,D,C
L K
L,I,G

D 7 K 8
3
L
A 4 J

H ‌I 9
1 B 5
‌2 E
F G
C
‌6

activity 1-2 2-3 2-4 3-4 3-5 3-6 4-5 4-6 5-6
Dij 3 3 2 0 3 2 7 5 6

77
 6

6
‌0
3 19
3
0 13
‌3 2 19
3 3 13
1 3 ‌2 0 6
5 6
2
7
5
4
‌6

Forward pass Backward pass

ES1 = 0 LC6 = 19
ES2 = 0 + 3 = 3 LC5 = 19 – 6 = 13
ES3 = 3 + 3 = 6 LC4 = min. { 13-7, 19-5 } = 6
ES4 = max. { 3+2,6+0 } = 6 LC3 = min. { 6-0, 13-3, 19-2 } = 6
ES5 = max. { 6+3, 6+7 } = 13 LC2 = min. { 6-3, 6-2 } = 3
ES6 = max. { 6+2, 6+5, 13+6 }= 19 LC1 = 3 – 3 = 0
1-2-3-4-5-6
51 Critical time (1,2) , (2,3) , (3,4) , (4,5) , (5,6)
9
activity Preceding activity Duration
A --- 14
B A 12
C B 16
D B 7
E B 12
F C 20
G C 18
H C 6
I F,G 4
J E,H,I 2
K D,J 3

78
 62

62
62
5 1 6
42 62
21
18
42 4 4
1 14 66
16 6
1 14 66
7
1 14 2 12 3 12
68
2 71
26 7 68 71
26 8 3 9

75 A→B→C→F→I→J→K
1
activity Preceding activity Duration
A --- 5
B --- 2
C A,B 3
D A,B 4
E B 6
F D,E 5
G C,F 3
H D,E 2
I G,H 1

14
5
14
5
17 18
‌3 5
1
3 3 17 18
5
1 6 7
1 4 5 1
1
2 2
4
2 6 9
3
9
2

79
 C.T.= 18 I,G,F,D,A

Program Evaluation and Review 8 1

Technique (PERT)
PERT

Optimistic time ( a )
Pestimistic time ( b )
Most likely time ( m )
(i,j) Expected time ( D )
a  b  4m
D
6
Variance ( V )
2
ba
V  
 6 

 STi  CTi 
Pr  Z  
 V ( i ) 
 
STi
CTi
‌‫‌‌نتثل‬V( μ )

1
80

81
 activity a b m
1,2 2 8 2
2,3 1 11 1.5
2,4 0.5 7.5 1
3,5 1 7 2.5
3,6 1 3 2
4,5 6 8 7
4,6 3 11 4
5,6 4 8 6

activity D V
1,2 3 1
2,3 3 ---
2,4 2 1.36
3,5 3 ----
3,6 2 ----
4,5 7 0.11
4,6 5 ----
5,6 6 0.44
V( μ )‌‌ 2.91
9

6
0
3 18
3
0 12
‌3 2 18
3 3 12
1 3 ‌2 6
5 6
2
7
5
4
‌5

CT =18 (5,6) , (4,5) , (2,4) , (1,2)

 20  18 
Pr  Z i    Pr  Z  1.17   0.879
 2.91 
22 80

3 1

81
 Cn Dn Normal 5
Cc Dc Crash 8

( CTN ) 5
8
( CTC )
T = CTN – CTC 3
Slope 9
Cc  Cn
Slope 
Dn  Dc
Free Float ( FF) 1
FFij = ESj – ESi - Dij

FF
Dc Dn
1

7
1 1 8 ( CTC )

normal Crash
activity Dn Cn Dc Cc
1,2 8 100 6 200
1,3 4 150 2 350
2,4 2 50 1 90
2,5 10 100 5 400
3,4 5 100 1 200
4,5 3 80 1 100
∑ --- 580 --- 1340

82
 2

8
0 11 52
8 2
0 5 52
9 3 1
4
5 51
3 50
50

CTN = 18 , Total Cost = 580

8
0 5 55
6 1
0 5 55
9 1 1
2
1 50
3 7
1

CTC = 11 , Total Cost = 1340

CTN – CTC = 18 – 11 = 7
7

activity slope F.F.

1,2 50 * --------
1,3 100 4–0–4=0
2,4 40 10 – 8 – 2 = 0
2,5 60 * --------
3,4 25 10 – 4 – 5 = 1
4,5 10 18 – 10 – 5 = 5 max.

83
min. { 5, 8-6} (1,2)
=2
(1,2)

8
0 11 51
6 2
0 5 51
9 3 1
4
5 53
3 1
2

Critical Path C.P. is : (1 , 2) , (2 , 5) and Total Cost T.C.= 580+ 2 * 50= 680

min.{ 4 , 10-5 } = 4 (2,5)

8
0 6 58
6 2
0 5 58
9 3 1
4
5 1
3
9 1
9

C.P. is : (1,2) , (2,5) and (1,3) , (3,4) , (4,5)

T.C. = 680 + 4 * 60 = 920
(2,5)
1

84
(2,5)

activity Slope
(2,5) , (1,3) 60 + 100 = 160
(2,5) , (3,4) 60 + 25 = 85
(2,5) , (4,5) 60 +10 =70 min.
(4,5) , (2,5)

8
0 5 55
6 2
0 5 55
9 2 1
4
5 1
3 1
9

C.P. is (1,2) , (2,5) and (1,3) ,(3,4) , (4,5)

T.C. = 920 + 1 * 70 = 990

110 120 55 52
5390

85
 5
C,B,A
A F,E,D
D,B G.I
G,C H
I L,K
H,E J
H,E F N,M
I,M O
O,L,J P
P,N,K
8
activity Pre. Act. Duration activity Pre. Act. Duration
R ---- 24 D C,B 6
E R 16 C A 8
H G 16 B A 16
N P, Q, U, S 8 U F 8
M L,K 8 Q E 12
K H 16 A R 16
P E,D 36 F R 40
S T,M 16 G R 24
L H 24 T G 4
(ans.: R , G , H , L , M , S , N ; 120 )
3
activity Pre. Act. Duration Activity Pre. Act. Duration
A ---- 10 J F 5
B ---- 28 K E,G,H 1
C A 2 L I,J 6
D C 1 M J,L 2
E D 2 N K,M 1
F D 30 O K,M 4
G D 45 P N 1
H B,D 1 Q N, O 1
I E,H 6 R P,Q 1
(ans.: A , C , D , G , K , O , Q , R ; 65)

86
31 9
5.1
Act. A B C D E F G H I
Pre.act. --- --- A A,B A,B C,D A C,D,G E,F,H
Duration 5 7 6 8 7 5 6 9 10
(ans.: 99.6% )
1
Act. A B C D E F G H I
Pre.act. --- --- A,B A,B B D,E C,F D,E G,H
Duration 6 5 7 8 4 6 7 4 X
Z = 1.5 I X
8 39
81 H
51

1 10000
7 1 C
81000
30000
(ans.: a) 4 ; b) 600000 ; c)- 300000 )
1
Act. (a,b,m) Act. (a,b,m)
1,2 5,7,6 3,6 3,5,4
1,4 1,5,3 4,6 4,9,8
1,5 2,6,4 4,7 4,8,6
2,3 4,6,5 5,6 9 , 14 , 10
2,5 6 , 10 , 8 5,7 4,8,6
2,6 8 , 13 , 9 6,7 3,5,4
3,4 5 , 10 , 9
39
( ans.: 98.9% )

87
 7
Normal crash normal crash
Act. Dn Cn Dc Cc Act. Dn Cn Dc Cc
1 , 2 4 100 1 400 3,7 14 120 12 140
1 , 4 9 120 6 180 4,5 15 500 10 750
1 , 3 8 400 5 640 4,7 10 200 6 220
1,6 3 20 1 60 5,6 11 160 8 240
2,3 5 60 3 100 5,7 8 70 5 110
2 , 5 9 210 7 270 6,7 10 100 2 180
3 , 4 12 400 8 800 ∑ --- 2460 -- 4090
( ans.: 33 ; 3750 )

2
normal crash
Act. Dn Cn Dc Cc
1,2 5 1000 4 1400
1,3 9 2000 7 3000
2,3 7 2500 4 3400
2,4 9 2800 7 3400
3,5 5 2500 2 4600
3,6 11 4000 7 7200
4, 6 6 3000 4 4200
5,6 8 800 6 1400
∑ -- 18600 -- 28600
( ans.: 16 ; 24600 )

88
 Sequencing models [2]

Sequencing models
m = 1 , 2 , 3,…. m
idle time

5
8
3
9
1
1
7

Processing n jobs through 1 machine n 5 7

n

Shortest processing time (S.p.t.)

Largest processing time (L.p.t.)

Jobs A B C D E F
Time 2 1 8 7 50 9

Lpt Spt

89
 Processing
sequence jobs time Start Finish
1 C 2 0 2
2 F 4 2 6
3 B 6 6 12
4 D 7 12 19
5 A 8 19 27
6 E 10 27 37
∑ 103
Spt = 103/6 = 17.16 hrs.

Processing
Sequence jobs time Start Finish
1 E 10 0 10
2 A 8 10 18
3 D 7 18 25
4 B 6 25 31
5 F 4 31 35
6 C 2 35 37
∑ 156
Lpt = 156/6 = 26 hrs

Wi ti

8
Jobs A B C D E F
Time ti 10 6 5 4 2 8
Weight Wi 5 10 5 1 3 5
‌
t
t Jobs
10/5 = 2 A
6/10 = 0.6 B
5/5 = 1 C
4/1 = 4 D
2/3 = 0.67 E
8/5 = 1.6 F
B–E–C–F–A–D

91
 Processing n jobs through 2 machines n 8 7

5
8

9
1

idle time 7

B A B,A 3

Jobs 1 2 3 4 5 6
Mach. A 3 12 5 2 9 11
Mach. B 8 10 9 6 3 1

5 8 3 9 1 1
8 3 58 3 1 5 8 1 55
2 9 50 1 1 1 3 1 5

The optimal sequencing is : 4 – 1 – 3 – 2 – 5 – 6

91
 Mach. A Mach. B
jobs Time Start Finish time Start Finish Idle
9 8 0 8 1 8 2 8
5 3 8 1 2 2 51 0
3 1 1 50 1 51 81 0
8 58 50 88 50 81 31 0
1 1 88 35 3 31 32 0
1 55 35 98 5 98 93 9
∑ 1
93
43 – 42 = 1 hr. A
6 hrs. B

B A 9
jobs 5 8 3 9 1 1 7
Mach. A 3 58 51 1 50 55 1
Mach. B 2 50 50 1 58 5 3

5 8 3 9 1 1 7
5 3 58 51 8 1 3 50 55 1
2 1 50 9 50 1 58 7 5 1 3
The optimal sequencing is : 1 – 4 – 5 – 3 – 2 – 7 – 6
Mach. A Mach. B
jobs time Start finish time Start finish idle
1 3 0 3 8 3 11 3
4 6 3 9 6 11 17 0
5 10 9 19 12 19 31 2
3 15 19 34 10 34 44 3
2 12 34 46 10 46 56 2
7 9 46 55 3 56 59 0
6 11 55 66 1 66 67 7
∑ 17
17
67 – 66 = 1 hr. A
17 hrs B

92
Processing n jobs through 3 machines n 3 7

‌ .‌‫≥‌أكاب‌ قت‌على‌التيكةف‌الثينيف‬
.‌‫≥‌أكاب‌ قت‌على‌التيكةف‌الثينيف‬

G,H 5
Hi = Bi + Ci , Gi = Ai + Bi
H,G 8
3

9
B

ABC C,B,A 1

Jobs 1 2 3 4 5 6
Mach. A 3 12 5 2 9 11
Mach. B 8 6 4 6 3 1
Mach. C 13 14 9 12 8 13

Hi = Bi + Ci , Gi = Ai + Bi
jobs 1 2 3 4 5 6
Mach. G 11 3 18 5 9 2 8 1 12 12 4
Mach. H 21 20 13 18 11 6 14

The optimal sequencing is : 4 – 3 – 1 – 6 – 2 – 5

93
 Mach. A Mach. B Mach. C
jobs t. S. F. t. S. F. I. t. S. F. I.
4 2 0 2 6 2 8 2 12 8 20 8
3 5 2 7 4 8 12 0 9 20 29 0
1 3 7 10 8 12 20 0 13 29 42 0
6 11 10 21 1 21 22 1 13 42 55 0
2 12 21 33 6 33 39 11 14 55 69 0
5 9 33 42 3 42 45 3 8 69 77 0
∑ 17 8
77 hrs.
77 – 42 = 35 hrs. A
77 – 45 +17 = 49 hrs B
8 hrs C

Processing n jobs through m machines m n 9 7

m ≥4 m n

≥
≥
m ‌
H,G
Gi = M1 + M2 + ….. + Mm-1 , Hi = M2 + M3 + ….. + Mm

ABCDE 1
machines
jobs A B C D E
1 7 5 2 3 9
2 6 6 4 5 10
3 5 4 5 6 8
4 8 3 3 2 6

Min. { E } = 6 ≥ max. { B, C, D } = 6
H,G
Gi = Ai + Bi + Ci + Di and Hi = Bi + Ci + Di + Ei
machines
jobs 94
 G H
1 17 1 19
2 21 3 25
3 20 2 23
4 16 14 4

The optimal sequencing is : 1 – 3 – 2 – 4

Mach. A Mach. B Mach. C Mach. D Mach. E
Job t. S. F. t. S. F. I. t. S. F. I. t. S. F. I. t. S. F. I.
1 7 0 7 5 7 12 7 2 12 14 12 3 14 17 14 9 17 26 17
3 5 7 12 4 12 16 0 5 16 21 2 6 21 27 4 8 27 35 1
2 6 12 18 6 18 24 2 4 24 28 3 5 28 33 1 10 35 45 0
4 8 18 26 3 26 29 2 3 29 32 1 2 33 35 0 6 45 51 0
∑ 11 18 19 18
51 hrs.
51 – 26 = 15 hrs. A
51 – 29 + 11 = 33 hrs. B
51 – 32 + 18 = 37 hrs. C
51 – 35 + 19 = 35 hrs. D
18 hrs. E

ABCD 7
machines
job A B C D
1 58 14 14 48
2 30 10 18 32
3 28 12 16 44
4 64 16 12 42

Min. { A } = 28 ≥ max { B , C } = 18 and min. { D } = 32 ≥ max { B , C } = 18

B1 + C1 = B2 + C2 = B3 + C3 = B4 + C4 = 28
D A

95
 machines
job A D
1 58 48 3
2 30 2 32
3 28 1 44
4 64 42 4

The optimal sequencing is : 3 – 2 – 1 – 4

Mach. A Mach. B Mach. C Mach. D
job t. S. F. t. S. F. I. t. S. F. I. t. S. F. I.
3 82 0 82 58 82 90 82 51 90 11 90 99 11 500 11
8 30 82 12 50 12 12 52 52 12 21 58 38 500 538 0
5 12 12 551 59 551 530 92 59 530 599 599 92 599 518 58
9 19 551 520 51 520 511 10 58 511 802 18 98 802 810 51
∑ 599 592 29

250 hrs.
250 – 180 = 70 hrs. A
250 – 196 +144 = 198 hrs. B
250 – 208 + 148 = 190 hrs. C
84 hrs. D

n 1 7

A
B
AB
BA

jobs 1 2 3 4 5 6 7 8 9 10
Operating 1 A A A A B B B B B A
order 2 B --- --- B A --- A --- A B
Operating 1 4 3 4 5 1 1 7 3 6 2
Time 2 6 --- --- 2 2 --- 8 --- 7 4

96
 {2 , 3 } A
{6,8} B 3 2
{ 1 , 4 , 10 } B A 2 1
9 5 50
jobs A B
5 8 9 1
9 1 3 8
50 5 8 9

{5,7,9} A B
7 1 1
jobs B A
5 1 1 2
7 7 3 8
9 6 2 7
BA A AB A
10 – 1 – 4 – 2 – 3 – 5 – 9 – 7
AB B BA B
5 – 9 – 7 – 6 – 8 – 10 – 1 – 4
Mach. A Mach. B Idle time
job t. S. F. job t. S. F. job
10 2 0 2 5 1 0 1 1 2 + 22 – 6 = 18
1 4 2 6 9 6 1 7 2 11
4 5 6 11 7 7 7 14 3 14
2 3 11 14 6 1 14 15 4 28 – 11 + 6 = 23
3 4 14 18 8 3 15 18 5 18 – 1 = 17
5 2 18 20 10 4 18 22 6 14
9 7 20 27 1 6 22 28 7 27 – 14 + 7 = 20
7 8 27 35 4 2 28 30 8 15
9 20 – 7 + 1 = 14
10 18 – 2 = 16
A
35 – 30 = 5 B

97
 5
job A B C D E
time 4 3 5 2 6
(ans. : 10 , 14 ) Lpt Spt

B A 8
Job 1 2 3 4 5
Mach. A 5 1 9 3 10
Mach. B 2 6 7 8 4

( ans.: 2-4-3-5-1 , 2 , 3 )

B A 3
Job 1 2 3 4 5
Mach. A 4 5 2 6 1
Mach. B 3 2 5 4 2

( ans.: 5-3-4-1-2 , 2 , 4 )

C B A 9
Job 1 2 3 4 5
Mach. A 3 8 7 5 4
Mach. B 4 5 1 2 3
Mach. C 7 9 5 6 10
(ans.: 4-1-5-2-3 ; 17 , 29 , 7 )

C B A 1
Job 1 2 3 4 5 6 7 8
Mach. A 5 6 2 3 4 9 15 11
Mach. B 4 6 7 4 5 3 6 2
Mach. C 8 10 7 8 11 8 9 13
(ans.: 4-1-3-5-2-8-7-6 ; 26 , 44 , 7 )

98
 C B A 1
Job 1 2 3 4 5
Mach. A 5 8 6 5 7
Mach. B 3 5 2 4 3
Mach. C 4 5 3 2 1

(ans.: 2-1-4-3-5 ; 35 ; 4 , 18 , 20 )

ABC 7

Job 1 2 3 4 5
Mach. A 2 9 5 6 15
Mach. B 4 5 1 2 3
Mach. C 3 8 7 7 7

( ans.: a) 3-4-2-5-1 ; 50 , b) 7 , 35 , 18 )

ABCDE 2
job machines
A B C D E
5 53 1 1 2 51
8 58 55 1 8 2
3 51 9 50 8 51
9 57 1 58 55 50
1 80 50 9 7 57
1 51 1 1 1 53
(ans.:125,32,76 ,83,86,42)
1

Job 5 8 3 9 1 1 7 2 1 50 55 58
No. 5 A A B A B B B B A A A A
Process 8 B B A A B B
Operating 5 51 3 58 9 9 2 9 2 8 2 1 7
time 8 7 3 1 1 7 8

(ans.: mach.A(9-2-4-11-12-10-1-5-6);mach.B(5-6-7-8-3-9-2-4-11);55,0,0)

99
Replacement and Maintenance models [2]

Replacement models 5 2

C
Resale Value S
n
TC
TC
T
n
t maintenance f(t)
n
TC  C   f ( t )dt  S
0

111
 TC 1  
n
T   C  S   f ( t )dt 
n n 0 
T n
T 1  n
 1  n
 C  S   f ( t )dt  
n
 2   n n  f ( t )dt
n  0  0

 
n

 f ( t )dt  F ( t )0n where  f ( t )dt  F ( t )

n 0 n

 F ( n )  F ( 0 ) sin ce F ( 0 )  0
n

 F( n )  f ( n )
n
T 1   1
n
  2  C  S   f ( t )dt   f ( n )  0

n n  0  n
1  
n
f (n)  
n 
C  S  0 f ( t )dt 


T 2  1
2 n
2
n 2
 
3 
n 
C  S  0
f (t ) dt   f (n)  2 f (n)  0  min .

 n n

1 
n
Continuous t g( n )   C  S   f ( t )dt 
n  0


1 n

Discrete t g( n )   C  S   f ( t ) 
n t 0 
2 5
Year (t) 5 8 3 9 1 1 7 2
Maintenance f(t) 100 5800 5100 8500 8200 3700 9700 1100
Resale value (S) 9000 8000 5800 100 100 900 900 900
7000 $
C = 7000
N S C-S f(t) ∑f(t) g(n)
5 9000 3000 100 100 3100
8 8000 1000 5800 8500 3110
3 5800 1200 5100 3700 3511.7
9 100 1900 8500 1200 3010
1 100 1100 8200 2100 3080 →mini.
1 900 1100 3700 58300 3510
7 900 1100 9700 57000 3375.9
2 900 1100 1100 88100 3127.1

111
 800 1000 8
8000

N C-S f(t) ∑f(t) g(n)

1 9000 200 200 9200
2 9000 2200 2400 5700
3 9000 4200 6600 5200 → mini.
4 9000 6200 12800 5450
5 9000 8200 21000 6100

Cost of individual replacement

Cost of grouped replacement

(i)
i
N i   N j  1 Pi  j  1  N 0 Pi  N 1 Pi  1  N 2 Pi  2  .... N i  1 P1
j 1

Average life of items (AL)

n
AL   iPi
i 1

Average failure per period (AF) n

N0
AF 
AL
Cost of individual replacement ( CIR )
CIR  C 1 * AF
Average cost group replacement per period (i)
i
C2 * N 0  C1 *  N j
j 1
ACGRi 
i
ACGR CIR
i ACGRi
i Pi
C1

112
 C2
N0
i = 1 , 2 , 3 , …. , n
n 3

End of week (i) 5 8 3 9 1 1 7 2 1 50 11

Prob.Of failure (Pi) 0.05 0.03 0.01 0.07 0.50 0.51 0.80 0.51 0.55 0.02 0.01
0.1 5.81
5000

N0 = 1000
N1 = N0* P1 = 1000 * 0.01 = 10
N2 = N0*P2 + N1*P1= 1000*0.03 + 10* 0.01 = 30.1
N3 = N0*P3 + N1*P2 + N2* P1 = 1000*0.05+10*0.03+30.1*0.01=50.6
N4 =N0*P4+N1*P3+N2*P2+N3*P1
=1000*0.07+10*0.05+30.1*0.03+50.6*0.01=71.9
N5 =N0*P5+N1*P4+N2*P3+N3*P2+N4*P1
=1000*0.10+10*0.07+30.1*0.05+50.6*0.03+71.9*0.01=104.4
N6 =N0*P6+N1*P5+ N2*P4+N3*P3+N4*P2+N5*P1
=1000*0.15+10*0.10+30.1*0.07+50.6*0.05+71.9*0.03+104.4*0.01=158.8
N7 = N0*P7+N1*P6+N2*P5+N3*P4+N4*P3+N5*P2+N6*P1
=1000*0.2+10*0.15+30.1*0.1+50.6*0.07+71.9*0.05+104.4*0.03+158.8*0.01
=216.4
N8 =N0*P8+N1*P7+N2*P6+N3*P5+N4*P4+N5*P3+N6*P2+N7*P1
=1000*0.15+10*0.2+30.1*0.15+50.6*0.1+71.9*0.07+104.4*0.05+158.8*0.03
+216.4*0.01 = 178.8
N9 = N0*P9+N1*P8+N2*P7+N3*P6+N4*P5+N5*P4+N6*P3+N7*P2+N8*P1
=1000*0.11+10*0.15+30.1*0.2+50.6*0.15+71.9*0.1+104.4*0.07+158.8*0.05
+216.4*0.03+178.8*0.01=155.8
N10 =N0*P10+N1*P9+N2*P8+N3*P7+N4*P6+N5*P5+N6*P4+N7*P3+N8*P2+N9*P1
=1000*0.08+10*0.11+30.1*0.15+50.6*0.2+71.9*0.15+104.4*0.1+158.8
*0.07+216.4*0.05+178.8*0.03+155.8*0.01=145.8
N11 = N0*P11+N1*P10+N2*P9+N3*P8+N4*P7+N5*P6+N6*P5+N7*P4+N8*P3
+N9*P2+N10*P1
= 1000*0.05+10*0.08+30.1*0.11+50.6*0.15+71.9*0.2+104.4*0.15+158.8
*0.1+216.4*0.07+178.8*0.05+155.8*0.03+265.8*0.01=139.1
11
AL   i * Pi  1 * 0.01  2 * 0.03  3 * 0.05  4 * 0.07  5 * 0.1  6 * 0.15  7 * 0.2  8 * 0.15
i 1
 9 * 0.11  10 * 0.08  11 * 0.05  6.84
N 0 1000
AF    146.2 and CIR  C 1 * AF  1.25 * 146.2  182.75
AL 6.84
113
 i
C 2 * N 0  C1 *  N j
End of week j 1
ACGRi=
(i) i
1 1000 * 0.5  10 * 1.25
 512.5
1
2 1000 * 0.5  ( 10  30.1 ) * 1.25
 275.06
2
3 1000 * 0.5  ( 40.1  50.6 ) * 1.25
 204.46
3
4 1000 * 0.5  ( 90.7  71.9 ) * 1.25
 175.81
4
5 1000 * 0.5  ( 162.6  104.4 ) * 1.25
 166.75  min i .
5
6 1000 * 0.5  ( 267  158.8 ) * 1.25
 172.04
6
7 1000 * 0.5  ( 425.8  216.4 ) * 1.25
 186.11
7
8 1000 * 0.5  ( 642.2  178.8 ) * 1.25
 190.78
8
9 1000 * 0.5  ( 821  155.8 ) * 1.25
 191.22
9
10 1000 * 0.5  ( 976.8  145.8 ) * 1.25
 190.33
10
11 1000 * 0.5  ( 1122.6  139.1 ) * 1.25
 188.83
11

(CIR = 182.75) (ACGR5=166.76)

Maintenance Models 8 2

Cost of maintenance ( CM )
Ma int enance Cost per unit ( MC )
CM  * N0
Expected life per unit ( EL )

114
 Keyboard 9
3
End of year (i) 5 8 3 9
Prob. Of failure (Pi) 0.80 0.81 0.98 0.53
91 92
9
3.5

4
AL   i * Pi  1 * 0.20  2 * 0.25  3 * 0.42  4 * 0.13  2.48
i 1

N0 48
AF    19.355 and CIR  C 1 * AF  3 * 19.355  58.065
AL 2.48

N0 = 48
N1 = N0*P1 = 48*0.20 = 9.6
N2 =N0*P2+N1*P1= 48*0.25+9.6*0.20 =13.92
N3 =N0*P3+N1*P2+N2*P1= 48*0.42+9.6*0.25+13.92*0.2=25.344
N4 =N0*P4+N1*P3+N2*P2+N3*P1
=48*0.13+9.6*0.42+13.92*0.25+25.344*0.2=18.821

End of year C2 * N 0  C1 *  N j
j1
(i) ACGRi=
i
1 45  9.6 * 3
 73.8
1
2 45  ( 9.6  13.92 ) * 3
 57.78  min i .
2
3 45  ( 23.52  25.344 ) * 3
 63.864
3
4 45  ( 48.864  18.821 ) * 3
 62.014
4

MC 4
CM  * N0  * 48  61.92
EL 3.1

115
 12.011
17.72
15.18

116
 5
Year 5 8 3 9 1 1
Maintenance cost / year 800 910 120 210 5300 5100
Resale value 50000 2000 7000 1000 8000 5000
51000
(ans.: 4)

8
800 58800

year 1 2 3 4 5 6 7 8
Maintenance Cost 200 500 800 1200 1800 2500 3200 4000
7100 1
100 900

(ans.: )
50000 B,A 3

Year 1 2 3 4 5
Resale 9 9 8 7 5
A Operating cost 1 1 2 3 3
Resale 8 7 7 6 6
B Operating cost 1 2 2 3 4

B,A

(ans.: a) 2 , 3 ; b) A ; c) A )

9
End of week 1 2 3 4 5 6
Prob. Of failure 0.09 0.25 0.49 0.85 0.97 1

117
 5000
0.7 3
(ans.: 2 )

800 1
5000

End of week 10 20 30 40 50
Prob. Of failure 0.05 0.15 0.35 0.65 1
(ans.: 20 ) 8000

118
 Quality Control
and
Reliability
5
8005 2000:9001

8
8000
3- Charles E. Ebeling " An introduction to Reliability and
Maintainability Engineering " ( 1997 ) , McGraw Hill companies ,
INC .

119
 [1]
ISO (T.Q.M.)

Quality 5 1

3
9
1

1
7

5771

111
 5159 3
5131

Statistical Quality Control ( SQC ) 9

5131

Control chart

Total Quality Control ( TQC ) 1

5191

Quality Assurance ( QA ) 1
5120

Total Quality Management ( TQM ) 7

ISO:9000 5127 ISO

Total Quality Management ( TQM ) 8 1

111
 5
8
3
9
1
1
7
2
1

5
8
3
9
1
1
7
2
1
50

112
 5

Control chart
Pareto analysis
Fish bone chart
Run chart
Bar chart
Scatter chart
Flow chart
8

113
 8

9
1

50

55

58

114
115
 Preparation 5

Planning 8

Assessment 3

Implementation 9

Diversification 1

116
 5
8
3

9
1
1
7
2
1
50
55
58
53
59

ISO ISO 9000 3 1

International ISOS
Organization for Standardization

5197

117
 IEC

70
30
Certification
bodies

ISO 9000

BS DIN

118
 8700

Technical Committee (TC) 5

Sub-Committee (SC) 8

Task Group (TG) 3

Technical ISO 9000
committee-176
18

5
8

119
 ISO 9000
Organization 5

Documenation 8

ISO 9000

Document Control 3

121
 Control of Records 9

Auditing 1

Corrective Action 1

121
 8

ISO 9000

122
 ISO 9000 ISO 9000
BSI BS 5750
ISO 9000: 1987

5
ISO 9001
80
ISO 9002
52

ISO 9003

8
ISO 9004

ISO 9000
ISO 9003 ISO 9002 ISO 9001
ISO 8402
ISO 10011

2 80 ISO 9000:1994
58

123
 5
8
3
9
1
1
7
2
1
50
55
58
53
59
51
51
57
52
51
80
ISO 9000:2000

TC-176
5119
8000

124
 8
3
9
1
1
7
2

5
8

9
1

1
7
2

50
55
58

125
 8
3
9

5
8

5
8
3

126
 [2]
Quality Control

Quality

‫التستهلك‬

Quality Control

5
8
3
9
1

127
 ‫‪Control Chart‬‬ ‫‪5 50‬‬

‫‌‌‌‌‌‌الحد‌األعلى ‪UCL‬‬

‫‌‌‌‌‌‌‌‌‌‌‌‌‌‌الحد‌الوسط‬

‫‪LCL‬‬

‫‪5‬‬

‫‪128‬‬
 8
( 10 – 20 )%

5
Systematic Sample
9 2 8
80 81 3
9

X  Chart
R- Chart
  Chart
8

P – Chart
C – Chart
U -Chart

129
 X  Chart 5 5 50

11.7
0.3

m
 X ij
j 1
Xi  Xi 81
m
n
Xi
X i 1

n
j = 1 , 2 , …. , m and i = 1 , 2 , ….. , n
m
n
i j Xij
R
n
 Ri
R i 1
where Ri  X iL  X iS
n
i XiL
i XiS

UCL( X )  X  A2 R
LCL( X )  X  A2 R
m A2

R- Chart 8 5 50

11.7

131
 n
 Ri
R i 1
81
n

UCL( R )  D4 R and LCL( R )  D3 R

m D4 , D3

σ – chart 3 5 50

5
8
m n
 X ij2  m X i
2

j 1
 i
i  and   i 1

m1 n
3
UCL(  )  B2  and LCL(  )  B1 
9

D4 , D3 , B2 , B1 , A2

131
 m A2 B1 B2 D3 D4
2 1.880 0 3.267 0 3.268
3 1.023 0 2.568 0 2.574
4 0.729 0 2.266 0 2.282
5 0.577 0 2.-089 0 2.114
6 0.483 0.030 1.970 0 2.004
7 0.419 0.118 1.882 0.076 1.924
8 0.373 0.185 1.815 0.136 1.864
9 0.337 0.229 1.761 0.816 1.816
10 0.308 0.284 1.716 0.223 1.777
(mm) 5
81

no. of sample X1 X2 X3 X4 no. of sample X1 X2 X3 X4

5 31 90 90 31 59 31 31 31 31
8 31 90 31 31 51 31 31 31 31
3 31 31 31 31 51 31 31 31 31
9 90 31 31 90 57 37 90 95 31
1 31 31 90 31 52 31 31 31 31
1 90 31 31 31 51 31 90 31 31
7 31 31 31 31 80 31 39 39 39
2 95 95 90 37 85 31 90 31 31
1 31 31 31 31 88 31 31 31 31
50 31 31 31 31 83 31 31 37 95
55 31 31 31 90 89 31 90 90 31
58 31 31 31 31 81 31 31 31 31
53 31 31 31 31
Ri Xi
no. of sample Xi Ri no. of sample Xi Ri
1 38.75 4 59 35.50 1
2 37.75 4 51 35.75 1
3 36.75 3 51 36.25 4
4 38.75 4 57 39.25 4
5 39.25 1 52 36.50 4
6 37.00 4 51 37.85 4
7 36.75 3 80 34.25 1
2 39.75 4 85 36.50 5
1 35.50 1 88 35.75 1
50 36.00 0 83 38.00 6
55 38.50 4 89 39.50 1
58 36.00 0 81 36.75 3
53 36.75 3 ∑ 929.25 70
132
 R X
n n
 Ri 70 Xi 929.25
R i 1
  2.8 X i 1
  37.17
n 25 n 25
A2 = 0.729 with m=4 X  Chart
UCL( X )  X  A2 R  37.17  0.729 * 2.8  39.211
LCL( X )  X  A2 R  37.17  0.729 * 2.8  35.129

no. of sample Xi Ri
1 31.81 5
2 31.71 9
57 31.81 9
80 39.81 5
89 31.10 5
X new
R new
929.25  192 70  11
X new   36.86 and R new   2.95
25  5 25  5

UCL( X )new  X new  A2 R new  36.86  0.729 * 2.95  39.011

LCL( X )new  X new  A2 R new  36.86  0.729 * 2.95  34.709

‫مخطط السيطرة النوعية للوسط الحسابي األولي‬

41
8 24
40 5 17
UCL(39.211)
39
38
37 37.17

36
35 LCL(35.129)

34 20
33
0 5 10 15 20 25 30
no. of samples

133
 39.5
39 UCL(39.011)
38.5
38
37.5
37 36.86
36.5
36
35.5
35 LCL(34.709)
34.5
34
0 5 10 15 20 25
no. of samples

R-Chart
R  2.8 , D3  0 , D4  2.282

UCL( R )  D4 R  2.282 * 2.8  6.39 and LCL( R )  D3 R  0 * 2.8  0

7
6 UCL(6.39)
5
4
3 2.8
2
1
0 LCL( 0 )
0 5 10 15 20 25 30
no. of samples

Ri

134
 σ- chart
no. of samples σi no. of samples σi
1 1.89 14 0.58
2 2.06 15 0.50
3 1.50 16 1.89
4 1.89 17 1.71
5 0.50 18 1.73
6 2.00 19 2.06
7 1.50 20 0.50
8 1.89 21 2.38
9 0.58 22 0.50
10 0.00 23 2.58
11 1.73 24 0.58
12 0.00 25 1.50
13 1.50 ∑ 33.55

m
 X ij2  m X i
2

j 1 36 2  40 2  40 2  39 2  4 * ( 38.75 )2
i   1   1.89 ....etc .
m1 41
33.55
  1.34
25
UCL(  )  B2    2.266  1.34  3.04 and LCL(  )  B1    0  1.34  0

3.5
3 UCL(3.04)
2.5
2
1.5 1.34
1
0.5
0 LCL( 0 )
0 5 10 15 20 25 30

σi

135
 P- Chart 9 5 50

P( 1  P ) P( 1  P )
UCL( P )  P  3 * and LCL( P )  P  3 *
m m
m
n
 Pi
P i 1

Pi

5
500 8
30
800 81 8

2 , 3 , 4, 0 , 5, 2 , 13 , 2, 3 , 10, 3 , 0 , 4, 2 , 1, 4 , 5 , 3, 5 , 4, 1 , 2, 6 , 2 ,5

n defective Pi n defective Pi
1 2 0.010 14 2 0.010
2 3 0.015 15 1 0.005
3 4 0.020 16 4 0.020
4 0 0.000 17 5 0.025
5 5 0.025 18 3 0.015
6 2 0.010 19 5 0.025
7 13 0.065 20 4 0.020
8 2 0.010 21 1 0.005
9 3 0.015 22 2 0.010
10 10 0.050 23 6 0.030
11 3 0.015 24 2 0.010
12 0 0.000 25 5 0.025
13 4 0.020 ∑ 91 0.455

136
 n
 Pi 0.455
P i 1
  0.0182
n 25

P( 1  P ) 0.0182 * ( 1  0.0182 )
UCL( P )  P  3 *  0.0182  3 *  0.0466
m 200

P( 1  P ) 0.0182 * ( 1  0.0182 )
LCL( P )  P  3 *  0.0182  3 *  0.010  0
m 200
Pi Pi

n Def. Pi
7 53 0.011
50 50 0.010
∑ 83 0.551

0.455  0.115
P new   0.0147
25  2
0.0147 * ( 1  0.0147 )
UCL( P )new  0.0147  3 *  0.0402
200

0.0147 * ( 1  0.0147 )
LCL( P )new  0.0147  3 *  0.0108  0
200

0.07 7

0.06 10
0.05 UCL ( 0.0466 )
0.04
0.03
0.02 P (0.0182)
0.01
0 LCL ( 0 )
0 5 10 15 20 25 no.of 30

137
0.045
0.04
0.035 UCL ( 0.0466 )
0.03
0.025
0.02
0.015 P (0.0147
0.01 )
0.005
0 LCL ( 0 )

0 5 10 15 20 no.of 25
samples

8 50

3
T 1
T
T
N  N


138
 N 1/2 area Def. %
0 00 0.100 500
0.81 0.905 20.8
0.10 0.301 15.2
0.71 0.887 91.9
5.00 0.511 30.2
5.81 0.501 85.8
5.10 0.017 53.9
5.71 0.090 2.0
8.00 0.083 9.1
8.81 0.058 8.9
8.10 0.001 5.8
8.71 0.003 0.1
3.00 0.005 0.8

3
σ = 1.34 5
T = 39.011 – 36.86 = 2.151
3 3 * 1.34
  1.87  1
T 2.151

T 2.151
N    1.6
 1.34
5.1
55

139
d
d

d Consumer's risk

Producer's risk
d1 d2 d1
(1-P1) P1
d2

P2

n
d
d
d

141
 ‫‌‬
‫تفحص‌عيةف‌حجتهي‌‪‌n‬م ‌التفبدات‌‌ ‌‬

‫‪d‬‬

‫‪d‬‬

‫‌‬
‫تب ض‌الد عف‬

‫‪d1‬‬
‫‪d2‬‬
‫‪d3‬‬

‫‪d11‬‬
‫‪d12‬‬
‫‪d21‬‬

‫‪141‬‬
 d22

r dr

n Binomial distribution
x p

P ( x )  C xn . p x ( 1  p )n x , x  0 ,1 ,2 ,..., n

n!
Where : C xn  , n!  n( n  1 )( n  2 ).... 2.1
x!.( n  x )!

142
 50 9

80

0.03 0.05
0.081
0.80

P = P1(0) + P1(1) . P2(0) + P1(1) . P2(1) + P1(2) . P2(0)

x P1(x)
x P2(x)

143
 P1 ( x )  C x10 p x ( 1  p )10  x , x  0 ,1 ,2 ,...,10

P1 ( 0 )  C 010 p 0 ( 1  p )10 0  ( 1  p )10

P1 ( 1 )  C 110 p 1 ( 1  p )10  1  10 p( 1  p )9

P1 ( 2 )  C 210 p 2 ( 1  p )10  2  45 p 2 ( 1  p )8

P2 ( x )  C x20 p x ( 1  p )20  x , x  0 ,1 ,2 ,..., 20

P2 ( 0 )  C 020 p 0 ( 1  p )20 0  ( 1  p )20

P2 ( 1 )  C 120 p 1 ( 1  p )20  1  20 p( 1  p )19

P ( p )  ( 1  p )10  10 p( 1  p )9 ( 1  p )20  10 p( 1  p )9 .20 p( 1  p )19

 45 p 2 ( 1  p )8 ( 1  p )20


P ( p )  ( 1  p )10 1  10 p( 1  p )18 ( 1  23.5 p ) 
p
p 0.01 0.03 0.05 0.10 0.15 0.20 0.25 0.30
P 0.998 0.955 0.857 0.524 0.269 0.129 0.062 0.029

0.081
1 – P(0.025) = 1 – ( 1 – 0.025)10 { 1 + 10 * 0.025* (1 – 0.025)18(1 + 23.5*0.025)}
= 0.03
3
58.1 0.80

144
 10 5
80
9 3 8 1 3 5 3 8 1 3 1 3 8 1 8 8 5 3 8 5
( ans.0 , 0.1533)

1 50 8

measurements
n X1 X2 X3 X4 X5
1 1.04 1.01 0.98 1.02 1.00
2 1.02 0.97 0.96 1.01 1.02
3 1.01 1.07 0.99 1.03 1.00
4 0.98 0.97 1.02 0.98 0,98
5 0.99 1.03 0.98 1.02 1.01
6 1.02 0.95 1.04 1.02 0.95
7 1.00 0.99 1.01 1.02 1.01
8 0.99 1.02 1.00 1.04 1.09
9 1.03 1.04 0.99 1.02 0.94
10 1.02 0.98 1.00 0.99 1.02

( ans. a) 0.9679 , 1.0429 , b) 0 , 0.137 )

3

Date Sample size No. of defectives Date Sample size No. of defectives
1 200 3 12 200 3
2 200 1 13 200 6
3 200 0 14 200 8
4 200 2 15 200 5
5 200 4 16 200 9
6 200 1 17 200 3
7 200 2 18 200 1
8 200 0 19 200 0
9 200 3 20 200 2
10 200 2 21 200 3
11 200 1 22 200 1
(ans. 0 , 0.0332 )

145
 9
N X1 X2 X3 X4 X5 X6
1 0.498 0.492 0.510 0.505 0.504 0.487
2 0.482 0.491 0.502 0.481 0.496 0.492
3 0.501 0.512 0.503 0.499 0.498 0.511
4 0.498 0.486 0.502 0.503 0.510 0.501
5 0.500 0.507 0.509 0.498 0.512 0.518
6 0.476 0.492 0.496 0.521 0.505 0.490
7 0.483 0.487 0.495 0.488 0.502 0.486
8 0.502 0.500 0.511 0.496 0.500 0.503
9 0.492 0.504 0.472 0.515 0.498 0.487
10 0.511 0.522 0.513 0.518 0.520 0.516
11 0.488 0.512 0.501 0.498 0.492 0.498
12 0.504 0.502 0.496 0.501 0.491 0.496
13 0.501 0.413 0.499 0.496 0.508 0.502
14 0.489 0.491 0.496 0.510 0.508 0.503
15 0.511 0.499 0.508 0.503 0.496 0.505
( ans. 0.0002 , 0.0158 )

9 81 1
 X i  160.25
 i  2.05  Ri  2.19
1.32 1.99 1.82 1.12

( ans. a) yes , b) no , c) yes )

146
 [3]
Reliability

Reliability

5
8

Continuous Random Variable T

Reliability function T 0
R( t )  Pr( T  t ) t  0
where 1) 0  R( t )  1
2) R( 0 )  1
3) lim R( t )  0
t 

t
F ( t )  1  R( t )  Pr( T  t )
where 1 ) 0  F( t )  1
2) F(0 )  0
3 ) lim F ( t )  1
t 

Cumulative distribution function ( c.d.f. ) F( t )

Failure function
[a,b]
b
Pr( a  T  b )  F ( b )  F ( a )  R( a )  R( b )   f ( t )dt
a

Probability distribution function ( p.d.f.) f( t )

147
 d d
f(t ) F ( t )   R( t )
dt dt
where 1) f (t ) 0
t
2)  f(t ) 1
0

t 
F ( t )   f ( u )du and R( t )   f ( u )du
0 t

T 5
Compressor
0.001
f (t ) t0
( 0.001t  1 )2
0 o .w
500
0.11
[ 10 , 100 ]

 
0.001  1  1 1 1
R( t )   dt    0.001t  1      R( t ) 
t ( 0.001 t  1 ) 2
t  0.001t  1 0.001t  1
1
R( 100 )   0.909
0.001* 100  1

1 1  1 
R( t )   0.95  t   1   52.6 hrs .
0.001t  1 0.001  0.95 

1 1
Pr( 10  T  100 )  R( 10 )  R( 100 )    0.081
0.001* 10  1 0.001* 100  1

Mean Time of Failure ( MTTF)

 
MTTF  E ( t )   t . f ( t )dt   R( t )dt
0 0

Variance

 2  V ( t )   t 2 . f ( t )dt  ( MTTF )2
0

148
 Standard deviation
p.d.f. 8
f ( t )  0.002 * e 0.002t t0
0 o .w
MTTF

 
MTTF   t . f ( t )dt   0.002t * e 0.002t dt
0 0


MTTF   t * e 0.002t
 e 0.002t
  
   t * e 0.002t 
1 
e 0.002t   500 hrs .
0
 0.002 0
t
where lim 0 by L' Hopital rule
t  e 0.002t

 
   t f ( t )dt  ( MTTF )   t 2 ( 0.002 * e 0.002t )dt  ( 500 )2
2 2 2

0 0


 
e 0.002 t   500   250000
2 t 0.002 t 2
    t 2 e 0.002 t  
2 2
e hrs .2
 0.002 0.00004 0
2
t t
By L' Hopital rule lim 0.002t  0 and lim 0.002t  0
t  e t  e

   2  250000  500 hrs .

Failure Hazard rate function

t + ∆t , t rate function
t
t
   ( t )dt
f (t )
Pr( t  T  t  t / T  t )   ( t )   R( t )  e 0
R( t )
3
 ( t )  5 * 10 6 t

149
 t
0.12

t t
   ( t )dt   5* 10 6 tdt
R( t )  e 0  0.98  e 0
6 t 2 ln 0.98
0.98  e  2.5* 10  t  90 hrs .
 2.5 * 10 6

9
2
t
R( t )  1  where 0  t  a
a2
a
p.d.f.
t
MTTF
d d t 2  2t 2
f ( t )   R( t )    1  2   2
dt dt  a  a
f ( t ) 2t  t2  2t
( t )   2   1  2   2
R( t ) a  a  a  t2
a
a
 t2   a
t3  2
MTTF   R( t )dt    1  2 dt  t  2   a
0 0 a   3a  0 3

Conditional Reliability
T0 t
 T t  R( T0  t )
0

R( t / T0 )  exp    ( t )dt  
 T  R( T0 )
0

0.5
1  t 
( t )    where t in years 1
2000  1000 
1 )R( t )  0.90 and 2 )R( t / 0.5 )  0.90
t
   ( t )dt 1  t  0.5 t 0.5
     
2000 1000 
R( t )  e 0 e e  0.90  1000 
5
 t  1000 * (ln 0.09 )  11.1 years
2

151
 0.5
 t  0.5 
 
R( t  0.5 ) e  1000 
R( t / 0.5 )   0.5
 0.90
R( 0.5 )  0.5 
  
e  1000  8
2
 0.5  0.5 
 t  1000   ln 0.90   0.5  15.813 years
  1000  

R( t / T0 )  ( t )  t where   0 1

t t
   ( t )dt    tdt  t 2
2
R( t )  e 0 e 0 e

 ( t T0 )2 
R( t  T0 ) e 2  ( t 2  2T0 t )
R( t / T0 )     e 2
R( T0 )  T0 2
e 2

9 R( t / T0 ) 7
( t  T0 )2
1
R( t  T0 ) a 2 a 2  ( t  T0 )2
R( t / T0 )   
a 2  T0
2 2
R( T0 ) T0
1 2
a

The Exponential Reliability function

exponential distribution
Constant Failure Rate ( C.F.R.)
( t )   t 0
R( t )  e  t , F ( t )  1  e  t
1
f ( t )   e  t , MTTF 

1
2  and R( t / T0 )  R( t )
2
0.00039 Microwave transmitter 2

151
  ( t )  0.00034 R( t )  e 0.00034t  R( t / T0 )
,
F ( t )  1  e 0.00034t f ( t )  0.00034 * e 0.00034 t
,
1 1
MTTF   2941.18hrs . and  2  2
 8650519hrs .2
0.00034 ( 0.00034 )
30
t  30 * 24  720  R( 720 )  e 0.00034*720  0.783

Weibull distribution in reliability

 1
t
( t )    ,  ,  0 , t  0
  
where  is scale parameter
 is shape parameter

 
t t
   
   
R( t )  e , F( t )  1  e

 1 t
t   1 
f(t )   e  
, MTTF   .   1 
    
 2   1  
2

      1       1   
2 2

        
  t  T0    T0   
and R( t  T0 )  exp       
       

where  (  )   y   1 e  y dy  (   1 ). (   1 )
0

 ( )
1
Shape parameter (β) = 1 / 3 and Scale parameter (θ) = 16000

152
 1
1
1
 t 3
2

1 ) ( t )  3
   0.0132283* t 3
1600  16000 
1
 
t 3 1

0.0132283* t 3
2 ) R( t )  e  16000 
e
1
0.0132283* t 3
3 ) F( t )  1  e 1
1
1  t 3 1
 t 
1  2
3  
 0.0132283* t 3 e 0.0132283* t
3
4 ) f(t )  3
 e  16000 
16000  16000 
1 
5 ) MTTF  16000 *   1  1   16000 *  ( 4 )  16000 * 3!  96000hrs .
3 
 2   1  
2


6 )   ( 16000 )   1  1      1  1     ( 16000 )2  ( 7 )  (  ( 4 ))2
2 2

 3   3   

 
 ( 16000 )2 6!( 3! )2  1.75104 * 10 11    418454.3

 1 1

  t  T0  3  T0  3 
7 ) R( t / T0 )  exp     
  16000   16000  
 

R( t / 10 )= 0.90
 1 1

  t  10  3  10  3 
0.90  exp     
  16000   16000  
 
3
 1

 10 
 t  16000   ln 0.90   10  101.24 hrs .
3

 16000  
 

Serial configuration 1
Parallel configuration 2
Combined series-parallel system 3
Serial configuration 5

1 2 3 n
N

153
 t System Reliability RS( t )
n
RS ( t )   Ri ( t )
i 1

t i Ri( t )

exponential dist.
n  i t n
RS ( t )   e  RS ( t )  e   S t where  S    i
i 1 i 1

Weibull dist.
i i  i 1
n   t    n t   n
  t 
RS ( t )   exp      RS ( t )  exp       and  ( t )   i  
i 1    i    i 1   i   i 1  i  i 

50
MTTF RS( 100) = 0.95

 100 S ln 0.95
RS ( 100 )  e  0.95   S   0.0005129
 100
0.0005129
  0.000128
4
1 1
MTTF    7812.5
 0.000128

55

Component Scale parameter Shape parameter

1 100 1.20
2 150 0.87
3 510 1.80
4 720 1.00

t = 10

154
   t 1.20 
 t   
0.87 1.80
    t   t 
RS ( t )  exp            
   100   150   510   720   
  

  10 1.20 
 10   
0.87 1.80
     10   10 
RS ( 10 )  exp           0.8415
   100   150   510   720   
  

β n
‌ :‌‫‌ عليه‌ إن‬،‌)‌θ‫ه‬ ‌‫‌تكون‬θ
1

 t 
  n  1   
R( t )  exp      where       
      i  1   i  
Jet engine 58

‌ θ5 = 9300 , θ4 = 4780 , θ3 = 5850 , θ2 = 7200 , θ1 = 3600 ‌ ‌‌β‌=‌5.1

MTTF

1

 1  1.5
 1 
1.5
 1 
1.5
 1 
1.5
 1 
1.5
 1.5
              1842.7
 3600   7200   5850   4780   9300  
1   1 
MTTF   .   1   1842.7 *    1   1842.7 * 0.9033  1664.5
   1.5 
  t     t  1.5 
RS ( t )  exp      exp     , t0
       1842.7  

Parallel configuration 3
Redundante

155
 1

t RS ( t )
n
RS ( t )  1   ( 1  Ri ( t ))
i 1

t i Ri ( t )

 i t
n
RS ( t )  1   ( 1  e )
i 1

i λi
53

 i t
n
 1t  2 t  1t  2 t ( 1  2 )t
RS ( t )  1   ( 1  e ) 1 (1 e )( 1  e ) e e e
i 1

 dt  1  1  
 
1t  2 t ( 1  2 )t 1
MTTF   RS ( t )dt   e e e
0 0 1 2 1  2
59
MTTF RS ( 1000 ) = 0.95

RS ( 1000 )  1  ( 1  e 1000t )( 1  e 1000t )  0.95  2e 1000   e 2000 

Let e 1000   X  X 2  2 X  0.95  0
either X  1.223606798    0.000201802 neglicted
or X  0.776393202    0.000253096
1 1
MTTF    3951
 0.000253096

156
 
1 1 1 2 1
MTTFS   RS ( t )dt       5927
0      0.000253096 2 * 0.000253096

Combined series- parallel system 3

Series-parallel system

1 2

4 5 6

2
RS ( t )   Ri ( t )
1
i 1

RS ( t )  R3 ( t )
2

6
R S ( t )   Ri ( t )
3
i4

3
RS ( t )  1   ( 1  RS ( t ))
i
i 1

parallel-series system

1 3 5

2 4 6

157
 2
RS ( t )  1   ( 1  Ri ( t ))
1
i 1
4
RS ( t )  1   ( 1  Ri ( t ))
2
i3
6
RS ( t )  1   ( 1  Ri ( t ))
3
i 5
3
RS ( t )   RS ( t ) i
i 1

Mixed parallel-series and series-parallel

1 2 5

3 4 6

Series- parallel parallel

series

2
RS ( t )   Ri ( t )
11
i 1
4
RS ( t )   Ri ( t )
12
i3
2
RS ( t )  1   ( 1  RS ( t ))
1 1i
i 1
6
RS ( t )  1   ( 1  Ri ( t ))
2
i 5
2
RS ( t )   RS ( t ) i
i 1

51
R
R = 0.90

158
 R

R R

R
R

R R R

G4
G1 G2
R

R R

R
R

G3
R R R

RG 1  1  ( 1  R )2  R( 2  R )
RG 2  R * RG 1 * R  R 3 ( 2  R )
RG 3  R3
RG 4  1  ( 1  RG 2 )( 1  RG 3 )  R 3 ( R 4  2 R 3  R  3 )

RS  RG 4 * R  R 4 ( R 4  2 R 3  R  3 )
at  
R  0.90  RS  ( 0.9 )4 ( 0.9 )4  2( 0.9 )3  0.9  3  0.8517

51

159
 0.90

0.95 0.80
0.80

0.80

0.90 0.80

G3
G2
G1
0.90
G4
0.95 0.80
0.80

0.80

0.90 0.80

RG 1  1  ( 1  0.9 )( 1  0.8 )  0.98

RG 2  RG 1 * 0.95  0.98 * 0.95  0.931

RG 3  1  ( 1  0.931 )( 1  0.90 )  0.9931

RG 4  1  ( 1  0.80 )3  0.992

RS  RG 3 * RG 4  0.9931* 0.992  0.9852

High-level and low-level redundancy

High-level redundancy

161
 R1 R2 Rn

R1 R2 Rn

R1 R2 Rn

Low-level redundancy

R1 R2 Rn

R1 R2 Rn

R1 R2 Rn

Rhigh  1  ( 1  R .R )( 1  R .R )  2 R 2  R 4

Rlow  1  ( 1  R )( 1  R )1  ( 1  R )( 1  R )  ( 2 R  R 2 )2

Rlow  Rhigh  ( 2 R  R 2 )2  2 R 2  R 4  2 R 2 ( R  1 )2  0
Rhigh Rlow
57
0.20 Power Supply
0.90 Receiver
0.85 Amplifier

161
 0.8 0.9 0.85

0.8 0.9 0.85

Low – level Redundancy

0.8 0.9 0.85

0.8 0.9 0.85

High – level Redundancy

   
Rlow  1  ( 1  0.8 )2 1  ( 1  0.9 )2 1  ( 1  0.85 )2  0.929

Rhigh  1  ( 1  0.8 * 0.9 * 0.85 )2  0.849

162
 5
1
R( t )  , t0 , t in hours
0.001t  1
5000 500
IFR DFR
( ans.: a) 0.909 , 0.5 ; b) DFR )

p.d.f. 8
f ( t )  0.01 , 0  t  100 days

( ans.: a)1-0.01t , b) 1/(100-t) , c) 50 ; d) 28.868 )

3
3t 2
f(t ) 9 , 0  t  1000 hrs .
10
500

0.11
( ans.: a) 0.001 , b) 750 ; c) 215.44 )

R( t )  e  0.001 t
, t0 9
500

10 50
50 0.11
( ans.: a) 0.7289 , c) 0.8651 ; d) 12.89 )

1
200
f(t ) , t0
( t  10 )3

163
 0.11
CFR IFR DFR
2
( ans. : a) f( t )= 100/ (t + 10 ) , 0.8264 , b) 10 , c) 0.2598 ; d) DFR )

Uniform dist. p.d.f. 1

1
f(t ) , 0tb
b
σ , MTTF , λ( t ) , R ( t ) , F ( t )
( ans. : F(t)= t / b , R(t)=1 – t / b , λ (t) = 1 / (1 – b ) , MTTF= b / 2 ; σ = b / 2√3)

Fuel injection 7
3

R( t )  ( t  1 ) 2
, t  0 in years
0.51
1
( ans. : 0.2806 ; 0.0906 )

‌ CFR 2
3  0.0025 , 2  0.015 , 1  0.002
( ans. : a) R(t)=exp(-0.0195t) , b) 51.282 )

MTTF = 1100 CFR 1

800
0.10
800
( ans.: a) 0.8338 , b) 115.897 , c) 0.9724 )

5000 λ = 0.0004 CFR 50

( ans.: 0.9608 ; 0.6703 ) 5000 500

Power unit 55
0.11 1

164
 CFR

( ans.: a)292.398 , 584.795 , 194.932 ; 97.466 , b) 0.9975 , 146.199 )

58
0.03581
0.11
( ans.: 4.69 ) 89

λ(t)=0.00021 Electronic Circuit Board 53

( ans.: 0.9932 ) 5000

Weibull 59
Shape parameter = 1.4 , Scale parameter = 550
500
(ans.: a) 0.9122, b) 501.47 , c) 359.9 , d)110.224) 0.10

Rectifier Power Supply 51

θ2 = 18.5 , θ1 = 12 ‌‫‌‌مختلفف‌بحيث‬θ‌‌‫‌‌‌ إن‬β = 2.1‌
‌ .‌0.10‌‫‌ العتب‌التصتم‌لوحدة‌تجهيز‌القدرة‌بتعوليف‬،‌‫‌أ جد‌‌متوسط‌زم ‌العطل‬.‌θ3=21.5 ,
( ans.: 8.2627 ; 3.1948 )
‌
‌ :‌‫‌مي‌او‌العدد‌األعظم‌م ‌التبكايت‌التتتيثلف‌ التستقلف‌الت ‌لهي‌توزنع‌ نال‌بيلتعلتيت‬-51
Shape parameter = 1.3 , Scale parameter = 10000
500 0.11
(ans.: 21 ; 888.111 )

57
0.5
 t 
 ( t )  0.003  , t  0 in hours
 500 

165
 10
0.10

10 10
(ans.:a)0.969 , b) 111.538 , c) 451.375 ; d)0.9438 )

Pressure gauge 52
Shape parameter = 2.1 , Scale parameter =12000
1000

1000 5
8
3
(ans.: a) 0.853 , b) 10628 , 5315.8 , c) 0.403 ,d)0.978 , 18777.638, 0.356)

Cyclone-365 51
1
f(t ) , t0
( t  1 )2

1
0.111
( ans.: a) 0.963 , b) 0.111)

500 80
MTTF = 1000 CFR
‌‫‌‌مبتاطف‌على‌التوال ‌مع‌مبكاف‌لهي‬θ = 10000 , β = 2
(ans.: b) ‌‌‌‌‌‌.‌‌0.00001‌‫‌بةساف‌عطل‌قدراي‬CFR ‌ ‫توزنع‌أس‬

β = 0.80 85
0.11 θ
(ans.: 5588.23 )

166
 88

0.90 0.90

0.97

0.90 0.90

0.95 0.95

0.70

0.80 0.80

0.70
0.80

0.80 0.90 0.90

(ans.: a) 0.994 , b) 0.940 )

R 0.11 ‌-83

R R

(ans.: 0.99 )

MTTF -89
0.10 500
CFR

167
(ans.: a) 787.4 , b) 486.6 )

500 81

β = 1.2 , θ = 840
λ = 0.0001 CFR
(ans.: a) 0.7919 , b) 0.9704 )

Structure function 81

R(A) = 0.9 0

R(B) = 0.80 R(C) = 0.80

R(B)= 0.90

R(D)= 0.98
R(A)= 0.95

R(C)= 0.90

(ans.: a) RS(t)=R(A)+R(B).R(C)-R(A).R(B).R(C);0.964 ,
b) RS(t) = R(A).R(D) [ R(C)+R(B) –R(B).R(C) ] ; 0.9217 )

168