Documente Academic
Documente Profesional
Documente Cultură
1. Prezentare general
2. Probleme rezolvate
2.1 Programare liniar i ntreag (Linear and Integer
Programming)
2.2 Modelarea grafurilor Network Modelling
2.2.1 Problema de transport
2.2.2 Problema drumului minim
2.3 Analiza drumului critic
2.4 Echilibrarea liniilor de fabricaie
2.5 Teoria stocurilor EOQ
2.6 Fire de ateptare
2.7 Grafice de control al calitii
Win QSB
1. Prezentare general
Modulele oferite de produs sunt:
1. Acceptance Sampling Analysis Analiz de ncadrare n limite
2. Aggregate Planning Planificare agregat
3. Decision Analysis Analiz decizional
4. Dynamic Programming Programare dinamic
5. Facility Location and Layout Amplasarea ntreprinderii
6. Forecasting - Previziune
7. Inventory Theory and System Teoria i sistemul stocurilor
8. Job Scheduling Planificarea operaiilor
9. Linear and Integer Programming Programare liniar i ntreag
10. Linear and Integer Goal Programming - Programare liniar i
ntreag cu funcie obiectiv
11. MarKov Process Procese Markov
12. Material Requirements Planning Planificarea necesarului de
materiale
13. Network Modeling Modelarea grafurilor
14. Nonlinear Programming Programare neliniar
15. PERT/CPM
16. Quadratic Programming Programare ptratic
17. Queuing Analysis Analiza firelor de ateptare
18. Queuing System Simulation Simularea sistemelor cu fire de
ateptare
19. Quality Control Chart Grafice de control al calitii
Meniul principal cuprinde urmtoarele opiuni:
1. File crearea unei probleme noi, ncrcarea unei probleme
existente, salvarea sau imprimarea unei probleme, setarea
parametrilor de imprimare
2. Probleme rezolvate
2.1 Programare liniar i ntreag (Linear and Integer
Programming)
Modulul rezolv probleme de programare liniar i de programare
liniar n numere ntregi. Aceste probleme presupun existena unei funcii
obiectiv i a unui numr limitat de restricii liniare. n cazul problemelor de
programare liniar, variabilele pot lua valori reale, dintr-un anumit interval
C1 X1 + C2 X2 + ... + Cn Xn
A11 X1 + A12 X2 + ... + A1n Xn b1,
A21 X1 + A22 X2 + ... + A2n Xn b2,
A31 X1 + A32 X2 + ... + A3n Xn = b3,
... etc.
a X1 b, 0 X2 , ..., etc.
Forma normal
Forma normal este foarte asemntoare cu reprezentarea
convenional a problemelor de programare liniar. Problema e dispus pe
mai multe rnduri, dar pe doar dou coloane.
Pe rnduri se reprezint funcia obiectiv, restriciile, tipul variabilelor,
intervalul n care pot lua valori variabilele. Valorile efective se nscriu n
coloana a doua din acest tabel.
Meniul Edit conine opiuni ce permit modificarea tipului funciei
obiectiv, numelor pentru restricii, introducrea sau tergerea unor variabile,
adugarea sau tergerea de restricii.
Funcia obiectiv i restriciile se introduc sub forma unor funcii
liniare obinuite.
Exemple de funcii obiectiv: "X + Y" sau "3 A + 4 B + 5.12 C"
Exemple de restricii: "2 X + 3 Y <= 180" sau "3 A + 4 B + 5 C >= 2,000"
Limitele implicite pentru variabile sunt ntre 0 i infinit, valori
specificate cu ajutorul urmtoarelor restricii: (>=0, <=M), unde M
reprezint un numr foarte mare.
Dup introducerea problemei, aceasta poate fi rezolvat pas cu pas
opiunea Solve and Display Steps, sau direct opiunea Solve the Problem.
n cazul n care tipul uneia dintre variabile este specificat a fi ntreg sau
binar, modulul va rezolva automat problema dup metoda Branch and
bound. Altfel, se utilizeaz algoritmul Simplex.
Dup rezolvarea direct, se afieaz
rezumatul soluiei, dac problema are o soluiei optim;
analiza problemelor nefezabile;
evidenierea neaparteneei la intervalele stabilite pentru variabile
sau pentru funcia obiectiv.
Dac se alege modul de rezolvare pas cu pas, se va afia fiecare
iteraie din rezolvarea problemei, prin selectarea succesiv a opiunii Solve
and Display Steps.
Exemplu:
S.C. Electronic Combinations S.A. produce sisteme radio portabile i
are patru canale de distribuie posibile pentru un nou produs:
1. Distribuitori de echipamente de telecomunicaii
2. Distribuitori de echipamente pentru afaceri
Canal de distribuie
Distribuitori de echipamente
de telecomunicaii
Distribuitori de echipamente
pentru afaceri
Reea naional de magazine
Comenzi prin pot
Profit
unitar
(EUR)
90
Cost unitar
de publicitate
(EUR)
10
Efort
unitar
de vnzare
2 ore
84
3 ore
70
60
9
15
3 ore
0 ore
Decision
Variable
Solution
Value
Unit Cost
or
Profit c(j)
Total
Contribu
tion
Reduce
d
Cost
Basis
Status
Allowable
Min. c(j)
Allowable
Max. c(j)
X1
25.0000
90.0000
basic
84.0000
X2
425.0000
84.0000
basic
50.0000
90.0000
X3
150.0000
70.0000
basic
-M
87.0000
X4
60.0000
2,250.00
00
35,700.0
000
10,500.0
000
0
45.000
0
at
bound
-M
105.0000
Objective
Function
(Max.) =
Right
Hand
Side
Slack
Shado
w
Price
Allowable
Allowable
Constraint
Left
Hand
Side
Min. RHS
Max. RHS
3.0000
4,950.0000
5,850.0000
25.000
0
0
1,775.0000
515.0000
603.5714
60.000
0
17.000
0
200.0000
C1
C2
3
4
Direction
<=
48,450.0
000
<=
C3
5,000.00
00
1,775.00
00
600.0000
5,000.00
00
1,800.00
00
600.0000
C4
150.0000
>=
150.0000
or
Surplu
s
La
De la
Fabrica 1
Fabrica 2
Fabrica 3
Necesar (buc)
Depozit 1
Depozit 2
Depozit 3
5
8
9
300
4
4
7
200
3
3
5
200
Capacitate
(buc.)
100
300
300
Figura 4.1
Figura 4.2
Total
Cost
500
800
300
1800
500
Reduced
Cost
0
0
0
0
0
Figura 4.3
Rezultatele obinute:
Solution for Transport: Minimization (Transportation Problem)
07-21From
To
Shipment
Unit
2003
Cost
1
Fabrica 1
Depozit 1
100
5
2
Fabrica 2
Depozit 2
100
4
3
Fabrica 2
Depozit 3
200
3
4
Fabrica 3
Depozit 1
200
9
5
Fabrica 3
Depozit 2
100
7
Total Objective
Function Value = 4000
Total
Cost
500
400
600
1800
700
Reduced
Cost
0
0
0
0
0
Objective
Total
Cost
500
800
900
1000
0
Reduced
Cost
0
0
0
0
0
Figura 4.4
Opiunea Solve and Analyze -> Solve the Problem are ca efect
afiarea rezultatelor ntr-o fereastr nou.
Solution for Shortest Path Problem El Paso
06-29- From
To
2003
1
Seattle
Boise
2
Boise
Salt Lake City
3
Salt Lake City
Albuquerque
4
Albuquerque
El Paso
From Seattle
From Seattle
From Seattle
From Seattle
From Seattle
From Seattle
From Seattle
From Seattle
From Seattle
From Seattle
From Seattle
Distance/Cost
To El Paso
To Butte
To Portland
To Boise
To Cheyenne
To Salt Lake City
To Bakersfield
To Las Vegas
To Albuquerque
To Phoenix
To Tucson
497
345
621
268
Cumulative
Distance/Cost
497
842
1463
1731
=
=
=
=
=
=
=
=
=
=
=
1731
599
180
497
1290
842
1073
1274
1463
1564
1680
Cel mai scurt drum ntre localitile Seattle i El Paso este de 1731
km, traseul fiind urmtorul: Seattle Boise - Salt Lake City Albuquerque
- El Paso, distanele aferente fiind prezentate n Tabelul 4.3.
Sursa
Destinaie
Distana (km)
Seattle
Boise
Salt Lake City
Albuquerque
Boise
Salt Lake City
Albuquerque
El Paso
497
345
621
268
Tabelul 4.3
Distanele
cumulate (km)
497
842
1463
1731
Descriere
Definire obiective
Proiectarea campaniei
TV
Proiectarea ambalaje
noi
Proiectarea campaniei
din pres
Realizare material
publicitar
Aranjare grafic
Desfurarea
campaniei la nivel
local
Evaluarea rezultatelor
Pregtirea campaniei
naionale
Predeces
ori
Durata (spt.)
normal
crash
2
5
1
3
5
50
9
80
10
30
40
20
30
B, C
100
150
D
E, F
2
4
2
4
30
150
30
150
G
H
2
4
1
3
4
10
7
17
Figura 4.5
Figura 4.6
Figura 4.7
Figura 4.8
Figura 4.9
Total Cost
Total Cost
Based on ES
$2.50
$5
$18
$31
$44
$57
$70
$76.33
$82.67
$89.00
$95.33
$101.67
$130.00
$170.00
$210.00
$235.00
$272.50
$310
$347.50
$385
$387
$389
$391.50
$394
$396.50
$399
Based on LS
$2.50
$5
$8
$21
$34
$47
$60
$73
$79.33
$85.67
$92.00
$98.33
$126.67
$155.00
$195.00
$235.00
$272.50
$310
$347.50
$385
$387
$389
$391.50
$394
$396.50
$399
Figura 4.10
Tabelar:
Activity
Name
On Critical
Path
Activity
Time
Earliest
Start
Earliest
Finish
Latest
Start
Latest
Finish
Slack
(LSES)
Definire
obiective
Proiectare
campanie TV
Proiectare
ambalaje noi
Proiectare
campanie din
presa
Realizare
material
publicitar
Aranjare
grafica
Desfasurare
campanie la
nivel local
Evaluare
rezultate
Pregatire
campanie
nationala
Yes
no
Yes
no
10
Yes
12
12
no
10
10
12
Yes
12
16
12
16
Yes
16
17
16
17
Yes
17
20
17
20
Project
Total
Completion
Cost of
Time
Project
=
=
20
$513
weeks
(Cost
on
CP =
$373)
Number of
Critical
Path(s)
2
3
4
5
6
7
8
9
Figura 4.11
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
$9
$31.67
$31.67
$31.67
$12.50
$12.50
$12.50
$12.50
$20
$65
$50
$50
$37.50
$37.50
$37.50
$37.50
$7
$5.67
$5.67
$5.67
$9
$5
$5
$31.67
$31.67
$31.67
$12.50
$12.50
$12.50
$57.50
$65
$65
$37.50
$37.50
$37.50
$37.50
$7
$5.67
$5.67
$5.67
$9
$40.67
$72.33
$104.00
$116.50
$129
$141.50
$154
$174
$239
$289
$339
$376.50
$414
$451.50
$489
$496
$501.67
$507.33
$513
Total Cost
Based on LS
$9
$14
$19
$50.67
$82.33
$114.00
$126.50
$139
$151.50
$209
$274
$339
$376.50
$414
$451.50
$489
$496
$501.67
$507.33
$513
Figura 4.12
Figura 4.13
Activity
Critical
Normal
Crash
Suggested
Additional
Normal
Suggested
Name
Definire
obiective
Proiectare
campanie TV
Proiectare
ambalaje noi
Proiectare
campanie din
presa
Realizare
material
publicitar
Aranjare
grafica
Desfasurare
campanie la
nivel local
Evaluare
rezultate
Pregatire
campanie
nationala
Path
Yes
Time
2
Time
1
Time
1
Cost
$4
Cost
$5
Cost
$9
Yes
$50
$50
Yes
10
$10
$30
$40
Yes
$10
$20
$30
Yes
$50
$100
$150
Yes
$30
$30
Yes
$150
$150
Yes
$3
$4
$7
Yes
$7
$10
$17
20
$20
$84
$399
$503
Late
Overall
Penalty:
Project:
Dac durata oricrei activiti, ti, e mai mare dect durata ciclului,
programul aloc mai muli operatori pentru acea activitate. Numrul de
operatori alocai este:
N = cel_mai_mic_ntreg ti/C
iar durata ciclului pentru fiecare operator pentru aceast activitate este NC.
Dac NC > ti, programul va aloca ct de multe activiti posibil
acestor operatori.
Activitile ar trebui numerotate ncepnd cu 1, astfel nct numrul
unui predecesor s fie mai mic dect al unui succesor.
Exemplu:
Se dorete realizarea unei linii de fabricaie care s produc 800 de
monitoare pe zi. Ziua de lucru este de 8 ore. Echipa tehnic a furnizat
urmtoarele informaii referitoare la activitile implicate n asamblarea unui
monitor:
Activitate
a
b
c
d
e
f
g
h
i
Durat (min)
.2
.2
.4
.1
.3
.2
.1
.2
.6
Predecesor imediat
a
c, d
b, e
f, g
h
Rezolvare:
Mai nti se introduc specificaiile problemei, respectiv tipul (Line
Balancing), criteriul de optimizare (minim), titlul problemei, numrul de
activiti (9), unitatea de msur a timpului (minute) i numrul de
coordonate(2/3).
Tabelul aferent problemei este prezentat n Figura 4.14.
Figura 4.14
Task
Assigned
Task
Name
Task
Time
Time
Unassigned
%
Idleness
3
1
Task 3
Task 1
0.40
0.20
0.20
1.490116E08
0.40
0.30
2.980232E08
0.40
0.30
0.10
0
33.33%
0.00%
3
4
5
2
4
5
Task 2
Task 4
Task 5
0.20
0.10
0.30
6
7
8
9
6
7
8
9
Task 6
Task 7
Task 8
Task 9
0.20
0.10
0.20
0.60
Solved
by
COMSOAL
Type
Generation
66.67%
50.00%
0.00%
66.67%
50.00%
16.67%
0.00%
Result
0.60
4
4
2.40
2.30
0.10
4.17%
Figura 4.15
Figura 4.16
Rezultatele obinute sunt prin rularea opiunii Solve the Problem din
meniul Solve and Analyze sunt date n tabelul urmtor:
Inventory Cost Analysis per year for Stocuri
06-27- Input Data
Value
2003
1
Demand per year
200
2
Order (setup) cost
$35.000
3
5
6
7
per year
Unit shortage cost
independent of time
8
9
Replenishment/production
rate per year
10
11
12
0
$100.000
13
14
$30.000
Economic Order
Analysis
Order quantity
Maximum
inventory
Maximum
backorder
Order interval in
year
Reorder point
Value
21.6025
21.6025
0
0.108
0
Total setup or
ordering cost
Total holding cost
Total shortage
cost
Subtotal of above
$324.037
Total material
cost
$20000.00
0
$20648.07
0
$324.037
0
$648.074
Figura 4.17
Figura 4.18
Figura 4.19
Dem
and
per
year
11:4
2:26
Econ
omic
Inve
ntory
Grand
Total
Total
Tota
l
Total
Maxi
mum
Maxi
mum
Orde
r
Reo
rder
Orde
r
Quan
tity
21.6
025
Relat
ed
Cost
Total
Cost
Setu
p
Cost
Hold
ing
Cost
Shor
tage
Cost
Materi
al
Cost
Inve
ntory
Back
order
Poi
nt
$648
.074
1
$664
.078
3
$679
.705
8
$694
.982
0
$709
.929
6
$724
.568
8
$2064
8.070
0
$2166
4.080
0
$2267
9.710
0
$2369
4.980
0
$2470
9.930
0
$2572
4.570
0
$324
.037
0
$332
.039
2
$339
.852
9
$347
.491
0
$354
.964
8
$362
.284
4
$324
.037
0
$332
.039
2
$339
.852
9
$347
.491
0
$354
.964
8
$362
.284
4
$2000
0.000
0
$2100
0.000
0
$2200
0.000
0
$2300
0.000
0
$2400
0.000
0
$2500
0.000
0
21.6
025
Inter
val
in
year
0.10
80
22.1
359
0.10
54
22.6
569
0.10
30
23.1
661
0.10
07
23.6
643
0.09
86
24.1
523
0.09
66
200
210
22.1
359
220
22.6
569
230
23.1
661
240
23.6
643
250
24.1
523
0
0
0
0
0
200
$35.00
$30.00
per year
6
7
8
9
Replenishment/producti
on
rate per year
10
11
12
$100.00
13
14
Economic
Order
Analysis
Order
quantity
Maximum
inventory
Maximum
backorder
Order
interval in
year
Reorder
point
Total setup
or ordering
cost
Total
holding cost
Total
shortage
cost
Subtotal of
above
Value
21.6025
21.6025
0
0.1080
0
$324.04
$324.04
0
$648.07
Known
Order
Analysis
Order
quantity
Maximum
inventory
Maximum
backorder
Order
interval in
year
Reorder
point
Total setup
or ordering
cost
Total
holding cost
Total
shortage
cost
Subtotal of
above
Value
20
20
0
0.1
0
$350.00
$300.00
0
$650.00
Total
material
cost
$20000.00
Total
material cost
$20000.
00
Grand total
cost
$20648.07
Grand total
cost
$20650.
00
Figura 4.20
Break
Qty.
0
Disco
unt %
0
EOQ
EOQ Cost
Feasibility
21.6025
$20648.0700
No
Order
Qty.
10
10
21.6025
$19648.0700
No
20
20
21.6025
$19248.0700
Yes
30
21.6025
$18848.0700
No
21.602
5
30
30
Discount =
9%
Recommended
Order Qty. =
Total
Cost =
Total Cost
$20850.00
00
$19650.00
00
$19248.07
00
$18883.33
00
$18883.33
00
Figura 4.21
Figura 4.22
Prima opiune din meniul Solve and Analyze, respectiv Solve the
Performance, ofer informaii cu privire la lungimea cozii, timpul de
ateptare i performana sistemului n general:
System Performance Summary for Tipografie
06-29-2003
11:51:37
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
Performance Measure
Result
System: M/M/4
Customer arrival rate (lambda) per day =
Service rate per server (mu) per day =
Overall system effective arrival rate per day =
Overall system effective service rate per day =
Overall system utilization =
Average number of customers in the system (L) =
Average number of customers in the queue (Lq) =
Average number of customers in the queue for a busy system (Lb) =
Average time customer spends in the system (W) =
Average time customer spends in the queue (Wq) =
Average time customer spends in the queue for a busy system (Wb)
=
The probability that all servers are idle (Po) =
The probability an arriving customer waits (Pw) or system is busy
(Pb) =
Average number of customers being balked per day =
Total cost of busy server per day =
Total cost of idle server per day =
Total cost of customer waiting per day =
Total cost of customer being served per day =
Total cost of customer being balked per day =
Total queue space cost per day =
Total system cost per day =
From Formula
25.0000
18.0000
25.0000
25.0000
34.7222 %
1.4202
0.0313
0.5319
0.0568 days
0.0013 days
0.0213 days
24.7682 %
5.8828 %
0
$0
$0
$0
$0
$0
$0
$0
Estimated Probability of
n Customers in the System
Cumulative Probability
0.2477
0.3440
0.2389
0.1106
0.0384
0.0133
0.0046
0.0016
0.0006
0.0002
0.0001
0.0000
0.0000
0.0000
0.0000
0.2477
0.5917
0.8306
0.9412
0.9796
0.9929
0.9975
0.9991
0.9997
0.9999
1.0000
1.0000
1.0000
1.0000
1.0000
Result
From
Simulation
25.0000
18.0000
24.8983
24.8883
35.5167 %
1.4539
0.0332
0.5540
0.0584 days
0.0013 days
0.0223 days
23.2479 %
5.9949 %
0
$0
$0
$0
$0
$0
$0
$0
100.0000
0
2489
5
0.5310
Effective
System
Arrival
Rate
25.0000
25.0000
25.0000
25.0000
25.0000
25.0000
25.0000
25.0000
25.0000
Utilization
0.6944
0.4630
0.3472
0.2778
0.2315
0.1984
0.1736
0.1543
0.1389
Lq
Lb
Wq
Wb
P0
Pw
2.6826
1.5602
1.4202
1.3946
1.3899
1.3890
1.3889
1.3889
1.3889
1.2937
0.1713
0.0313
0.0057
0.0010
0.0002
0.0000
0.0000
0.0000
2.2727
0.8621
0.5319
0.3846
0.3012
0.2475
0.2101
0.1825
0.1613
0.1073
0.0624
0.0568
0.0558
0.0556
0.0556
0.0556
0.0556
0.0556
0.0517
0.0069
0.0013
0.0002
0.0000
0.0000
0.0000
0.0000
0.0000
0.0909
0.0345
0.0213
0.0154
0.0120
0.0099
0.0084
0.0073
0.0065
0.1803
0.2390
0.2477
0.2491
0.2493
0.2493
0.2494
0.2494
0.2494
0.5692
0.1987
0.0588
0.0149
0.0032
0.0006
0.0001
0.0000
0.0000
Data
1/1/2001
1/1/2001
1/1/2001
1/1/2001
1/1/2001
1/2/2001
1/2/2001
1/2/2001
1/2/2001
1/2/2001
1/3/2001
1/3/2001
1/3/2001
1/3/2001
1/3/2001
1/4/2001
1/4/2001
1/4/2001
1/4/2001
1/4/2001
1/5/2001
1/5/2001
1/5/2001
1/5/2001
1/5/2001
1/7/2001
1/7/2001
1/7/2001
1/7/2001
1/7/2001
1/8/2001
1/8/2001
1/8/2001
1/8/2001
1/8/2001
1/9/2001
1/9/2001
1/9/2001
1/9/2001
1/9/2001
1/10/2001
1/10/2001
1/10/2001
Ora
16:49:22
16:49:22
16:49:22
16:49:22
16:49:22
16:49:37
16:49:37
16:49:37
16:49:37
16:49:37
16:49:50
16:49:50
16:49:50
16:49:50
16:49:50
16:50:01
16:50:01
16:50:01
16:50:01
16:50:01
16:50:10
16:50:10
16:50:10
16:50:10
16:50:10
16:50:21
16:50:21
16:50:21
16:50:21
16:50:21
16:50:30
16:50:30
16:50:30
16:50:30
16:50:30
16:50:39
16:50:39
16:50:39
16:50:39
16:50:39
16:50:53
16:50:53
16:50:53
Subgrupa
1
1
1
1
1
2
2
2
2
2
3
3
3
3
3
4
4
4
4
4
5
5
5
5
5
6
6
6
6
6
7
7
7
7
7
8
8
8
8
8
9
9
9
Diametrul
74.03
74.002
74.019
73.992
74.008
73.995
73.992
74.001
74.011
74.004
73.988
74.024
74.021
74.005
74.002
74.002
73.996
73.993
74.015
74.009
73.992
74.007
74.015
73.989
74.014
74.009
73.994
73.997
73.985
73.993
73.995
74.006
73.994
74
74.005
73.985
74.003
73.993
74.015
73.988
74.008
73.995
74.009
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
1/10/2001
1/10/2001
1/11/2001
1/11/2001
1/11/2001
1/11/2001
1/11/2001
1/12/2001
1/12/2001
1/12/2001
1/12/2001
1/12/2001
1/14/2001
1/14/2001
1/14/2001
1/14/2001
1/14/2001
1/15/2001
1/15/2001
1/15/2001
1/15/2001
1/15/2001
1/16/2001
1/16/2001
1/16/2001
1/16/2001
1/16/2001
1/17/2001
1/17/2001
1/17/2001
1/17/2001
1/17/2001
1/18/2001
1/18/2001
1/18/2001
1/18/2001
1/18/2001
1/19/2001
1/19/2001
1/19/2001
1/19/2001
1/19/2001
1/21/2001
1/21/2001
16:50:53
16:50:53
16:51:05
16:51:05
16:51:05
16:51:05
16:51:05
16:51:13
16:51:13
16:51:13
16:51:13
16:51:13
16:51:22
16:51:22
16:51:22
16:51:22
16:51:22
16:51:35
16:51:35
16:51:35
16:51:35
16:51:35
16:51:44
16:51:44
16:51:44
16:51:44
16:51:44
16:51:52
16:51:52
16:51:52
16:51:52
16:51:52
16:52:01
16:52:01
16:52:01
16:52:01
16:52:01
16:52:09
16:52:09
16:52:09
16:52:09
16:52:09
16:52:17
16:52:17
9
9
10
10
10
10
10
11
11
11
11
11
12
12
12
12
12
13
13
13
13
13
14
14
14
14
14
15
15
15
15
15
16
16
16
16
16
17
17
17
17
17
18
18
Calitii
a 50 de
studierii
urmtor:
74.005
74.004
73.998
74
73.99
74.007
73.995
73.994
73.998
73.994
73.995
73.99
74.004
74
74.007
74
73.996
73.983
74.002
73.998
73.997
74.012
74.006
73.967
73.994
74
73.984
74.012
74.014
73.998
73.999
74.007
74
73.984
74.005
73.998
73.996
73.994
74.012
73.986
74.005
74.007
74.006
74.01
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
1/21/2001
1/21/2001
1/21/2001
1/22/2001
1/22/2001
1/22/2001
1/22/2001
1/22/2001
1/23/2001
1/23/2001
1/23/2001
1/23/2001
1/23/2001
1/24/2001
1/24/2001
1/24/2001
1/24/2001
1/24/2001
1/25/2001
1/25/2001
1/25/2001
1/25/2001
1/25/2001
1/27/2001
1/27/2001
1/27/2001
1/27/2001
1/27/2001
1/28/2001
1/28/2001
1/28/2001
1/28/2001
1/28/2001
1/29/2001
1/29/2001
1/29/2001
1/29/2001
1/29/2001
1/2/2001
1/2/2001
1/2/2001
1/2/2001
1/2/2001
1/3/2001
1/3/2001
1/3/2001
1/3/2001
1/3/2001
1/4/2001
1/4/2001
1/4/2001
1/4/2001
1/4/2001
1/5/2001
1/5/2001
1/5/2001
1/5/2001
1/5/2001
1/7/2001
1/7/2001
1/7/2001
1/7/2001
1/7/2001
1/8/2001
1/8/2001
1/8/2001
1/8/2001
1/8/2001
1/9/2001
1/9/2001
1/9/2001
1/9/2001
1/9/2001
1/10/2001
1/10/2001
1/10/2001
1/10/2001
1/10/2001
1/11/2001
1/11/2001
1/11/2001
1/11/2001
16:52:17
16:52:17
16:52:17
16:52:27
16:52:27
16:52:27
16:52:27
16:52:27
16:52:35
16:52:35
16:52:35
16:52:35
16:52:35
16:52:44
16:52:44
16:52:44
16:52:44
16:52:44
16:52:52
16:52:52
16:52:52
16:52:52
16:52:52
16:53:04
16:53:04
16:53:04
16:53:04
16:53:04
16:53:12
16:53:12
16:53:12
16:53:12
16:53:12
16:53:20
16:53:20
16:53:20
16:53:20
16:53:20
16:49:37
16:49:37
16:49:37
16:49:37
16:49:37
16:49:50
16:49:50
16:49:50
16:49:50
16:49:50
16:50:01
16:50:01
16:50:01
16:50:01
16:50:01
16:50:10
16:50:10
16:50:10
16:50:10
16:50:10
16:50:21
16:50:21
16:50:21
16:50:21
16:50:21
16:50:30
16:50:30
16:50:30
16:50:30
16:50:30
16:50:39
16:50:39
16:50:39
16:50:39
16:50:39
16:50:53
16:50:53
16:50:53
16:50:53
16:50:53
16:51:05
16:51:05
16:51:05
16:51:05
18
18
18
19
19
19
19
19
20
20
20
20
20
21
21
21
21
21
22
22
22
22
22
23
23
23
23
23
24
24
24
24
24
25
25
25
25
25
26
26
26
26
26
27
27
27
27
27
28
28
28
28
28
29
29
29
29
29
30
30
30
30
30
31
31
31
31
31
32
32
32
32
32
33
33
33
33
33
34
34
34
34
74.018
74.003
74
73.984
74.002
74.003
74.005
73.997
74
74.01
74.013
74.02
74.003
73.988
74.001
74.009
74.005
73.996
74.004
73.999
73.99
74.006
74.009
74.01
73.989
73.99
74.009
74.014
74.015
74.008
73.993
74
74.01
73.982
73.984
73.995
74.017
74.013
74.03
74.002
74.019
73.992
74.008
73.995
73.992
74.001
74.011
74.004
73.998
74.064
73.999
74.025
74.002
74.072
74.006
74.003
74.015
74.009
73.992
74.007
74.015
73.989
74.014
74.009
73.994
73.997
73.985
73.993
73.995
74.006
73.994
74
74.005
73.985
74.003
73.993
74.015
73.988
74.008
73.995
74.009
74.005
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
1/11/2001
1/12/2001
1/12/2001
1/12/2001
1/12/2001
1/12/2001
1/14/2001
1/14/2001
1/14/2001
1/14/2001
1/14/2001
1/15/2001
1/15/2001
1/15/2001
1/15/2001
1/15/2001
1/16/2001
1/16/2001
1/16/2001
1/16/2001
1/16/2001
1/17/2001
1/17/2001
1/17/2001
1/17/2001
1/17/2001
1/18/2001
1/18/2001
1/18/2001
1/18/2001
1/18/2001
1/19/2001
1/19/2001
1/19/2001
1/19/2001
1/19/2001
1/21/2001
1/21/2001
1/21/2001
1/21/2001
1/21/2001
1/22/2001
1/22/2001
1/22/2001
1/22/2001
1/22/2001
1/23/2001
1/23/2001
1/23/2001
1/23/2001
1/23/2001
1/24/2001
1/24/2001
1/24/2001
1/24/2001
1/24/2001
1/25/2001
1/25/2001
1/25/2001
1/25/2001
1/25/2001
1/27/2001
1/27/2001
1/27/2001
1/27/2001
1/27/2001
1/28/2001
1/28/2001
1/28/2001
1/28/2001
1/28/2001
1/29/2001
1/29/2001
1/29/2001
1/29/2001
1/29/2001
1/2/2001
1/2/2001
1/2/2001
1/2/2001
1/2/2001
16:51:05
16:51:13
16:51:13
16:51:13
16:51:13
16:51:13
16:51:33
16:51:33
16:51:33
16:51:33
16:51:33
16:51:42
16:51:42
16:51:42
16:51:42
16:51:42
16:51:50
16:51:50
16:51:50
16:51:50
16:51:50
16:52:00
16:52:00
16:52:00
16:52:00
16:52:00
16:52:07
16:52:07
16:52:07
16:52:07
16:52:07
16:52:16
16:52:16
16:52:16
16:52:16
16:52:16
16:52:23
16:52:23
16:52:23
16:52:23
16:52:23
16:52:33
16:52:33
16:52:33
16:52:33
16:52:33
16:52:42
16:52:42
16:52:42
16:52:42
16:52:42
16:52:50
16:52:50
16:52:50
16:52:50
16:52:50
16:53:02
16:53:02
16:53:02
16:53:02
16:53:02
16:53:10
16:53:10
16:53:10
16:53:10
16:53:10
16:53:18
16:53:18
16:53:18
16:53:18
16:53:18
16:53:27
16:53:27
16:53:27
16:53:27
16:53:27
16:49:48
16:49:48
16:49:48
16:49:48
16:49:48
34
35
35
35
35
35
36
36
36
36
36
37
37
37
37
37
38
38
38
38
38
39
39
39
39
39
40
40
40
40
40
41
41
41
41
41
42
42
42
42
42
43
43
43
43
43
44
44
44
44
44
45
45
45
45
45
46
46
46
46
46
47
47
47
47
47
48
48
48
48
48
49
49
49
49
49
50
50
50
50
50
74.004
73.998
74
73.99
74.007
73.995
74.009
74.005
74.084
73.998
74
73.99
74.007
73.995
73.994
73.998
73.994
73.995
73.99
74.004
74
74.007
74
73.996
73.983
74.002
73.998
73.997
74.012
74.006
73.967
73.994
74
73.984
74.012
74.014
73.998
73.999
74.007
74
73.984
74.005
73.998
73.996
73.994
74.012
73.986
74.005
74.007
74.006
74.01
74.018
74.003
74
73.984
74.002
74.003
74.005
73.997
74
74.01
74.013
74.02
74.003
73.988
74.001
73.999
73.994
73.996
73.91
73.969
73.99
74.006
74.009
74.01
73.989
73.99
74.009
74.014
74.015
74.008
Rezolvare:
Datele culese sunt introduse n fereastra principal a modulului. Cu
ajutorul opiunilor din meniul View:
posibile cauze pentru neconformiti Causes. Adugarea sau
tergerea unei cauze noi se face cu ajutorul opiunilor din meniul
Edit.
Number
1
2
3
4
5
Rule Description
n
Out
of
m
Points
Off
UCL/LC
L
#
Sigmas
Off CL
In a
Row Off
CL
In a
Row Off
Median
-1
2
3
4
5
6
7
8
9
10
11
12
13
14
Jump
in
Sigmas
In a
Row
Up/Dow
n
0
-2
-1
-1
-1
8
8
8
8
0
0
0
0
0
0
0
0
1
-1
0
0
-4
USL
74.08
Mean
Median
Midrange
Variance
S.D.
Range
Maximum
Minimum
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
Sample
Size
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
5
74.0102
74.0006
74.0080
74.0030
74.0034
73.9956
74.0000
73.9968
74.0042
73.9980
73.9942
74.0014
73.9984
73.9902
74.0060
73.9966
74.0008
74.0074
73.9982
74.0092
73.9998
74.0016
74.0024
74.0052
73.9982
74.0102
74.0006
74.0176
74.0210
74.0034
73.9956
74.0000
73.9968
74.0042
73.9980
74.0192
73.9968
73.9966
73.9976
73.9960
74.0008
73.9976
74.0010
74.0028
74.0014
74.0030
74.0050
73.9736
74.0008
74.0072
74.0080
74.0010
74.0050
74.0020
74.0070
73.9940
74.0000
73.9930
74.0050
73.9980
73.9940
74.0000
73.9980
73.9940
74.0070
73.9980
74.0050
74.0060
74.0020
74.0100
74.0010
74.0040
74.0090
74.0080
73.9950
74.0080
74.0010
74.0020
74.0090
74.0070
73.9940
74.0000
73.9930
74.0050
73.9980
74.0050
73.9950
73.9950
74.0000
73.9980
74.0000
73.9990
73.9980
74.0060
74.0020
74.0030
74.0030
73.9940
74.0060
74.0090
74.0110
74.0015
74.0060
74.0040
74.0020
73.9970
74.0000
74.0000
74.0020
73.9985
73.9940
74.0015
73.9975
73.9865
74.0060
73.9945
73.9990
74.0090
73.9945
74.0100
73.9985
73.9995
74.0015
74.0040
73.9995
74.0110
74.0015
74.0310
74.0375
74.0020
73.9970
74.0000
74.0000
74.0020
73.9985
74.0410
73.9985
73.9970
73.9950
73.9895
73.9990
73.9955
74.0030
73.9980
74.0010
74.0035
74.0040
73.9545
73.9995
74.0025
0.0002
0.0001
0.0002
0.0001
0.0001
0.0001
0.0000
0.0002
0.0000
0.0000
0.0000
0.0000
0.0001
0.0002
0.0001
0.0001
0.0001
0.0000
0.0001
0.0001
0.0001
0.0001
0.0001
0.0001
0.0003
0.0002
0.0001
0.0008
0.0008
0.0001
0.0001
0.0000
0.0002
0.0000
0.0000
0.0013
0.0000
0.0000
0.0001
0.0003
0.0002
0.0001
0.0001
0.0001
0.0001
0.0000
0.0001
0.0014
0.0001
0.0001
0.0148
0.0075
0.0147
0.0091
0.0122
0.0087
0.0055
0.0123
0.0055
0.0063
0.0029
0.0042
0.0105
0.0153
0.0073
0.0078
0.0106
0.0070
0.0085
0.0080
0.0082
0.0074
0.0119
0.0087
0.0162
0.0148
0.0075
0.0282
0.0289
0.0122
0.0087
0.0055
0.0123
0.0055
0.0063
0.0365
0.0064
0.0055
0.0091
0.0173
0.0125
0.0084
0.0074
0.0096
0.0121
0.0049
0.0122
0.0375
0.0104
0.0101
0.0380
0.0190
0.0360
0.0220
0.0260
0.0240
0.0120
0.0300
0.0140
0.0170
0.0080
0.0110
0.0290
0.0390
0.0160
0.0210
0.0260
0.0180
0.0210
0.0200
0.0210
0.0190
0.0250
0.0220
0.0350
0.0380
0.0190
0.0660
0.0690
0.0260
0.0240
0.0120
0.0300
0.0140
0.0170
0.0860
0.0170
0.0140
0.0240
0.0450
0.0300
0.0230
0.0180
0.0240
0.0340
0.0130
0.0320
0.0890
0.0210
0.0250
74.0300
74.0110
74.0240
74.0150
74.0150
74.0090
74.0060
74.0150
74.0090
74.0070
73.9980
74.0070
74.0120
74.0060
74.0140
74.0050
74.0120
74.0180
74.0050
74.0200
74.0090
74.0090
74.0140
74.0150
74.0170
74.0300
74.0110
74.0640
74.0720
74.0150
74.0090
74.0060
74.0150
74.0090
74.0070
74.0840
74.0070
74.0040
74.0070
74.0120
74.0140
74.0070
74.0120
74.0100
74.0180
74.0100
74.0200
73.9990
74.0100
74.0150
73.9920
73.9920
73.9880
73.9930
73.9890
73.9850
73.9940
73.9850
73.9950
73.9900
73.9900
73.9960
73.9830
73.9670
73.9980
73.9840
73.9860
74.0000
73.9840
74.0000
73.9880
73.9900
73.9890
73.9930
73.9820
73.9920
73.9920
73.9980
74.0030
73.9890
73.9850
73.9940
73.9850
73.9950
73.9900
73.9980
73.9900
73.9900
73.9830
73.9670
73.9840
73.9840
73.9940
73.9860
73.9840
73.9970
73.9880
73.9100
73.9890
73.9900
Overall
74.0015
74.0015
74.0016
0.0002
0.0112
0.0276
74.0840
73.9100
Figura 4.26
Figura 4.27
Figura 4.28
Acest tip de grafic este unul din diferitele moduri oferite de produs
pentru verificarea ncadrrii valorilor studiate n limite normale.