03. POM-QM. Hướng Dẫn Sử Dụng Tổng Quát Bằng Tiếng Việt

PHN MM NH LNG POMQM
LP QUN TR KINH DOANH
POM - QM FOR WINDOWS

Version 3.0 Build 23 07/09/2008
NHNG CNG C MT S NI DUNG C
B SUNG T PHIN BN NNG CP
Version 3.41 Build 108 20/09/2010

PHN MM CHO NHNG QUYT NH KHOA HC
NHNG PHNG PHP NH LNG
CC THAO TC QUN L V SN XUT
Sau khi s dng EvTran v2.0 dch sang ting vit, th Font Times New Roman b
chuyn thnh Times New Roman EVT , nhng c th xem n bng Font TCVN3 Sample
Font , v vy ta c th chuyn i li m Font t TCVN3 thnh Times New Roman . Bn
dch thng thiu ch v du ng, rt nhiu t ng cha chun xc, phn ln cc t ny
cha c dch li. Tuy nhin, khi thc hnh vi cc v d ( chng 6), th s d hiu thi, tt
nhin rt nhiu th phi hc qua ri mi m c nha! Ngoi ra Version 3.41 build 108 ngy
20/09/2010 cn c cc hng dn thm c lu trong th mc ci t, vo xem nh !
Dch bng Google kt hp vi EvTran v2.0 s d hiu hn, tuy nhin phi phi hp gia ngn
ng my tnh, ngn ng kinh t, mt cht ting anh, ri n ting vit th mi ok. Lu , bng
dch ting vit c b sung thm ni dung, v vy chng 6, mi phn u c thm mt s ni
dung lm cho phn phin dch c nhng ch khng theo th t nh bng ting anh. Phn ln
cc t ng c chnh sa tp chung chng 6, nhng khng nhiu, ch m thi nh !
PHN MM QUN TR KINH DOANH POM-QM V3.0

NH LNG HOT NG SN XUT & QUN L
TC GI : HOWARD J. WEISS
<www.prenhall.com/weiss>
dsSoftware@prenhall.com <mailto:dsSoftware@prenhall.com>
S dch 06/06/2012 by http://trananhtu.blog/
Phin bn 07/09/2008 / Nng cp 20/09/2010
Bn quyn ( c) 2006 bi s Gio dc Pearson, Trn Inc., Thng yn Dng sng, New Jersey, 07458.
Phng ln Pearson Prentice. Gi mi bn quyn.
SINH VIN THC HIN : TRN ANH T
TRANG 1
PHN MM NH LNG POMQM
MC LC
(Table of Contents)
CHNG 1 : LI GII THIU
Tng quan ............................................................................... 1
Nhng yu cu phn cng v phn mm .............................. 3
Thit t phn mm ................................................................ 4
Nhm chng trnh ................................................................. 5
Khi ng chng trnh .......................................................... 6
Mn nh chnh ........................................................................ 7
CHNG 2 : MT VN MU
Li gii thiu ......................................................................... 12
To ra mt vn mi .......................................................... 13
Mn nh d liu .................................................................... 15
D liu i vo v son tho .................................................. 15
Mn nh gii php ................................................................ 17
CHNG 3 : THC N CHNH
H s .................................................................................... 19
Son tho .............................................................................. 24
Cnh quan ............................................................................ 25
M un .................................................................................. 26
Khun dng ........................................................................... 27
Nhng cng c ..................................................................... 30
Ca s ................................................................................... 30
S gip ............................................................................ 32
CHNG 4 : S IN
Mn nh ci t in ................................................................. 36
Thng tin in ...................................................................... 37
Thng tin u mc trang ....................................................... 38
Cch trnh by trang ............................................................. 39
Nhng ty chn my in ......................................................... 40
TRANG 2
PHN MM NH LNG POMQM
CHNG 5 : NHNG TH
Li gii thiu .................................................................... 42
H s ct gi ................................................................... 43
S In ................................................................................ 43
Nhng mu v nhng phng .......................................... 43
CHNG 6 : NHNG M UN
( gm 29 module m )
00. Overview ..................................................

01. Aggregate (Production) Planning ............
02. Assembly Line Balancing ........................
03. The Assignment Model ...........................
04. Breakeven/Cost-Volume Analysis ...........
05. Capital Investment ..................................
06. Decision Analysis ....................................
07. Forecasting .............................................
08. Game Theory ..........................................
09. Goal Programming ..................................
10. Integer & Mixed Integer Programming ....
11. Inventory .................................................
12. Job Shop Scheduling (Sequencing) .........
13. Layout .....................................................
14. Learning (Experience) Curves ................
15. Linear Programming ...............................
16. Location ..................................................
17. Lot Sizing ................................................
18. Markov Analysis ......................................
19. Material Requirements Planning .............
20. Networks .................................................
21. Productivity .............................................
22. Project Scheduling ..................................
23. Quality Control ........................................
24. Reliability .................................................
25. Simulation ...............................................
26. Statistics ..................................................
27. The Transportation Model .......................
28. Waiting Lines ..........................................
29. Work Measurement .................................
Tng quan ...................................................... 44

Tp hp li (s sn xut) lp k hoch .......... 45
S gi thng bng dy chuyn lp rp ........... 57
M hnh n nh .............................................. 65
Breakeven / S phn tch Gi - Th tch ........ 67
u t chnh ................................................... 71
S phn tch quyt nh .................................. 73
S d bo ...................................................... 84
L thuyt tr chi ............................................ 99
Lp trnh mc ch ........................................ 102
S nguyn & Trn ln Lp trnh s nguyn .. 106
Kim k ......................................................... 109
Cng vic (m) ca hng hoch nh ............ 117
Cch trnh by .............................................. 126
Hc rng (s tng tri) un cong ................. 130
Lp trnh tuyn tnh (thng) .......................... 133
S nh v (v tr) ........................................... 139
Lot o c ...................................................... 145
S phn tch Markov .................................... 150
Vic t k hoch nhng yu cu vt cht ... 154
Nhng mng ................................................. 161
Nng sut ..................................................... 165
D n hoch nh ......................................... 166
iu khin cht lng .................................. 175
S tin cy ..................................................... 182
S m phng ................................................ 185
Nhng thng tin c thng k .................... 188
M hnh vn ti ............................................. 193
i nhng hng ........................................... 197
Lm vic l php o ...................................... 206
RUT THA
( Ph lc Appendices )
A. S thc hin theo yu cu khch hng v sch gio khoa .......................... 210
B. Nhng gi hu ch cho nhng m un .................................................... 211
TRANG 3
PHN MM NH LNG POMQM
M U
(Preface)
Tht kh tin tng rng POM - QM cho Windows ( Trc y l DS cho Windows)
c tn ti, trc ht nh mt lp trnh v sau trong khi mt Windows lp trnh, c
hn 15 nm. N c v tng t chng ta s dng c nhng my tnh mini ln
Windows mi mi nhng tht ra cch dng Windows quy m ln c t hn hn mt thp
nin. Vo thi gian m Ti kt thc (m) bn chnh lm Phin bn, t sinh vin c nhng
my tnh c nhn hoc bit mt ISP l g (). Hm nay, mt khi mt phn ln ln (ca)
nhng sinh vin c nhng my tnh (ca) chnh mnh phn mm ny thm ch (th) qi gi
hn n c bao gi.
Mc ch nguyn bn trong vic pht trin phn mm s cung cp nhng sinh vin
vi gi d s dng nht sn sng cho s sn xut / Nhng qun l thao tc, nhng
phng php nh lng, khoa hc qun l, v nhng thao tc nghin cu. Chng ta
c lm va lng bi s p li ti nhng phin bn trc y (ca) POM - QM cho
Windows ch bo rng Chng ta c r rng gp mc ch (ca) Chng ta.
QM cho Windows (Phin bn 1.0) l phn tn u tin trong ma h (ca) 1996
trong khi mt chng trnh ring bit nhng tng t, POM cho Windows (Phin bn 1.1)
l phn tn u tin trong s ri (ca) 1996. DS cho Windows, m cha ng tt c cc
m un trong c POM ln QM v cng n Vi Mt In ti liu Phn tn u tin () vo
1997. Phin bn 2 (ca) tt c ba chng trnh c to ra cho Windows 95 v phn tn
trong s ri (ca) 1999.
Cho phin bn mi ny, phin bn (m) 3, chng ta c lm sp ba cu sn phm
vo trong mt sn phm c tn POM - QM Cho Windows. Cho s bn cht vi nhng
phin bn qua, khi s dng nhng vn bn Prentice - Phng ln tht c th thit
t chng trnh nh POM Cho Windows hoc QM Cho Windows v trnh by POM
Cho Windows hoc QM Cho thc n m un Windows. Bt chp (ca) tn (ca) biu
tng desktop tt c (ca) nhng m un sn sng ti tt c cc ngi dng. Chng ta
s tham chiu ti sn phm nh POM - QM cho Windows khp c (sut) ti liu ny.
(Ci) ny l mt gi m c th s dng ph thm vo bt k sch gio khoa no
trong vng rng c bit nh nhng khoa hc Quyt nh. (Ci) ny bao gm nhng
Qun l Sn xut v thao tc, nhng phng php nh lng, Khoa hc Qun l, hoc
vn tr hc.
bn di mt tm lc (ca) chnh thay i bao gm trong phin bn l 3. S ri
nhng thay i ny vo trong ba phm tr : nhng s nng cao m un, tnh hot ng,
v tin li cho ngi dng.
NHNG S NNG CAO M UN (CC MODULE C NNG CP)
(Module Enhancements)
Trong tng th lp k hoch m un chng ta thm mt m hnh to ra mt
vn vn ti. Cho s gi thng bng dy chuyn lp rp chng ta thm mt mn
hnh m tng kt nhng kt qu Khi no vic s dng mi nhng phng php. Cho
quyt nh nhng bng (m) chng ta c thm mt mn hnh u ra Cho nhiu gi tr
(ca) alpha Khi no vic tnh ton gi tr Hurwicz. S thm mi hi hp nht (ca) Chng
ta l trong s phn tch quyt nh Chng ta by gi c mt giao din ngi dng th
TRANG 4
PHN MM NH LNG POMQM
d s dng to ra ci cy quyt nh. Ngoi ra, chng ta thm mt m hnh mi

to ra quyt nh (m) nhng bng cho mt thi k kim k (S cung cp / Yu cu)
Nhng vn . Trong s d bo, chng ta thm mt m hnh m cho php ngi dng
vo nhng d bo chy mt s phn tch li. Ngoi ra, chng ta thm MAPE nh
u ra chun cho tt c cc m hnh v thm rng iu khin d bo vi tnh ton (ca)
s theo di bo hiu. Trong kim k (m) chng ta c thm rng reorder ch nhng m
hnh cho c bnh thng ln ring bit yu cu nhng phn phi. Trong vic lm vic ca
hng hoch nh, cho mt my sequencing (m) chng ta c k c s bao gm (ca)
nhng ngy thng m nhng cng vic (th) nhn c v chng ta thm mt mn
hnh m tng kt nhng kt qu Khi no vic s dng tt c cc phng php. Trong s
nh v (v tr) chng ta thm mt gi nh v (v tr) - m hnh phn tch th tch
(breakeven). Trong lp trnh tuyn tnh (thng) chng ta trnh by u vo Trong mu
(dng) phng trnh trn (v) phi (ng) (ca) bng v thm mt u ra m c m
hnh kp (ca) vn nguyn bn. cng l c th by gi m in gc ch (ca) mt
th. Trong qun l d n chng ta trnh by ng (dn) ph bnh mu . Trong iu
khin cht lng tht c th t hng trung tm Trong nhng biu iu khin hn
l s dng phng tin (ca) d liu. Chng ta m rng nhng thng tin c thng
k (ca) Chng ta mu bao gm nhng tnh ton cho mt danh sch (ca) d liu,
mt bng tn s hoc mt phn phi xc sut cng nh thm mt m hnh phn phi
bnh thng.
TNH HOT NG
(Functionality)
Nhng ty chn nh dng v in c ci thin. Tht c th nh dng nhng
mn hnh thp phn trn (v) c mn nh ln printouts. Phi (ng) - Kch nhng ty
chn trn (v) nhng bng v nhng th c tng cng tht c th d
dng sao chp, in hoc ct gi nhng th. Khi in, tht c th la chn nhng th
ring l in hn l phi in tt c cc th sn c. Nhng ty chn thm nhiu hng
hoc nhng ct c thm. Ty chn ch gii c ci thin. S lu tr nh vt
hn ty chn c m rng bao gm gn nh tt c cc m hnh. My tnh Windows s
c s dng Khi no c tm thy hn l my tnh nguyn thy hn Ci c bao
gm vi POM - QM cho Windows. Cun nhng qun ru thm vo s d bo, hc
ng cong v nhng th c trng Operating d dng trnh by nhng s thay
i trong nhng th nh mt hm (ca) nhng tham s.
S THN MT NGI DNG (S TIN DNG)
(User Friendliness)
Nh c cp trn, chng ta c kt hp tt c ba gi vo trong mt gi trong
th t (m) tt c ci m hnh s sn sng ti nhng sinh vin - c bit l nhng
sinh vin m cm (ly) cho c mt Hng Qun l nhng thao tc ln nhng mt
phng php nh lng Hng. Chng ta vn cn k c s la chn sinh vin (ca)
thc n (POM, QM hoc c hai) ti gin s ln ln. Ngoi ra, ci thin s hiu
bit (ca) nhng m hnh chng ta thm rng nhng my tch kem gia lm mu
bng thc n chn lc thc n con mu. Chng ta c kt hp s nguyn v pha trn
(m) s nguyn lp trnh vo trong mt m un. Chng ta thm mt bng tng quan
TRANG 5
PHN MM NH LNG POMQM
vo mn nh to thnh vn gip m t nhng ty chn m (th) sn c. Nhng

ti liu trong c khun dng PDF (ti liu ny) ln khun dng T c thm
nhng ngi dng c th d dng truy nhp ti liu trong khi chy chng trnh hoc
nhng trang in T ti liu. Tutorials m i b bn xuyn qua nhng thao tc nht nh
tng bc mt c bao gm trong thc n Gip . Nhng v d s dng trong ti
liu ny c bao gm trong s sp t. Nhiu ty chn thc hin theo yu cu khch
hng ngi dng hn sn sng trong mc (khu vc) Thng tin Ngi dng di thc
n Gip .
Ti nhng sinh vin m s dng phn mm ny, Ti hy vng rng bn tm thy cho
nhng s b sung phn mm ny vn bn (ca) bn tt. Ti nhng thy gio m s
dng iu ny phn mm, cm n bn chn POM - QM cho Windows. Ti n tip n
cn nhng bnh lun (ca) bn, c bit bi e-mail (ti) dsSoftware@prenhall.com.
NHNG LI CM T
(Acknowledgments)
S pht trin (ca) bt k ln no nh vy d n nh POM - QM cho Windows yu
cu s gip (ca) nhiu ngi. Ti rt may mn trong vic kim c s h tr v
li khuyn (ca) nhng sinh vin v nhng ng nghip t vng quanh qu a cu.
Khng c s gip ca h, POM - QM cho Windows khng thnh cng nh n c.
Tuy nhin Trong c bit Ti thch cm n nhng sinh vin Trong Barry Tr li c
nhng lp (ti) Trng cao ng Rollins v nhng sinh vin Trong nhng lp (ca) Ti
(ti) Trng i hc Miu. Nhng sinh vin ny c lun lun trc ht nhn thy
mi nhng phin bn v trong c nhng nm (m) vi sinh vin c ngh cho thit k
nhng c tnh m c hp nht vo trong phn mm. Nhng c tnh thit k khc
(th) pht trin bn trong nhng s p li bnh lun nhn ti ti t nhng ngi dng
(ca) nhng phin bn 1 (v) 2. Ti (th) bit n v cng cho nhng bnh lun ny m
to ln gip s tin ha v s ci tin lin tc (ca) POM - QM cho Windows.
Vi s thay i trong phn mm c t vo trong ch trong Phin bn 3 v nhng
bnh lun (ca) Philip Entwistle, Trng hc Doanh nghip Northampton. Phin bn
nguyn bn (ca) POM cho Windows v QM cho phn mm Windows c xem li bi
Dave Pentico (ca) Trng i hc Duquesne; Laurence J. Moore (ca) Bch khoa
Virginia Thit lp v Pht biu Trng i hc; Raesh G. Soni (ca) Trng i hc
Pennsylvania Indiana; Donald G. Sluti (ca) Trng i hc Nebraska (ti) Kearney;
Nagraj Balachandran (ca) Trng i hc Clemson; T b Powell (ca) Trng i hc
pha Nam Dakota; Sam Roy (ca) Morehead Pht biu Trng i hc; v Ch chn gi
Volet (ca) H thng cn vng bc Pht biu Trng i hc. Nhng bnh lun Ca h
(th) rt c nh hng trong thit k (ca) phn mm m c mang qua ti phin bn
mi.
Ngoi ra, nhng gio s khc m cng tc ti phn mm ny l Sri Sridharan
(ca) Trng i hc Clemson; Forrest ( Bng ngang) Xanh lc (ca) Trng i hc
Radford; John E. Nicolay Jr. (ca) Trng i hc Minnesota; trnh Smith (ca)
Trng i hc Trng thi H thng cn vng bc; Robert Mt. Donnel (ca) Trng cao
ng Goldey - Beacom; Dave Anstett (ca) Trng cao ng (ca) St. Scholastica;
Leonard Yarbrough (ca) Chnh (v i) Nhn Trng cao ng; v Thung lng nh
TRANG 6
PHN MM NH LNG POMQM
Cheryl v Ru Steve. S Gy m Madeline (ca) Trng i hc Trng thi Utah cung

cp cho mt rng ln xem li (ca) Phin bn 2 cho Windows.
Nhng tho lun vi Fred Murphy v Carl Harris mun rt hu ch ti ti, c bit
trong lp trnh ton hc v xp hng Nhng m un.
C vi c nhn (ti) Phng ln Prentice ti ngi m (m) Ti phi cho c bit
cm n. Wohl v Ngi xp np Tom Giu l nhng ngi bin tp vi ngi m (m)
Ti c lm vic trn (v) d n ny cho 6 phin bn u tin. Khng phi l tt c cc
ngi bin tp c sc so ca h hiu (ca) nhng my tnh, phn mm, nhng vn bn,
nhng sinh vin, v nhng gio s. Khng c s nhn v hiu bit ny, POM - QM cho
Windows vn cn l mt s nhn hn l mt thc t. Nhng ngi bin tp hin thi
(ca) Ti, Pfaltzgraf v Alana Bradley nh du dng lm phng tin trong vic c
phin bn ny tip th. Phng ln Prentice Thnh vin (bn) (m) nhng tc gi bao
gm Barry Tr li, Bc thang Ralph, s V nh (b ri) Taylor, V Chim gi ci Anh ta
gip ti lm cho s chuyn tip t bn chnh lm sn phm n Windows hin thi l
nhng sn phm v ci thin sn phm Windows. Ti bit n cho nhiu gi ca h
v s vic m chng chn phn mm (ca) Ti nh phn mm h tng nhng vn
bn ca h. S h tr, s ng vin, v s gip t tt c nhng ngi ny (th) rt
nhiu c nh gi. Ngi tht ha Nancy cung cp s h tr (ca) nhng trang Web
Phng ln Prentice m c bo tr cho nhng sn phm ny. Cui cng, Ti thch biu
th s nh gi (ca) Ti ti Debbie Clare (m) ngi c Gim c tip th cho phn mm
(ca) Ti.
Trong khi lun lun, Ti phi biu th s nh gi v tnh yu (ca) Ti ti v (ca)
Ti, Lucia, (S) hiu v h tr trong thi gian qun chng nhng gi m tip tc tn
(ca) c y pha trc PC (ca) Ti. Ngoi ra, Ti (th) bit n cho nhng bnh lun v
nhng gi qi gi lu tm ti v ngoi (ca) phn mm t Lucia v tr con (ca) Ti,
Ernie v Lisa.
CHNG 1 : LI GII THIU
(Chapter 1 : Introduction)
TNG QUAN
(Overview)
S Cho n ti gi phn mm Khoa hc Quyt nh (ca) Prentice - Phng ln:
POM - QM cho Windows ( A.k.a. POM cho Windows v QM cho Windows). Gi ny l gi
phn mm d s dng nht sn sng trong nhng lnh vc nhng qun l sn xut v
thao tc, nhng phng php nh lng, khoa hc qun l, hoc vn tr hc. POM-QM
cho Windows c thit k gip bn tt hn hc v hiu nhng lnh vc ny.
Phn mm c th s dng hoc gii quyt nhng vn hoc kim tra nhng cu tr
li m c dn xut ra bng tay. POM - QM cho Windows cha ng mt s ln m
hnh, v hu ht vn bi tp nh trong nhng sch gio khoa POM hoc nhng
sch gio khoa QM c th c gii quyt hoc tip cn s dng POM-QM cho
Windows.
Trong li gii thiu ny v bn chng tip theo, chng ta m t nhng c tnh
chung (ca) phn mm. Chng ta ng vin bn c chng trong khi chy phn mm
trn (v) my tnh (ca) bn. Chng 6 cha ng s m t (ca) nhng m hnh v
nhng ng dng c bit sn sng trong POM - QM cho Windows.
TRANG 7
PHN MM NH LNG POMQM
Bn s tm thy phn mm (th) rt d s dng v nhng c tnh sau :

S TIU CHUN HA
(Standardization)
Giao din ngi dng th cho phn mm l mt giao din Windows chun. Bt c
ai Quen thuc vi bt k bng biu chun no, b x l vn bn, hoc gi biu din trong
Windows s d dng (th) c th s dng phn mm. Giao in chun ny bao gm thc
n theo l thng, thanh cng c, qun ru tnh trng, v nhng file gip (ca)
Windows lp trnh.
Mc d phn mm cha ng 29 m un v hn 60 m hnh, nhng mn nh cho
mi m un (th) chc chn, sau bn tr thnh quen s dng mt m un (m) bn
s c mt thi gian d vi nhng m un khc.
Kho v ly li H s (th) n gin. Nhng h s c m v ct gi trong kiu
cch Windows thng thng v, ngoi ra, nhng h s (th) c tn bi m un, m lm
d tm thy trc c ct gi nhng h s.
D liu v nhng kt qu , k c nhng th, c th d dng c sao chp v
dn gia ng dng ny v nhng ng dng Windows khc.
TNH LINH HOT
(Flexibility)
Nhng thnh phn mn nh v nhng mu c th (th) ty bin bi ngi dng.
(Ci) ny c th (th) c hiu qu c bit trn (v) trn u d liu cho thy.
Ngi dng c th la chn u ra mong mun in hn l phi in mi th. Ngoi ra,
vi ty chn khun dng in (th) sn c.
C vi s u tin m ngi dng c th la chn t s Gip , thc n Thng tin
Ngi dng. Cho v d, phn mm c th (th) c t ra t ng ct gi mt h s
sau khi d liu c vo v / hoc t ng gii quyt mt vn sau khi d liu
c vo.
THIT K THEO HNG NGI DNG
(User-oriented design)
Ngi bin tp d liu bng biu - kiu lm cho d liu l d v cng mc vo v
son tho. Ngoi ra, bt c ni no d liu s c vo, c mt ch dn sng sa c
cho trn (v) mn nh m t ci g s c vo, v khi d liu c vo khng ng
mt thng bo li sng sa c trnh by.
Tht d thay i t phng php gii php ny sang ci khc trong th t ti
nhng phng php v nhng cu tr li so snh. Trong vi trng hp, iu ny n
gin Mt Mt - kch thao tc. Ngoi ra, nhng bc trung gian ni chung sn sng cho
mn hnh.
Mn hnh c Mu nh la nhng cu tr li s xut hin trong mt mu khc
nhau t d liu.
TRANG 8
PHN MM NH LNG POMQM
S THC HIN SCH GIO KHOA THEO YU CU KHCH HNG
(Textbook customization Ty bin ti sch gio khoa)

Phn mm c th (th) ty bin ti Prentice - nhng sch gio khoa phng ln trong
th t m nhng m hnh, nhng k php v mn hnh s ph hp sch gio khoa c
bit.
H TR NGI DNG
(User support)
Nhng s cp nht sn sng trn (v) Internet xuyn qua web-site Phng ln
Prentice cho (quyn) sch ny, http: // Www.prenhall.com / weiss, V, Gip l sn c
gn tip xc vi dsSoftware@prenhall.com.
Ci g tt c nhng phng tin ny ti bn l vi mt cc tiu u t (ca) thi
gian bn trong hc c s (ca) POM - QM cho Windows, bn s c mt chnh d s
dng c ngha nh gii quyt nhng vn hoc kim tra bi tp nh (ca) bn.
Hn l hin thn gii hn ti vic xem nhng cu tr li bn trong sau (ca) sch gio
khoa (ca) bn, bn s (th) c th nhn thy nhng gii php cho a s cc vn .
Trong nhiu trng hp, nhng bc trung gian c trnh by gip bn kim tra
cng vic (ca) bn. Ngoi ra, bn s c kh nng thc hin s phn tch nhy cm
trn (v) nhng vn ny hoc gii quyt nhng vn ln hn, th v hn.
NHNG YU CU PHN CNG V PHN MM
(Hardware and Software Requirements)

MY TNH
(Computer)
Phn mm c nhng yu cu h thng cc tiu. N s chy trn (v) bt k my
Pentium PC tng thch IBM no vi t nht 8 MB Nhi nht v Windows 2000 operating,
Windows NT, Windows Ti hoc Windows XP.
A IU KHIN / CD ROM
(Disk Drives/CD-ROM)
Phn mm c cung cp trn (v) mt CD. (Ci) ny yu cu mt a CD-ROM.
MN HNH THEO DI
(Monitor)
Phn mm khng c nhng yu cu mn hnh c bit. Nhng mu Khc nhau
c s dng v chn dung nhng tit mc Khc nhau. Tt c cc thng bo, u
ra, d liu, vn vn. s l ra trn (v) bt k mn hnh no. Bt chp (ca) kiu mn hnh
m bn ang s dng, phn mm c kh nng m cho php bn ty bin nhng mu v
/ hoc nhng kch thc phng v phng trong mn hnh ti a thch (ca) bn. y
(th) hu ch v cng Khi no vic s dng mt h thng chiu trn u. Nhng ty
chn ny c gii thch trong Chng 3 trong c php mc (khu vc) nh dng.
TRANG 9
PHN MM NH LNG POMQM
MY IN
(Printer)
Mt my in (th) cha c yu cu chy phn mm nhng, tt nhin, nu bn
mun Mt s sao chp cng (printout) th tht cn thit c Mt my in c gn. S
in l tiu chun khng c c tnh c bit, nhng c tnh no, hoc nhng my in
c yu cu. N cng (th) c th in ti mt h s nhp khu printout vo trong
mt b x l vn bn cho xa hn na s son tho.
NHNG QUY C K THUT TYPOGRAPHIC TRONG TI LIU NY
(Typographic Conventions in this Manual)

1. Khi chng ta s dng ch nt m, chng ta ang ch bo ci g Bn nh my
hoc n.
2. Khi chng ta s dng mt du mc [ ], (M) chng ta ang t tn mt cha kha trn
(v) bn phm hoc mt nt lnh trn (v) mn nh. Cho v d [F1] C ngha cha kha
Hm F1, Trong khi [Ok ] c ngha nt ' ng ' trn (v) mn nh.
3. Chng ta s s dng [Return], [Enter], Hoc [Tr li / Vo] Ti phng tin (m) cha
kha trn (v) bn phm (ca) bn m c mt trong s nhng ci t tn. Tn (ca) cha
kha thay i trn (v) khc nhau (m) c nhng bn phm ln vi (k) thm ch c kha.
4. Chng ta s s dng ch nt m v t bn ha duy nht (m) bc th u tin
tham chiu ti mt thc n Windows ra lnh. Cho v d, H s tham chiu ti lnh thc
n.
5. Chng ta s s dng tt c cc vn tham chiu ti mt lnh such (nh vy) thanh
cng c nh gii quyt.
THIT T PHN MM
(Installing the Software)

Chng ta gi thit trong nhng phng hng m i theo m cng (th) c tn C:
V CD - ROM iu khin D:. Phn mm c thit t trong thi m a s cc
chng trnh thit k nh Windows c thit t. Cho tt c cc s sp t Windows,
bao gm ci ny, n Tt nht nh v rng khng c chng trnh no ang chy trong
khi bn ang thit t mt mt mi.
S Chn (m) CD vi POM - QM cho Windows bn trong iu khin D:. Sau mt
nh b trong khi chng trnh sp t cn phi bt u t ng. Nu N lm Khng Ri:
a. T Windows Khi ng Nt c la chn, chy.
b. Duyt CD cho D:setup.pomqmv3.exe ( Trng hp khng quan trng).
c. n [ Vo ] Hoc Kch vo [ Ok ].
i theo nhng ch dn ci t trn (v) mn nh. Ni chung, n gin l cn thit
kch [ (k) Tip theo ] mi thi gian m s sp t hi mt cu hi.
Nhng gi tr Mc nh c gn trong chng trnh ci t, nhng bn c th
thay i chng nu bn thch. Ngn mc nh l C:\Program Files\POMQMV3.
Chng trnh ci t s hi bn cho thng tin ng k nh tn (ca) bn, trng i
hc, gio s, v hng. Tt c cc tit mc u (th) chn ngoi tr sinh vin / Ngi
dng t tn ci phi (th) cho. Tn ny khng th c thay i v sau! thay
TRANG 10
PHN MM NH LNG POMQM
i thng tin khc t bn trong chng trnh , hy s dng s Gip , Thng tin Ngi
dng.
Phi chng bn c CD t Qun l nhng thao tc, 8e sch gio khoa gn Anh ta V
Tr li phn mm S t ng c thit t nh POM cho Windows v ty bin ti sch
gio khoa. Trong tng lai, nu bn c Prentice khc - nhng sch gio khoa Khoa hc
Quyt nh Phng ln th phn mm s trn (v) CD Trong sau (ca) sch gio khoa v
chng trnh S c ty bin ti sch gio khoa. Nu bn c POM - QM cho Windows
CD bn c th ty bin phn mm ti nhng sch gio khoa bi vic s dng s Gip
, Thng tin Ngi dng.
Mt ty chn m s sp t s hi bn quanh l whether Hoc Khng phi l bn
mun (th) c th chy chng trnh bi vic nhn p trn (v) tn h s trong Ngi
thm d H s. Nu bn ni ting vng, th chng trnh s lin kt nhng m rng
thch hp vi tn chng trnh. y (th) rt hu ch ni chung.
Xin ch rng phn mm thit t vi h s ti th mc H thng Windows. S sp
t s sao lu bt k nhng h s no m c thay th nu bn la chn ty chn ny.
Nu bn nhn thy mt thng bo vic ni rng ci g (th) sai trong thi gian s
sp t v bn c ty chn (ca) vic l i, ri chn ty chn ny. Chng trnh s c v
thit t ng mc d sao i na. Thng bo thng thng ch bo rng bn ang chy
mt chng trnh hoc chy mt chng trnh m chia s mt h s vi gi phn
mm ny. Nu bn c bt k s sp t hoc nhng vn thao tc no ch u tin
kim tra l trang ti xung (ti) www.prenhall.com / weiss.
THIT T V CHY TRN MT MNG
(Installing and Running on a Network)

Vi s cho php vit (ca) Phng ln Prentice, tht tha nhn c thit t
phn mm ti mt mng ch khi mi sinh vin c mua (m) mt c nhn sao chp
(ca) phn mm. Ci , Tng ci Sinh vin phi s hu Anh y Hoc Chnh mnh Cp
php s sao chp (ca) CD thit t phn mm trn (v) mt mng.
NHM CHNG TRNH
(The Program Group)

S sp t s thm mt nhm chng trnh vi bn tit mc vo thc n khi
ng. Nhng tn (ca) nhng tit mc ( POM, QM hoc POM - QM) Ph thuc vo liu
c phi CD t sau (ca) sch gio khoa Hoc Mt ng - CD mt mnh.
S Gip sn sng t bn trong chng trnh, nhng nu bn mun c thng tin

v chng trnh no m khng khi ng n trc, hy s dng POM - QM cho biu
tng Gip Windows 3.
TRANG 11
PHN MM NH LNG POMQM
Nhm chng trnh cha ng mt biu tng ch nh Prentice lm Cng vo

website Phng ln. Nu bn c mt hip hi cho nhng h s HTML vi mt b duyt
Mng ( e.g., Netscape hoc Internet Explorer), th ti liu ny s ch bn lp trnh nhng
s cp nht.
Cui cng, phn mm n vi mt My tnh Phn phi Bnh thng. My tnh trn
(v) thc n nhng cng c (ca) chng trnh nhng cng c th c s dng Nh
Mt Chu ng chng trnh mt mnh m khng phi m POM - QM cho Windows.
Ti uninstall chng trnh s dng nhng th tc uninstall Windows thng thng
(Khi ng, t, iu khin Bng, Thm/Bt chng trnh). Nhng chng trnh s
c loi b tr phi nhng h s d liu Khng s; chng s phi (th) b xa s dng
My tnh hoc H s (ca) Ti (m) Ngi thm d nu bn mun lm nh vy.
Ngoi thc n khi ng, s sp t s t mt phm tt ti chng trnh trn (v)
desktop. Biu tng s l mt trong s ba biu tng c trnh by di vic ph
thuc vo CD chnh xc c s dng. D biu tng desktop no c thit t
Biu tng m c th s dng d dng bt u l chng trnh.
KHI NG CHNG TRNH
(Starting the Program)

Cch d nht khi ng chng trnh bi vic nhn p biu tng chng trnh
m trn (v) desktop. Cch khc, bn c th s dng Windows chun c ngha nh khi
ng chng trnh. Kch vo Bt u, nhng chng trnh, POM - QM cho Windows 3,
POM - QM cho Windows 3 s dng phn mm. Sau khi ng chng trnh, mt
mn nh bn te nc s xut hin Nh c trnh by trn (v) trang tip theo.
TN CA NGI NG K S DNG
(Name)
Tn (ca) ngi c cp giy php s xut hin trong mn hnh. (Ci) ny cn phi
l tn (ca) bn nu bn ang tip tc chy Mt ng - My tnh mt mnh hoc tn
mng nu bn ang chy trn (v) mt mng.
TRANG 12
PHN MM NH LNG POMQM
S PHIN BN
(Version Number)
Mt mnh quan trng (ca) thng tin l s phin bn (ca) phn mm. Trong v d,
Phin bn l 3.0 v ti liu ny c thit k xung quanh s . Trong khi y l
Phin bn 3.0 cng l thng tin v Phin bn chng trnh m c th c tm thy
s dng s Gip , Quanh (c trnh by (ti) chnh kt thc (ca) Chng 3) chi
tit hn. Trong c bit, c mt s xy dng. Nu bn gi e-mail hi v k thut h tr,
th bn cn phi bao gm s xy dng vi e-mail.
Ghi ch : Nu chng trnh c ng k nh hin thn trong mt phng th
nghim cng cng hoc trn (v) mt mng th (ti) im ny mn nh m u s thay
i v cho bn c hi vo tn (ca) bn. (Ci) ny (th) hu ch khi bn in nhng
kt qu (ca) bn.
Chng trnh s bt u trong mt i giy sau khi mn hnh m u xut hin.
MN NH CHNH (GIAO DIN CHNH)
(The Main Screen)

Mn nh (th) hai m xut hin l mt mn nh thc n chnh trng rng. Ln u
m mn nh ny xut hin, mt Mo nh (ca) mu (dng) Ngy s xut hin nh c
trnh by bn di. Nu bn khng mun Mo nh (ca) Ngy ra mi thi gian, ri
uncheck ci hp (ti) thp hn b i (ca) mu (dng). Nu bn thay i nh (ca)
bn v sau v mun nhn thy Mo nh (ca) Ngy, hy ri i ti thc n Gip .
TRANG 13
PHN MM NH LNG POMQM
Xin ch , nn trong gia (ca) mn nh. (Ci) ny c vin dn nh mt ng

dc. ng dc ny xut hin mi khi mn nh chnh (th) trng rng v n xut hin trn
(v) nhng mn nh khc trong phn mm. Bn c th ty bin mn hnh (ca) ng
dc bi vic s dng Khun dng, nhng mu nh c gii thch trong Chng 3.
Sau ng Mo nh (ca) Ngy, hoc nu bn c c chn khng nhn thy
nhng Mo nh, mn nh tip theo l mn nh chn lc m un ( vo Chng 2).
trnh by tt c cc thnh phn mn nh, chng ta la chn mt m un v ti mt h
s d liu.
nh (ca) mn nh l thanh tiu Windows chun cho ca s. (ti) s bt u

tiu l POM - QM cho Windows ( Hoc POM cho Windows hoc QM cho Windows).
Nu bn ang s dng mt vn bn Phng ln Prentice th nhng tn (ca) nhng tc
gi (ca) nhng vn bn cn phi xut hin trong thanh tiu ny (ti) s bt u
(ca) chng trnh nh c cho thy trong hnh trn (v) trang trc y. ( Nu khng,
i ti s Gip , Ngi dng Information.) (m) thanh tiu s thay i bao gm
tn (ca) h s khi mt h s c ti hoc ct gi nh c cho thy trn. Trn (v)
tri (ca) thanh tiu l ci hp iu khin Windows chun v Trn (v) phi (ng) l
tiu chun ti gin, lm cc i, v ng nhng nt cho nhng ty chn o c ca s.
TRANG 14
PHN MM NH LNG POMQM
bn di thanh tiu l mt qun ru m cha ng Thc n Chnh. Qun

ru thc n (th) rt truyn thng v cn phi (th) d s dng. Nhng chi tit (ca)
nhng ty chn thc n (ca) H s, Son tho, Cnh quan, M un, Khun dng,
nhng cng c, Ca s, v s Gip c gii thch trong Chng 3. (ti) s bt
u (ca) chng trnh, Son tho ty chn Cha c cho php, trong khi khng c d
liu Son tho. Ty chn Ca s cng c v hiu ha, mt khi (ci) ny tham chiu
ti nhng ca s kt qu v chng ta khng c nhng kt qu. Trong khi thc n xut
hin trong v tr Windows chun (ti) nh (ca) mn nh, n c th c di chuyn nu
bn thch bi vic kch vo cn trn (v) tri v ko con chut.
di thc n l mt thanh cng c chun (cng c gi l mt qun ru nt

hoc ruy bng). Thanh cng c ny cha ng nhng phm tt Cho Vi (Ca) nhng
lnh thc n thng s dng nht. Nu bn di chuyn con chut qua cng c cho
khong hai giy, mt gii thch (ca) cng c ( s gip kh cu) s xut hin trn (v)
mn nh. Trong khi vi a s cc gi phn mm, thanh cng c c th c che giu
nu bn nh vy chn (Phi (ng) kch trn (v) bt k thanh cng c hoc Cnh quan
s dng, thanh cng c no, Ty bin). Vic che giu thanh cng c, k c nhiu phng
hn trn (v) mn nh cho nhng vn . Nh n c trng hp vi a s cc thanh
cng c, chng ta cho php thanh cng c ni. Trong th t ti reposition bt k thanh
cng c no, n gin kch vo cn trn (v) s ko v tri.
Mt cng c rt quan trng trn (v) thanh cng c chun Gii quyt cng c trn
(v) xa ngay (ca) thanh cng c. y Bn nhn (nn) sau bn c vo d liu v bn no
sn sng gii quyt vn . Cch khc, bn c th s dng H s, Gii quyt hoc n
[F9] Cha kha. Xin ch rng sau n Gii quyt cng c, cng c ny s thay i Ti
Mt Son tho cng c. (Ci) ny ang lm sao bn i li li v v pha trc t vic vo
d liu nhn gii php. Cho hai m un, lp trnh v vn ti tuyn tnh (thng), c mt
lnh na m s xut hin trn (v) thanh cng c chun. (Ci) ny l cng c Bc
(cha c trnh by trong hnh), v n cho php bn Bc i xuyn qua nhng s lp
i lp li, trnh by mt s lp i lp li ti mt thi im.
di thanh cng c chun l mt thanh cng c khun dng. Thanh cng c ny

l chnh tng t ti nhng thanh cng c tm thy bn trong Vt hn, Pht biu, v
WordPerfect. Cng l N C th (th) ty bin, c di chuyn, che giu, hoc ni.
C mt thanh cng c na, v s nh v (v tr) mc nh (ca) n (ti) y (ca)

mn nh. Qun ru ny l mt qun ru c ch v n cha ng su cng c. Cng
TRANG 15
PHN MM NH LNG POMQM
c trn (v) tri l M un c tn. Mt danh sch m un c th xut hin vo hai nhng
cch - Hoc bi vic s dng cng c ny hoc ty chn M un trn (v) thc n
chnh. Cng c tip theo l Mn nh In c tn, v l m thi ua vi c (gi) In
hm Mn nh bn trong lm. Hai cng c tip theo s ti nhng h s trong theo vn ch
ci sp t hoc pha trc hoc li. (Ci) ny (th) rt hu ch khi xem li mt s vn
trong mt chng nh nhng h s mu ci h tng ti liu ny. Hai cn li nhng
cng c cho php nhng h s c ct gi Nh Vt hn Hoc Nhng h s HTML.
Trong trung tm l hai vng, Mt (Ca) M l bng d liu chnh. Bng cha ng
mt tiu hoc tiu v sau n gin cho v nhng ct. S (ca) nhng hng v
nhng ct ph thuc vo m un, kiu vn , v vn c bit. Vng ln khng vi li
no l nn bng. Nhng mu u , nhng mu v nn bng c th c thay i bi
vic s dng Khun dng, nhng mu, nh c gii thch trong Chng 3.
trn bng d liu l mt c tn vng (m) d liu thm ngn chn t thng tin
vn thm. i khi tht cn thit ch bo liu c phi ti gin hoc lm cc i,
i khi n (th) cn thit la chn mt phng php, v i khi gi tr no phi (th)
cho. Nhng (iu) ni chung xut hin trn d liu. Trn (v) phi (ng) (ca)
bng d liu thm l mt bng ch dn. C lun lun mt ch dn y gip bn
xut hin ngoi Phi lm g hoc phi vo g. Khi d liu s c vo trong bng d
liu, ch dn ny s gii thch kiu d liu no ( S nguyn, thc t, dng tnh, etc.) s
c vo. S nh v (v tr) ch dn c th c thay i bi vic s dng ty chn Cnh
quan.
TRANG 16
PHN MM NH LNG POMQM
cng l mt mu (dng) ch thch nhng vn . Mt bnh lun c th c

t y. Khi h s c ct gi, thng tin s c ct gi; khi h s c ti, thng
tin s xut hin v ch gii c th c in nh vy th c mong mun.
V pha y (ca) mn nh l bng tnh trng. Bng cc t s trnh by tn m un

v m hnh con trong khi bn la chn nhng m un khc nhau, nh c minh ha
bng v d trong s minh ha ny ni m un l s D bo v m hnh con l s Phn
tch t Thi gian. Bng trung tm cha ng kiu mn nh (D liu, nhng kt qu,
thc n, th, etc.) v bng rightmost c tn sch gio khoa (Phi chng mt sch
gio khoa c la chn). Qun ru tnh trng c th c che giu bi vic s
dng ty chn Cnh quan. Bng ny khng th c di chuyn.
CHNG 2 : MT VN MU
(Chapter 2 : A Sample Problem)
LI GII THIU
(Introduction)
Trong chng ny, chng ti s chy qua mt vn mu t u n cui
chng minh lm th no s dng cc gi phn mm. Trong khi khng phi l tt c
cc vn hoc nhng m un (th) ng nht, l s ging nhau m nhn thy
mt v d s lm n rt d s dng bt k m un no trong phn mm ny. Nh
chng ta cp trong li gii thiu, ch dn u tin s la chn mt m un bt u
cng vic.
Trong trn hnh, chng ta trnh by nhng m un trong khi chng c lit k khi
bn s dng cng c M un trn (v) qun ru c ch ( ngc vi ty chn m un
TRANG 17
PHN MM NH LNG POMQM
trong thc n chnh (ti) nh). Nh bn c th nhn thy, c 29 m un m (gm 60

module con) sn c. Chng c chia ct vo trong 3 nhm. Nhng m hnh trong nhm
u tin tiu biu c bao gm trong tt c POM v nhng (quyn) sch QM, trong khi
nhng m hnh trong nhm (th) hai tiu biu xut hin ch trong nhng (quyn) sch
POM v nhng m hnh trong nhm (th) ba xut hin ch trong nhng vn bn QM.
Nhng m hnh c chia ct trong kiu cch ny bn s bit rng tht tinh t l i
POM duy nht nhng m un nu bn c mt hng QM V Thay cho - Versa.
Nu bn chn ty chn M un t Thc n Chnh, bn lm ch nhng cng M
un lit k mt n lit k trong th t theo vn ch ci. ((ci) ny c trnh by
trong Chng 3) (m) Bn c ty chn trn (v) thc n ny trnh by ch nhng m
un POM hoc ch nhng m un QM.
TO RA MT VN MI
(Creating a New Problem)

Ni chung, ty chn thc n u tin m s (th) c chn l H s, i theo bi
mi Mi to ra mt tp hp d liu Mi hoc M ti Mt Trc ct gi tp hp d
liu. Trong hnh m i theo, chng ta cho thy mn nh to thnh m c s dng khi
mt vn mi c khi ng. R rng, y l mt ty chn m s (th) c chn rt
thng. Nhng mn nh to thnh (th) tng t cho tt c cc m un, nhng c nhng
s khc nhau mnh khnh m bn s nhn thy t m un n m un.
Hng nh cha ng mt ci hp vn bn vo trong tiu (ca) vn c th

c vo. Tiu mc nh cho nhng vn Thot tin "( Untitled)". Tiu mc nh
c th c thay i bi vic nhn (nn) nt [ Sa i Tiu Mc nh ]. Cho v d, nu
bn thay i tiu mc nh Ti " Vn Bi tp nh " Ri mi thi gian bn khi
ng mt Vn mi Tiu s xut hin nh Vn Bi tp nh, v bn n gin
cn thm s Vn hon thnh tiu . Nu bn mun thay i tiu sau to ra vn
, (ci) ny c th d dng c lm bi vic s dng Khun dng, ty chn Tiu t
qun ru thc n chnh hoc t thanh cng c.
TRANG 18
PHN MM NH LNG POMQM
Cho nhiu m un, tht cn thit vo s (ca) nhng hng trong vn . Nhng
hng s cho php nhng tn khc nhau ph thuc vo m un. Cho v d, trong lp trnh
tuyn tnh (thng), nhng hng " Nhng s rng buc ", Trong khi trong s d bo,
nhng hng " Nhng thi k qua ". (ti) bt k nhp no, s (ca) nhng hng
c th (th) c chn vi hoc qun ru cun hoc ci hp vn bn. Nh n c thng
thng trng hp trong Windows, chng (th) c ni. Trong khi bn di chuyn qun
ru cun, s trong ci hp vn bn thay i; trong khi bn thay i vn bn, qun ru
cun di chuyn. Trong chung, s cc i (ca) nhng hng Trong bt k m un no l
90. l ba nhng cch thm hoc xa nhng hng hoc nhng ct sau khi vn
c to ra. Bn c th s dng nhng ty chn trong Edit menu, Bn c th nhn
phm phi trn (v) bng d liu m s mang ln trn (m) c hai sao chp v s chn /
Xa nhng ty chn Hoc, Chn mt hng hoc chn mt ct, Bn c th s dng
nhng cng c trn (v) thanh cng c.
Chng trnh ny c kh nng cho php bn khc nhau nhng ty chn cho mc
nh cho nhng tn. La chn mt trong s su nt ty chn ch bo kiu no (ca)
mc nh t tn cn phi c s dng. Trong a s cc m un, nhng tn hng (th)
cha c s dng cho nhng tnh ton, nhng bn cn phi (th) cn thn v Trong vi
m un ( ng ch Lp n cho Qun l v MRP) Nhng tn c th (th) thch ng
ti nhng tnh ton. Trong a s cc m un, nhng tn hng c th c thay i bi
vic son tho bng d liu.
Nhiu m un yu cu mt s ct. (Ci) ny l cho bn trong cng cch nh
s (ca) nhng hng. Chng trnh cho bn mt s la chn (ca) mc nh nh gi
nh nhng tn ct trong nhng tn Ct cng kiu cch nh nhng tn hng nhng trn
(v) c tn bng.
Chng ta thm mt bng tng quan vo mn nh to thnh trong phin bn ny
(ca) phn mm. Bng tng quan cho mt s m t ngn gn (ca) nhng m hnh
m (th) sn c v cng cho bt k quan trng no thng tin lu tm ti s to thnh
hoc mc vo d liu cho m un .
Vi m un , nh v d lp trnh tuyn tnh (thng) c trnh by trn (v) trang

trc y, s c mt ci hp ty chn thm, such Nh chn Ti gin hoc lm cc
i hoc la chn liu c phi nhng khong cch (th) cn i Hoc Khng. La chn
TRANG 19
PHN MM NH LNG POMQM
mt trong s nhng ty chn ny. Trong a s cc trng hp, ty chn ny c th c

thay i v sau trn (v) mn nh d liu.
Khi bn c tha mn vi nhng s la chn (ca) bn, kch vo [ Ok ] tht nt.
(ti) im ny, mt mn nh d liu trng s xut hin nh cho trong hnh sau.
Nhng mn nh s khc M un bi m un nhng chng s hon ton ging vi mn
nh trn (v) trang sau.
MN NH D LIU (GIAO DIN NHP LIU)
(The Data Screen)

Mn nh d liu vn tt c m t trong Chng 1. N c mt bng d liu v,
cho nhiu m hnh, c thm thng tin m xut hin trn bng d liu nh c cho
thy trong hnh bn di.
SON THO V NHP LIU
(Entering and Editing Data)

Sau khi mt tp hp d liu mi c to ra hoc mt hin hu c ti, d
liu c th c vo hoc son tho. Mi mc vo trong mt v tr hng v ct. Bn nh
hng xuyn qua bng biu s dng nhng cha kha chuyn ng cursor ( Hoc Con
chut). Nhng (iu) kha hm trong mt bnh thng cch vi mt ngoi l rt hu
ch - [ Vo ] Cha kha.
[ Vo ] Cha kha cm (ly) bn cho tip theo trong bng, chuyn ng u tin
ti phi (ng) v sau chuyn ng xung. Khi mt hng (th) kt thc, [ Vo ] Cha
TRANG 20
PHN MM NH LNG POMQM
kha i ti u tin trong hng tip theo m cha ng d liu hn l mt tn hng.

Cho v d, trong mn nh trn, nu bn vo lc cui (ca) c tn hng " Ngun (m) 1 "
v bn nhn (nn) [ Enter], (m) cursor s di chuyn ti Vi Mt " 0 " trong hng tip
theo. Tht c th t cursor i ti u tin, ci vi tn trong N, bi vic s dng
s Gip , Thng tin Ngi dng.
Trong s thm, nu bn s dng [ Vo ] Cha kha Vo d liu, sau bn c
lm vi cui cng (m) chng trnh s t ng gii quyt Vn ( Ct gi cho bn s
rc ri (ca) vic tip tc kch Gii quyt cng c). Hnh vi ny c th cng c iu
chnh bi s dng s Gip , Thng tin Ngi dng v, trong s thm, nu bn mun
chng trnh t ng nhc bn ct gi h s khi bn ang vo d liu, iu ny c
th c hon thnh xuyn qua s Gip , Thng tin Ngi dng.
Khung ch dn trn (v) mn nh s cha ng mt ch dn ngn gn m t ci g
s c lm. C thc cht ba kiu trong bng d liu.
Mt kiu l Mt b phiu t tnh (ghi d liu) bnh thng vo trong bn vo hoc
Mt tn hoc Mt s. Khi vic vo nhng tn v nhng s, n gin nh my tn hoc
s; ri n [ Vo ] cha kha hoc mt trong s phng hng kha hoc kch vo khc.
Nu bn nh my mt c tnh bt hp php, th mt ci hp thng bo s c trnh
by Ch bo nh vy.
Mt kiu (th) hai l Mt m khng th c son tho. Cho v d, trng rng
trong trn cho gc bn tay (ca) bng khng th c son tho. ( Bn tht s c th
dn vo trong .)
Mt kiu (th) ba l Mt m cha ng Mt ci hp th xung. Cho v d, nhng
du hiu trong mt s rng buc lp trnh tuyn tnh (thng) (th) c chn t kiu ci
hp, nh c cho thy trong s minh ha sau ny. nhn thy tt c cc ty chn ,
hy nhn (nn) mi tn trn (v) ci hp th xung.
Khi bn (th) kt thc vic vo d liu, n Gii quyt cng c trn (v) thanh cng
c hoc s s dng [ F9] Hoc Sp xp, Gii quyt V mt mn nh gii php s xut
hin nh cho trong s minh ha sau. D liu nguyn bn mu en v gii php trong
mt mu. Tt nhin, nhng (iu) ch l nhng gi tr mc nh, trong khi tt c cc
mu c th l tp hp bi vic s dng Khun dng, nhng mu.
MN NH GII PHP (CA S KT QU TNH C)
(The Solution Screen)

(Mt giao din gii php c th c nhiu gii php kt qu do thit t ty chn ca ngi
dng, v c th c hin th trong nhiu ca s cng lc).
TRANG 21
PHN MM NH LNG POMQM
Mt th quan trng ch l c nhiu sn c thng tin gii php hn hn ci t

ln bn trnh by. (Ci) ny c th c nhn thy bi nhng biu tng cho (ti) y.
Kch vo nhng (iu) nhn thng tin.
Cch khc, khi bn gii quyt vn , mu (dng) bn di c th (th) c t
ra xut hin trn (ca) gii php xuyn qua s Gip , Thng tin Ngi dng.
Nu bn kch vo nt nhng ty chn th bn c th thit lp hnh vi (ca) phn

mm khi mt vn c gii quyt. Nhng ty chn nh sau :
TRANG 22
PHN MM NH LNG POMQM
Ty chn u tin s n gin trnh by gii php. Ba ty chn tip theo l ti

vic nhc nh bn rng nhiu kt qu hn c th tn ti hn mt ca s c trnh by.
Ty chn (th) hai s trnh by Ca s nhng gii php m cha ng mt s m t
ngn gn (ca) mi Ca s gii php. Ty chn (th) ba s t ng th cho xung thc
n Ca s. Nhng ty chn ny C th Ngh ngi s dng s Gip , Thng tin
Ngi dng.
Chnh ni chung (ti) im ny m, sau vic xem li gii php, bn chn in c vn
ln gii php.
By gi m chng ta kho st s to thnh v gii php (ca) mt vn , chng
ta gii thch tt c (ca) nhng ty chn m sn sng ni chung Thc n.
CHNG 3 : THC N CHNH

(Chapter 3 : The Main Menu)
H S
(File)
H s cha ng nhng ty chn thng thng m mt tm thy trong a s cc
chng trnh Windows, nh c nhn thy trong hnh m i theo.
Nhng ty chn ny (th) by gi c m t.

MI
(New)
Trong khi c trnh din trong vn mu, ty chn ny (th) c chn bt u
mt vn mi / H s. Trong vi trng hp, bn s i trc tip ti mn nh to thnh
vn , trong khi Trong nhng trng hp khc mt thc n m ra s xut hin ch bo
nhng m hnh con m (th) sn c. Sau la chn mt m hnh, bn s i ti mn nh
to thnh.
TRANG 23
PHN MM NH LNG POMQM
(Open)
(Ci) ny c s dng m / Ti Mt Trc ct gi h s. S chn lc H s
l Windows chun (m) hi thoi chung nh my. Mt v d (ca) mn nh m mt
h s c cho thy bn di. Ch rng m rng cho nhng h s trong h thng
phn mm do ba bc th u tin a ra (ca) tn m un (Nhng ngoi l l s gi
thng bng dy chuyn lp rp (*. Cn bng) V Cch trnh by (*. Ope) V nhng quy
c trong nhng phin bn v nng sut trc y (*. Prd) trnh mt xung t vi d
n management.). Cho v d, tt c cc h s vn ti c m rng *. Tra. Khi bn i ti
hi thoi H s M, gi tr mc nh cho chng trnh tm kim nhng H s (ca)
kiu trong m un ny. (Ci) ny c th c thay i (ti) y b i, ni m n ni "
Nhng h s (ca) kiu. " Cch khc, sp xp m v vic ct gi (th) kh bnh thng.
iu khin Hoc Ngn c th c thay i Vi iu khin / Th xung ngn nh bc,
mt th mc mi c th c to ra s dng nt mi (ti) nh, v nhng chi tit v
nhng h s & ng c th c nhn thy bi vic s dng nt nhng chi tit (ti)
nh.
Tht c th s dng s Gip , Thng tin Ngi dng t chng trnh t

ng gii quyt bt k vn no khi N c ti. Cch ny, nu bn thch, bn c th
ang xem mn nh gii php bt c ni no bn ti mt vn hn l (ti) mn nh
d liu.
CT GI
(Save)
S lu tr s thay th h s m khng hi bn liu bn chm sc v vic ghi ln
phin bn trc y (ca) h s ny. Nu bn c gng ct gi v c khng c tn trc
h s, bn s c hi t tn h s ny.
TRANG 24
PHN MM NH LNG POMQM
Nhng tn m (th) hp php l nhng tn h s Windows chun. Ngoi tn h s,

bn M u thng Nm Tn Vi Mt iu khin bc th ( vi du hai chm (ca) n)
hoc s ch nh ng (dn). Phn mm s t ng ni vo mt m rng ti tn m
bn s dng. Nh c cp trn, m rng l ba bc th u tin (ca) tn m un.
Bn c th nh my nhng tn h s bn trong nh ch hoa, (ch) thng, hoc pha
trn. Nhng v d (ca) nhng tn h s hp php l mu, c:myFile, c:\myCourse\test, v
myproblem.example sample.tra.
Nu bn vo sample.tra v m un (th) khng phi l vn ti, th mt m rng s
c thm. Cho v d, nu m un l lp trnh tuyn tnh (thng), th tn di h s
s c ct gi s l sample.tra.lin.
CT GI NH L ...
(Save as)
S lu tr nh vic s nhc bn cho mt tn h s trc ct gi. Ty chn ny rt
tng t nh ty chn ti mt h s d liu. Khi bn chn ty chn ny, Windows hp
thoi Chung cho nhng h s s xut hin. N l ng nht thc cht ti ci trc
cho thy m nhng h s.
CT GI NH VT HN H S ( SAO LU THNH FILE EXCEL )
(Save as Excel File)

Phn mm c mt ty chn m cho php bn ct gi (Nhng khng phi l mi th)
(Ca) nhng vn nh vt hn nhng h s. D liu c chuyn ch vt hn v
bng biu c lm y nhng cng thc cho nhng gii php. Trong vi trng hp,
vt hn gii quyt c th c yu cu c gii php.
Cho v d, cho bn di l u ra t mt vic i k m hnh. Cnh bn tri c
d liu trong khi cnh hng tay phi c gii php. Ch d liu nh la (ca) cu tr
li i din mu.
Sau vic ct gi nh mt vt hn h s, vt hn h s xut hin bn di.

Ch t cng thc cho E7 (hin ra (ti) nh (ca) bng biu) m mt bng biu vi
nhng cng thc c to ra. Ci , (M) chng ta lm khng " S ct v bt nho "
trn mn nh vo trong vt hn (M (th) c th) nhng thay vo c to ra mt
vt hn bng biu vi nhng cng thc thch hp.
TRANG 25
PHN MM NH LNG POMQM
S LU TR NH H S HTML
(Save as HTML File)

Bt k bng no, hoc d liu hoc gii php, thng Nm c ct gi nh mt h
s HTML, nh c cho thy bn di.
Nu hn mt bng vo mn nh (ti) thi gian m ty chn ny c la chn, th

bng tch cc l ci m c ct gi.
TRANG 26
PHN MM NH LNG POMQM
S IN
(Print)
S in s trnh by mt mn nh ci t in. Nhng ty chn In c m t trong
chng 4. C s lu tr ln s In s hnh ng mnh khnh khc nhau nu mt th
ang c trnh by vo thi gian m bn s dng s In hoc ct gi.
MN NH IN
(Print Screen)
(Ci) ny s in mn nh trong khi n xut hin. Nhng quyt nh mn nh khc
nhau c th nh hng s in. Vic in mn nh l nhiu tn ph thi gian hn mt s In
bnh thng. Hy s dng ty chn ny nu bn cn diu hnh ti thy gio (ca) bn
chnh xc ci g vo mn nh (ti) thi gian.
GII QUYT
( TNH XEM KT QU )
(Solve)
C vi cch gii quyt mt vn . Kch trn (v) h s, gii quyt c l l cch
hiu qu ti thiu gii quyt vn . Biu tng thanh cng c c th c s dng,
Cng nh cha kha [F9]. Cng, Phi chng d liu c vo trong th t (chp ln ti
y, c li cho phi (ng), s dng [Enter]), (m) chng trnh s gii quyt vn
t ng sau cui cng.
Sau gii quyt, Gii quyt ty chn s thay i Ti Mt Son tho ty chn trn (v)
c hai thc n v thanh cng c. (Ci) ny l cch m i li li v v pha trc gia
d liu v nhng gii php. Ch rng s Gip , Thng tin Ngi dng c th s
dng t chng trnh t ng lm cc i gii php (m) nhng ca s nh vy
th mong mun.
THOT RA
(Exit)
Ty chn tip theo trn (v) thc n H s l Li ra. (Ci) ny s ra khi chng
trnh. Bn s c hi nu Bn mun ra khi chng trnh. Bn c th loi tr cu hi
ny bi vic s dng s Gip , Thng tin Ngi dng.
BN H S CUI CNG
(Last Four Files)

Thc n H s cha ng mt danh sch (ca) bn H s cui cng m bn s
dng. Vic kch vo mt trong s nhng (iu) s ti h s.
SON THO SA CHA
(Edit)
Nhng lnh di Son tho c th c nhn thy trong s minh ha sau. Nhng
mc ch Ca h (th) gp ba ln. Su lnh u tin c s dng chn hoc xa
nhng hng hoc nhng ct. Kiu lnh (th) hai (th) hu ch lp li rng nhng mc
trong mt ct, v kiu (th) ba cho s ct v dn gia Windows nhng ng dng. Tht
TRANG 27
PHN MM NH LNG POMQM
c th cho php s chn / Xa v sao chp nhng ty chn ng lut kch vo d liu
hoc bng gii php.
Hng Chn s Chn mt Hng sau khi Hng hin thi, v Ct Chn s Chn mt
Ct sau khi Ct hin thi. Chn Rows(s) V Chn Columns(s) Cho php bn Chn nhiu
hng hoc nhng ct. Xa Hng s Xa Hin thi Cho, v Xa Ct s Xa Ct hin
thi.
SAO CHP MC VO XUNG CT
(Copy Entry Down Column)

Lnh ny c s dng sao chp mt mc vo t mt n tt c cc di
n trong ct. (Ci) ny (th) khng phi l hu ch thng, nhng n c th ct gi nhiu
cng vic Khi no n.
SAO CHP
(Copy)
S Sao chp c nm ty chn sn c. Tht c th sao chp ton b bng, hng
hin thi, hoc ct hin thi ti ba kp giy. Tht c th sao chp t bng d liu
hoc bt k bng gii php no. Bt c iu g c sao chp C th ri c dn vo
trong chng trnh ny hoc chng trnh Windows khc no . (cng c sao chp
trong thanh cng c sao chp ton b table.) nu bn (ti) giai on gii php, s sao
li s cho bng m (th) tch cc.
c bit Sao chp s Sao chp ton b bng nhng cho php bn gii hn s (ca)
nhng phn thp phn m c Sao chp. Ct gi trong khi HTML s thc hin thao tc
HTML m (th) trc c m t.
BT NHO (DN)
Paste
Bt nho c s dng dn trong hin thi ni dung (ca) ba kp giy. Khi no

vic dn vo trong POM - QM cho Windows, s dn bt u (ti) cursor hin thi v tr.
TRANG 28
PHN MM NH LNG POMQM
Nh vy, l c th m sao chp mt ct i vi mt ct khc nhau bt u bn

trong mt khc nhau cho. (Ci) ny c th c lm to ra mt ng cho. l
khng c th dn vo trong mt bng gii php, mc d, nh c ch bo m trc
, tht c th sao chp t mt bng gii php.
Ghi ch : Phi (ng) - vic kch vo bt k bng no s mang ln trn Sao chp
nhng ty chn v phi chng bng l bng d liu (m) n cng s mang ln trn S
chn V Xa nhng ty chn.
CNH QUAN ( CC KIU XEM )
(View)
Cnh quan c vi ty chn m cho php bn ty bin s xut hin (ca) mn nh.
Thc n nhng thanh cng c cha ng hai ty chn. Thanh cng c c th (th)
ty bin (nh c th a s cc thanh cng c Windows) Hoc Thanh cng c c th l s
oa tr ti nguyn bn (ca) n nhn.
Qun ru ch dn c th c trnh by (ti) s nh v (v tr) mc nh (ca) n
trong bng d liu thm hoc trn d liu, hoc di d liu, hoc nh mt th ni
ca s, hoc khng phi (ti) mi th. mn hnh qun ru tnh trng c th c no
trn (v) hoc bn ngoi.
Mn nh y s quay tt c cc qun ru (thanh cng c, qun ru lnh, ch
dn, v qun ru tnh trng) Trn (v) Hoc Bn ngoi.
Zoom s pht sinh mt mu (dng) nh cho php bn gim bt hoc tng thm kch
thc (ca) nhng ct. Tht d hn s dng cng c zoom trn (v) thanh cng c
chun.
Nhng mu c th l tp hp ti n sc (en v trng) hoc t trng thi ny n
nhng mu Nguyn bn ca h. (Ci) ny trc y (th) rt hu ch khi trn u
nhng thit b trnh by nhiu tt hn trong n sc hn trong mu. Hm nay, nhng
my chiu (th) mnh n ni n sc ni chung (th) cha c yu cu.
CC M UN
(Module)
Mt danh sch th xung vi tt c cc m un trong th t theo vn ch ci s
xut hin. Cng c M un trn (v) thanh cng c c ch di vng d liu l mt giy
cch c mt danh sch (ca) nhng M un. (ti) y (ca) danh sch l nhng ty
chn ch bo liu c phi bn mun trnh by ch nhng m un POM (nh c trnh
by), ch Nhng m un QM hoc tt c cc m un.
TRANG 29
PHN MM NH LNG POMQM
KHUN DNG NH DNG
(Format)
Khun dng c vi ty chn cho mn hnh (ca) nhng bng d liu v gii php,
Nh C th c nhn thy trong s minh ha sau. Ngoi ra, c vi ty chn khun dng
b sung sn sng Trong thanh cng c khun dng.
NHNG MU
(Colors)
Nhng mu cho tt c cc mn hnh c th l tp hp. C nm bng nh c cho
thy bn di. Nhng ty chn ny s to ra nhng s thay i lu di trong khi m
cng c nn v mt trc trn (v) khun dng (m) qun ru s thay i ch (m) hin
TRANG 30
PHN MM NH LNG POMQM
thi t ln bn. Hn na, nhng s thit t mu cho ton b bng, trong khi nhng
cng c khun dng c th c s dng cho mi ton b bng hoc cho nhng ct
c chn.
Bng u tin t nhng mu trong bng d liu, v bng (th) hai t nhng
mu trong gii php nhng bng. Ci , N l c th c nhng mn hnh (ca) d
liu v mn hnh (ca) nhng kt qu xut hin khc nhau, m c th (th) c ch. Cho
hoc d liu hoc nhng kt qu, bn c th t mt trc v nn nhng mu Cho
nhng hng xen k bi vic s dng l v thm ch nhng ty chn. (Ci) ny lm
cho di (lu) c l nhng bng d hn.
t nhng mu, trc ht la chn thuc tnh bng m bn mun t, ri la

chn mt trc hoc nn nu thch hp, ri la chn nhng hng nu thch hp v sau
kch vo mu. Cho v d, hy kch vo Thn th, Mt trc, L v sau kch vo ci
hp mu v Mt trc Cho mi hng khc s tr thnh . Nhng s thay i y
s c bo tr khp ni cho n khi bn tr li cho mn nh ny v oa tr nhng mu.
Nu bn mun lm cho nhng s thay i trong ci duy nht l bng cho mt vn , th
n c th s d hn s dng nhng ty chn thanh cng c cho nn v mt trc. ng
thi , nhng cng c chn lc mu nn v mt trc, cng nh dy (dn) , (m) nghing,
v ng gch di chm, c th c s dng trn (v) nhng ct ring l nu bn la
chn nhng ct ny trc nhn trn (v) cng c.
Bng (th) ba cho php bn ty bin nhng mu trong nhng bng (tnh trng, ch
dn). Bng (th) t c th s dng t ng dc m tip tc xut hin Vi (Ca)
nhng mn nh (s to thnh vn , mn nh d liu trng rng), v bng (th) nm
cho php bn cho oa tr nhng mu ti bn chnh ca h (nh my) c t.
TRANG 31
PHN MM NH LNG POMQM
NHNG TY CHN KHUN DNG (NH DNG) KHC
(Other Format Options)

Kiu phng, kiu, v kch thc cho tt c cc bng c th l tp hp. Nhng zr
c th l tp hp trnh by nh nhng ch trng hn l nhng zr trong bng d
liu. H thng cc li in quc gia k trnh by c th l tp hp ti nm ngang, thng
ng, c hai, hoc khng. Tiu vn m xut hin trong bng d liu, v m c
to ra (ti) s to thnh che mn, c th c thay i.
a cho tng no (ca) rng ln nh dng nhng kh nng sn c, chng
ta trnh by mt mu (ca) mt mn nh nh hnh thi qu.
to ra mn nh ny chng ta s dng khun dng, nhng mu v thay i nn

v nhng mu mt trc (ca) nhng hng l a cho chng ta lun phin cho.
Chng ta cng i ti bng nhng bng v thay i nn bng tnh trng ti mt mu ti v
mt trc ti mt mu nh. Sau iu ny chng ta la chn c tn ct " Cippy " V s
dng Nn (m) chng ta, ri nhng cng c trn (v) thanh cng c oa tr nhng mu
cho ct ny ch la chn " Bruce " V " Lauren " V s dng Nghing v Dy (dn) (m)
nhng cng c trn (v) thanh cng c tng ng, v, cui cng, chng ta la chn "
Brian " V s dng Cng c mt trc.
Tr li cho Khun dng thc n, hy quan st rng bng c th c p hoc m
rng. Ci , Nhng chiu rng ct c th c gim bt hoc tng thm. Mi bo gii
(ca) cng c thay i nhng chiu rng ct bi 10 phn trm. y (th) rt hu ch nu
nhng (kt qu) t ln bn (th) rng hn mn nh. Thanh cng c c ty chn zoom
m c th cng c s dng thay i kch thc nhng chiu rng ct.
Ghi ch : tt c cc bng c th cho php ct ca h (m) nhng chiu rng thay
i bi vic kch vo hng phn ra nhng ct v ko tri hoc phi s chia ct ! Vic
nhn p trn (v) hng ny s khng t ng iu chnh chiu rng ct nh n bn
trong vt hn.
u vo c th c kim tra Hoc Khng. N l mt tng tt lun lun kim
tra u vo, nhng khng kim tra cho php bn t nhng mc vo trong nhng m
cch khc khng th c t .
S (ca) nhng phn thp phn, Du phy v C nh c c nh dng Trnh by
hoc in u ra. Ty chn Du phy s trnh by nhng s ln hn 999 vi mt Du phy.
S (ca) nhng phn thp phn th xung nht ring nhng iu khin (m) cc i Ghi
s (ca) nhng phn thp phn trnh by. Phi chng bn c n c t Ti " 00 " Ri.
333 c trnh by Nh. 33 trong khi 1.5 c trnh by nh 1.5. Nu bn bt ty chn C
nh ( thp phn) th tt c cc s c 2 phn thp phn. Nh vy 1.5 c trnh by nh 1.50
v iu chnh vi 1.33.
TRANG 32
PHN MM NH LNG POMQM
NHNG CNG C
(Tools)
Phn mm cn phi tm thy my tnh Windows nu bn la chn ty chn My tnh.
Nu Khng, (M) mt my tnh sn sng cho nhng s tnh ton n gin, bao gm
vung bn r. Nhng s c th c sao chp t my tnh v dn vo trong mt ring l
trong bng d liu. Mt My tnh Phn phi Bnh thng sn sng thc hin nhng s
tnh ton lin quan n Phn phi Bnh thng. y (th) hu ch c bit cho qun l d
bo v d n. Nhn thy mn nh Gip cho thng tin v vic lm sao s dng
My tnh Phn phi Bnh thng, hoc s dng mt hnh phc trn (v) My tnh c tng
bc mt nhng ch dn. Mt v d (ca) My tnh Bnh thng xut hin trong Chng 6
trong mc(khu vc) trn (v) qun l d n. Nhng cng tnh ton c th c lm
trong m un nhng thng tin c thng k nhng my tnh l mt trc gic hn nh b
s dng.
C mt vng sn sng Ch thch nhng vn . Nu bn mun vit mt ghi ch cho

chnh bn v vn , hy la chn ch gii. Ghi ch s c ct gi vi h s nu bn ct
gi h s. Mt v d (ca) ch gii xut hin trong Chng 1. loi tr ch gii hon
ton, ci hp phi (th) trng ( Gn xa) V sau h s phi l resaved. Khi bn in,
bn c mt ty chn in ghi ch Hoc Khng.
CC CA S
(Window)
Mt mu (ca) nhng ty chn Ca s xut hin trong s minh ha tip theo. Ty
chn thc n ny c cho php ch (ti) mn nh gii php. Ch rng trong v d
ny c su mn nh u ra khc nhau m c th c nhn. S (ca) nhng ca s ph
thuc vo m un v vn c bit.
bn di chng ta ang trnh by mn nh sau khi s dng ty chn Ngi t thc

n Ca s khi quyt nh mn nh l tp hp n 1280 bi 1024. Vi quyt nh ny n
c th (th) rt hu ch lp ngi nhn thy tt c gii php sn c nhng ca s.
Tht ra, s dng s Gip , Thng tin Ngi dng bn c th thit t tt c cc ca s
gii php m cho mi vn . R rng, gi tr (ca) ty chn ny ph thuc vo quyt
nh mn nh (ca) bn.
TRANG 33
PHN MM NH LNG POMQM
S GIP
(Help
Nhng ty chn Gip c trnh by tip theo. Ty chn (th) ba l ch v s

a cho cho mt s m t (ca) m un, d liu yu cu cho u vo, u ra nhng kt
qu, v nhng ty chn sn sng trong m un. l ng gi xem mn nh ny t
nht mt thi gian (th) nht nh m khng c nhng s khc nhau khng b nghi ng
gia assumptions (ca) bn v assumptions (ca) chng trnh. Nu c bt c ci g
c cnh bo v vic lu tm ti ty chn, th n s xut hin trn (v) mn nh gip
cng nh trong Chng 6 (ca) ti liu ny.
TRANG 34
PHN MM NH LNG POMQM
MO NH (CA) NGY
(Tip of the Day)

Mo nh (ca) ngy s c trnh by. T iu ny, n s c th t mo nh
trnh by tt c thi gian hoc khng phi ti mn hnh.
H TR E-MAIL
(E-mail support)
(Ci) ny s s dng e-mail (ca) bn thit lp mt thng bo s c gi cho
phng ln Prentice. Bc u tin s kch vo thn th chnh (ca) thng bo v sau
dn (CTRL V hoc chuyn - ng ang nm quyn) thng tin m chng trnh
c to ra vo trong thn th (ca) th t.
S CP NHT (NNG CP) CHNG TRNH
(Program Update)
Ty chn ny ch bn ti www.prenhall.com / weiss. Nhng s cp nht trn (v)
trang ti xung.
TI LIU
(Manual)
Chng trnh n vi ti liu ny trong c hai mu (dng) PDF v nh mt ti liu
T. Ti liu PDF yu cu ngi c ngh s nho ln gch phi nng m sn sng t do
xuyn qua http: // Www.adobe.com /.
HNG DN
(Tutorials)
Nhng chng trnh n vi tutorials m l phng tin truyn thng v m le
sng nhng mn hnh (nhng h s *.exe) m ch ra bn lm sao thc hin nht nh
nhng thao tc.
TRANG 35
PHN MM NH LNG POMQM
THNG TIN NGI DNG
(User Information)
Mu (dng) thng tin ngi dng c cho thy bn di. Bng u tin c th
s dng thay i tn (ca) hng, thy gio hoc trng hc. Tn sinh vin l tp
hp vo thi gian (ca) s sp t (ca) phn mm v khng th c thay i.
Bng (th) hai c t vi (ca) nhng ty chn m c bn lun v ti

im ny.
TRANG 36
PHN MM NH LNG POMQM
Bng (th) ba c t sch gio khoa. C vi s khc nhau gia nhng mn

hnh, nhng m hnh sn c v nhng tnh ton cho nhng sch gio khoa khc nhau.
V (KHONG) POM - QM CHO WINDOWS
(About POM-QM for Windows)

Ty chn gip cui cng l mt tiu chun v mn hnh. Ch s xy dng (xy
dng 20) sau khi s phin bn. Nu bn gi e-mail i hi s gip , hy xin (th) chc
chn bao gm s xy dng ny. Cng, ch s nh v (v tr) - www.prenhall.com /
weiss web-site. V tr ny cha ng cp nht !
TRANG 37
PHN MM NH LNG POMQM
CHNG 4 : S IN
(Appendices)
MN NH CI T IN
(The Print Setup Screen)

Sau vic la chn s In t thc n ( Hoc Thanh cng c), (M) Ci t In che
mn S c trnh by Nh c cho thy trong hnh bn di. C vi ty chn trn (v)
mn nh ny m c chia ct qua nm bng. Bng u tin c cho thy bn di.
Trc khi kho st nhng bng xin ch rng y (ca) mu (dng) cha ng ba
khung No, Nu kch, s thay i Khun dng gia mu en / Mu v trng, chn dung
v phong cnh, v ASCII v li gi tn s in.
THNG TIN IN
(Information to Print)
Nhng ty chn Trong khung ph thuc vo liu c phi s In c la chn t mn
nh d liu hoc t mn nh gii php. T mn nh d liu, ty chn duy nht m s
xut hin s in d liu. Tuy nhin, t mn nh gii php s l mt ty chn cho mi mn
nh (ca) nhng gi tr gii php.
Cho v d, trong v d lp trnh tuyn tnh(thng) trn c su mn hnh u ra khc
nhau cng nh mt sn c v ch gii th mt khi h s ny c mt ghi ch c gn.
Bn c th la chn nhng (iu) no S c in. Trong chung, d liu c in khi in
u ra v, bi vy, tht cn thit t khi in d liu, vic c ngha rng tt c s in c th
c thc hin sau khi vn c gii quyt.
TRANG 38
PHN MM NH LNG POMQM
DNG BNG THAY V (HAY) DNG PHNG TRNH
(Tables vs Equations)
Cho nhng kiu m un lp trnh ton hc, c mt ty chn sn sng v kiu (ca)
s in. Vn c th c in trong mu (dng) xp thnh bng bnh thng hoc trong
mu (dng) phng trnh. Chng ta cho thy mt v d (ca) mi (k) tip theo.
MU (DNG) XP THNH BNG
(Tabular Form)
Kt qu ---------x
Maximize (lm cc i)
labor hours (gi lao dng)
material vt cht (pounds - bng anh)
RHS
Dual
<=
14
0.5
<=
15
0.25
MU (DNG) PHNG TRNH
(Equation Form)
Kt qu ---------OPTIMIZE (ti u ha):
3x + 3y
labor hours (nhng gi n lc):
+ 3x + 4y
<= 14
material vt cht (pounds - bng anh):
+ 6x + 4y
<= 15
NHNG TH IN
(Printing Graphs)
Nu bn la chn in nhng th, phn mm s cho php bn la chn
nhng th no cn phi c in. Cho v d, nhng kt qu Qun l D n bao gm ba
biu Gantt v mt th mc u tin. Bn c th la chn nhng th no (m) Bn
thch t danh sch m c mt nh c cho thy bn di.
TRANG 39
PHN MM NH LNG POMQM
Nu tt c bn mun l mt trong nhng th, th tht c th lm cho s in

th (ca) bn t mn nh th (c m t trong chng tip theo) hn l t nhng kt
qu mn nh. Hn na, nu (m) bn mun iu khin kch thc (ca) In th, s
dng nhng ty chn trong chng tip theo.
THNG TIN U MC TRANG
(Page Header Information)

Bng cho thng tin u mc trang c trnh by bn di. C su mnh (ca) thng
tin m c th (th) c chn xut hin trn (v) u mc. Ba ty chn u tin s xut
hin trn (v) hng u mc u tin, v giy Ba s xut hin trn (v) hng u mc
(th) hai. Nu phn mm l c ng k nh hin thn trn (v) mt mng hoc phng th
nghim th tn sinh vin s bao gm tn (ca) phng th nghim i theo bi tn (ca) sinh
vin m c vo khi chng trnh c khi ng. lm lu di thay i cho tn hng
hoc tn thy gio, hy s dng s Gip .
THNG TIN NGI DNG
(User Information)
CCH TRNH BY TRANG
(Page Layout)
Bng cho cch trnh by trang c cho thy bn di.
TRANG 40
PHN MM NH LNG POMQM
IN NH L ...
(Print as)
C hai kiu (ca) s in m c th c s dng. (Ci) chung nht v cch nhanh
nht in nh ASCII (vn bn r rng). Ngoi ra, bn c th cng in n nh mt li
tng t nh ci m xut hin trn (v) mn nh. Nh vy, bn c th nh dng h
thng cc li in quc gia v sau i ti ty chn in v in mt li nh hnh cao.
Nhng li nh hnh cm (ly) di (lu) hn cho s in hn s in vn bn r rng.
S NH HNG GIY
(Paper Orientation)
Giy c th c in trong kiu cch bnh thng (chn dung) hoc n c th c
in v bn cnh (phong cnh).
NHNG CU TR LI
(Answers)
Nhng cu tr li c th l dy (dn), nghing, mu, hoc bt k s kt hp no
(ca) Ba. Hy khng tm kim mu nu bn khng c mt my in mu. Trong s vic,
nu bn t s in s dng mu trn (v) mt mu en / Nhng my in trng, cu tr
li mu ni chung c v l bt la! y thng thng (th) khng phi l c trng mong
mun.
CCH (KHONG TRNG)
(Spacing)
S in c th l n - c cch nhau (c gi cao) hoc gp hai - cch
nhau.
NHNG L
(Margins)
Tri, phi (ng), nh, v nhng l y c th l tp hp t zr n 1 inch trong
nhng s tng dn (ca) 1 inch. L trn hoc bn ngoi bt k l t nhin no m
chnh my in c. Nhng l (ca) zr k c a s cc s in ngang qua trang.
RNG CC I CA CT
(Maximum Column Widths)

Nhng chiu rng cc i (ca) nhng ct ( trong nhng c tnh) c th l tp hp.
Ct cc t m thng thng l nhng tn, c th l tp hp ring r t nhng ct khc.
y (th) hu ch nu bn mun nn (p) nhng bng.
NHNG TY CHN MY IN
(Printer Options)
Bng cho nhng ty chn my in xut hin bn di.
TRANG 41
PHN MM NH LNG POMQM
NU H S TN TI V IN TI ...
(Print to and If the File Already Exists)

Tht c th in ti my in hoc in ti mt h s. Nu bn in ti mt h s bn s
c hi cho mt tn h s. Bt k tn no c th (th) cho. Bn cng c ty chn
(ca) vic thm s in vo mt h s ci () c (ni) hoc vic xa b h s trc
s in (thay th h s).
S TNH TON THI GIAN IN
(Print Timing)
S In c th xut hin mi thi gian bn s dng s In hoc n c th i cho n
khi kt thc, khi mi th s c In (ti) mt ln. Mi ln In (th) c a chung ni
chung, nhng c vi tnh trng ni bn mun i cho n khi kt thc bi v thng nm
ny ct gi giy hoc ti gin s (ca) nhng cuc do chi ti mt my in mng.
THAY I MY IN MC NH
(Change Default Printer)

Nu bn c hn mt my in, th bn c th thay i my in s dng ty chn ny.
(Ci) ny thay i Windows mc nh my in v thng nm nh hng nhng chng
trnh khc! Nu bn in nh mt li, my in la chn lun lun l mc nh Windows bt
chp my in (ca) ci g bn la chn trong ca s ny.
CHNG 5 : NHNG TH
( Chapter 5 : Graphs )
LI GII THIU
(Introduction)
Nhiu m un c kh nng trnh by nhng th hoc nhng biu nh mt
trong nhng ty chn u ra. Vi m un c hn mt th lin quan n chng. Cho v
d, nh c a vo hnh bn di, bn th qun l d n khc nhau (th) sn c. th
s c trnh by (th) c chn s dng bng. C vi ty chn m bn c khi mt th
xut hin, v chng ta gii thch nhng ty chn trong chng ny.
TRANG 42
PHN MM NH LNG POMQM
Khi mt th c m, hai cc th s xut hin. Trc ht l th s c trnh by

bao trm ton b vng di d liu thm; giy l mt t thc n m nhng ty chn s
thay i hoc execute khc nhau.
H S CT GI
(File Saving)
H s ct gi ty chn va di H s trn (v) thc n chnh va trn (v) thanh
cng c s ct gi th ( tch cc) hn l ct gi H s. H s c th vn cn c ct
gi bi vic s dng H s, Ct gi Nh Hoc bi vic i ti mt ca s kt qu (K)
khc hn ca s th.
S IN
(Print)
S In by gi s In th hn l gii thiu mn nh ci t In chung. Nhng ty
chn th in c cho thy bn di. th c th c in trong hai kch thc, v c th
c in nh mi chn dung ( 8.5 bi 11) hoc phong cnh ( 11 bi 8.5). Nhng th Nh
c th c in (ti) nh hoc t (ca) trang. Nh vy, c nhiu s thc hin theo yu
cu khch hng hn mnh khnh (ca) s in th sn sng xuyn qua phng php ny
Hn Khi no vic in nhng th nh b phn ca u ra, nh c m t trong chng trc
y.
TRANG 43
PHN MM NH LNG POMQM
NHNG MU & PHNG
(Colors & Font)

Nhng mu mt trc v thng nm nhng mu nn c thay i bi vic s
dng nhng cng c trn (v) thanh cng c khun dng. Vic thay i tn phng trn
(v) thanh cng c s thay i phng cho nhng tiu v nhng nhn trong nhng
th. Vic kch vo dy (dn) trn (v) thanh cng c s thay i phng trong nhng th
ti dy (dn).
CHNG 6 : NHNG M UN
(Chapter 6 : Modules)
Version 3.0 Build 23 ngy 07/09/2008 bao gm 29 module m , v c 60
module con.
Version 3.41 Build 108 ngy 20/09/2010 c b sung thm mt vi tnh nng, v
c thm m un con, bao gm 30 module m , v c 76 module con.
TNG QUAN
(Overview)
Trong chng ny, chng ti chi tit 29 m-un. Chng ti gii thch cc u vo
cn thit cho mi m-un, cc ty chn c sn cho m hnh ha v gii quyt, v mn
hnh u ra v cc bo co khc nhau c th c nhn thy v in. Nh rng trnh n
c th c thit lp ch hin th m-un POM, ch hin th cc m-un qun l cht
lng QM hoc tt c cc m-un (All Modules). i vi cc m-un m trong c 2
thanh menu POM v QM, chng ti u hin th POM-QM l biu tng Windows nh
sau :
TRANG 44
PHN MM NH LNG POMQM
Trong ti liu ny. i vi tt c cc m un m ch trong thc n menu POM,

chng ti hin th POM l biu tng Windows nh sau :
Trong khi i vi tt c cc m un m ch trong thc n menu QM, chng ti hin

th QM l biu tng Windows nh sau :
V d, trong module u tin, quy hoch tng hp, xut hin trn trang tip theo,
chng ti nhn thy biu tng POM k t khi k hoch tng hp (Aggregate Planning)
xut hin ch trong menu POM nhng khng phi ch trong trnh n QM-Qun l cht
lng. Cui cng, cc v d c s dng trong hng dn s dng ny c ci t
trong th mc v d, l th mc POM-QM for Windows (ProgramFiles\POMQMv3).
LP K HOCH (SN XUT) TNG HP

Aggregate (Production) Planning
K hoch sn xut l phng tin m chng ti chun b s lng sn xut ca
chng ti cho trung hn (thng l 1 nm). Tng hp quy hoch cp n mt thc t
rng cc k hoch sn xut thng c thc hin qua dng sn phm. Chng ti s s
dng tng hp v quy hoch v k hoch sn xut thay th cho nhau. Kh khn chnh
ca quy hoch l cc nhu cu khc nhau t thng n thng. Chng ti mun gi cho
sn xut, n nh nht c th duy tr tn kho ti thiu v kinh nghim ti thiu ca tnh
trng thiu. Chng ta phi cn bng chi ph ca sn xut, lm thm gi, hng tn kho,
hp ng ph, tnh trng thiu ht, v nhng thay i mc sn xut.
Trong mt s trng hp, vn quy hoch tng hp c th yu cu s dng m
hnh (m-un) giao thng vn ti hoc cc lp trnh tuyn tnh (The Transportation or
Linear Programming Modules). Cc m hnh con th hai trong cc m-un lp k
hoch tng hp to ra v gii quyt mt m hnh vn ti ca quy hoch tng hp
(Transportation Model of Aggregate Planning) cho cc trng hp m tt c cc chi
ph ca cc thi k l ging ht nhau. M hnh giao thng vn ti (The Transportation
Model) cng c sn nh l mt trong nhng phng php cho m hnh con u tin.
1.1. M HNH LP K HOCH TNG TH
(The Aggregate Planning Model)
Vn quy hoch sn xut c c trng bi mt lch trnh yu cu, thit lp nng
lc, chi ph ca cc thi k khc nhau v mt phng php x l tnh trng thiu. Hy
xem xt v d sau y.
TRANG 45
PHN MM NH LNG POMQM
V D 1 : SN XUT N NH
(Example 1 - Smooth Production)

Xem xt mt tnh hung m nhu cu trong 4 thi k tip theo l 1200, 1500, 1900, v
1400 n v. Kim k hin ti (tn kho ban u) l 0 n v. Gi s rng kh nng thi
gian bnh thng (thi gian thng xuyn) l 2000 n v / thng (nng lc thng
xuyn trong nm kh nng cng sut t c), v rng lm ngoi gi v k hp ng
ph th khng phi l mt s cn xem xt. Chi ph l 8$ cho mi n v sn xut trong
thi gian bnh thng, 3$ cho mi n v thi k tn tr, 4$ cho mi thi k m chng ta
thiu ht mt n v, 5$ cho mi n v m chng ta gia tng sn xut t giai on trc
(thu thm th), v 6$ cho mi n v m chng ta gim bt sn xut t thi k trc
(gin th). Mn nh cho v d ny c trnh by bn di.
Trn cc d liu, chng ti c 2 cn nhc : x l thiu hng v phng php
s dng cho vic thc hin quy hoch.
X l thiu hng (Shortage) : trong k hoch sn xut c hai m hnh x l tnh
trng thiu. Trong mt m hnh, tnh trng thiu c t hng tr li (Back-ordered)
(hoc s c php giao hng tr hn). l, nhu cu c th tch ly v c p ng
trong thi gian sau . Trong m hnh khc, tnh trng thiu tr thnh doanh s bn
hng b mt (Lost sales) (tc s b tng chi ph tn tr). l, nu bn khng th p
ng nhu cu trong khong thi gian m n c yu cu, nhu cu bin mt. Ty chn
ny trn bng d liu.
NHNG PHNG PHP
(Methods)
Nu l phn mm phin bn mi 2010 (Version 3.41) th c 6 phng php sn c
(bao gm c phng php vn ti Transportation), m chng ti s chng minh. Xin
lu rng cc ti khon sn xut n nh c 2 phng php :
Sn xut n nh (Smooth production) l s sn xut u trong mi thi k. iu
ny c th c thit lp theo nhu cu hoc tng nhu cu rng (The Gross Demand
or The Net Demand).
Tng nhu cu tr i hng tn kho ban u
= Gross Demand Initial Inventory
TRANG 46
PHN MM NH LNG POMQM
Dng Gross th s tnh ton s khng bao gm tn kho ban u.

Dng Net th s tnh ton s bao gm c tn kho ban u.
Sn xut theo nhu cu (Chase CURRENT demand let workforce vary) : s to
ra mt lch trnh sn xut m ging ht tin nhu cu.
Thi gian sn xut lin tc thng xuyn Constant Reg time, then OT and Sub
(Constant Regular time production, then Overtime and Subcontracting) : u tin thi
gian sn xut thng xuyn lin tc, ri n lm thm gi v hp ng ph nu cn
thit. Phng php c chi ph thp hn s c la chn u tin (c u tin tnh
trc).
Vi lch trnh sn xut : trong trng hp m ngi dng phi nhp s tin vo,
c sn xut trong mi thi k (phng php ngi dng t xc nh User Defined).
M hnh vn ti (phng php The Transportation Model), s dng khi chi ph
ca cc thi k ging nhau.
S LNG
(Quantities)
Nhu cu (Demand) : nhu cu l ng lc ca quy hoch tng hp v chng c
cho trong mt ct.
Cc nng lc (Capacities - Capacity) : thi gian thng xuyn (Regular Time),
lm thm gi (Overtime), v hp ng ph thu ngoi (Subcontracting) : chng
trnh cho php 3 loi hnh sn xut - thi gian thng xuyn, lm thm gi, v hp ng
ph, v cc nng lc ny c cho trong 3 ct tip theo. Nu phng php c la
chn l phng php ngi dng xc nh (User-Defined), th chng khng c xem
nh l nng lc m ng hn phi l s lng sn xut. Khi quyt nh liu c s dng
lm thm gi hoc hp ng ph thu ngoi (Overtime or Subcontracting), th chng
trnh s lun lun u tin chn mt ci m t tn km trc tin.
CHI PH
(Costs)
Cc chi ph cho vn c t tt c trong ct bn phi ca mn hnh d liu.
Chi ph sn xut (Production Costs) : thi gian thng xuyn, lm thm gi, v
hp ng ph. y l cc chi ph cho mi n v sn phm sn xut, ty thuc vo cc
n v c lm khi no v lm th no.
Chi ph hng tn kho (Inventory (Holding) Cost) : y l s tin chi tr cho tn tr
1 n v cho 1 giai on. Tng chi ph tn tr phi chi tr i vi hng tn kho cui k.
Hy cn thn, bi v trong khi hu ht cc sch gio khoa tnh ph i vi hng tn kho
cui k, mt s sch gio khoa tnh ph i vi hng tn kho trung bnh trong giai on.
Chi ph thiu ht (Shortage Cost) : y l s tin chi tr cho mi n v m b thiu
trong mt giai on nht nh. Cho d gi nh rng tnh trng thiu c ng nhp tr
li (Back-Logged) (Back-ordered) v s hi lng sm nh l tn tr tr nn c sn
trong mt thng ti hoc b mt doanh s bn hng (Lost sales), c ch nh bi cc
hp ty chn pha trn bng d liu. Chi ph thiu ht phi tr i vi mc cui cng ca
thng.
TRANG 47
PHN MM NH LNG POMQM
Chi ph gia tng sn xut Cost to increase production (Increase Cost) Chi ph
thu thm th : y l chi ph do c nhng thay i trong lch trnh sn xut. N c
cho trn c s mi n v. Chi ph sn xut ngy cng tng i hi chi ph thu mn.
N phi c chi tr i vi nhng thay i trong s tin ca thi gian sn xut thng
xuyn (Regular Time), nhng khng b tnh ph i vi bt k thay i khi lng sn
xut ca lm thm gi (Overtime) hoc hp ng ph (Subcontracting). Nu mc sn
xut ban u l 0, th chng s khng c ph cho gia tng sn xut trong giai on u
tin.
Chi ph gim sn xut (Decrease Cost) : iu ny l tng t nh chi ph sn
xut ngy cng tng v cng c cho trn c s mi n v. Tuy nhin, y l chi ph
cho vic gim sn xut. N ch phi chi tr i vi s thay i sn lng ca thi gian
thng xuyn (Regular Time).
CC CN NHC
(Other Considerations)
Hng tn kho ban u (Initial Inventory) : thng thng chng ti c mt hng tn
kho ban u t cui thng trc. Tn kho ban u (Starting Inventory) c t trong
ct bn phi hng v pha di.
Cc n v giai on cui cng (Units Last Period) : khi mt s chi ph thay
i trong s lng sn xut t giai on ti giai on, n l cn thit bao
gm sn xut trong giai on trc khi bt u vn (tc n s c bao
gm trong giai on u tin, th hin kh nng cng sut hin ti, nng lc
ti lc bt u giai on 1 giai on sn xut u tin), khi s dng phng
php sn xut theo nhu cu, hoc phng php hn hp, bn s thy r iu
ny. Cc n v ny xut hin trong ct bn phi pha di.
GII PHP
(The Solution)
GROSS V BACK-ORDERS
Trong v d u tin, c hin th di y, chng ti la chn phng php

sn xut n nh (Gross) vi ty chn cho php t hng tr li (back-orders). Nhu cu
(Demand) l 1200, 1500, 1900, v 1400, v nng lc thi gian thng xuyn (Regular
Time Capacity) ca nm l 2000 vt qu nhu cu. Khng c hng tn kho ban u.
Cc con s i din cho s lng sn xut. Cc chi ph c th c nhn thy pha di
cng ca ct. Mn hnh cha c hai thng tin, c s giai on theo thi gian v c s
tm tt. Ch mu sc m ha d liu (mu en), tnh ton trung gian (mu ti) v
kt qu (mu xanh).
TRANG 48
PHN MM NH LNG POMQM
Thi gian sn xut thng xuyn : s tin c sn xut trong thi gian thng
xuyn c lit k trong ct (Regular Time Production). S tin ny c xc nh bi
chng trnh cho tt c cc ty chn ngoi tr User Defined. Trong v d ny, bi v nhu
cu hoc tng nhu cu rng (The Gross or Net Demand) l 6000, nn c 1.500 n v
sn xut trong thi gian thng xuyn mi 4 giai on ( 6.000 / 4 = 1.500 ; mc sn
xut trung bnh). Nu tng nhu cu khng phi l mt hay ngay c nhiu giai on, th
cc n v thm vo s c sn xut trong giai on th bao nhiu l theo th t cn
thit p ng nhu cu. V d, tng nhu cu l 6002, lch trnh sn xut s c c
1501 trong giai on u tin v giai on th 2, v 1500 trong 2 giai on khc (v y
l chi ph n v , nu ly 6002 / 4 = 1500,5 s b l).
Tn kho cui k (Ending Inventory) c i din bi mt trong hai ct : hoc l
"Tn Kho" (Inventory end PD) hoc l Thiu hng (Shortage end PD).
Hng tn kho Tn Tr (Inventory Holding end PD) : tch ly hng tn kho
xut hin trong ct ny nu n l tch cc. Trong v d, c mt hng tn kho tch cc l
300 n v trong giai on 1 v 2. Khng c hng tn kho (thc t l mt s thiu ht)
trong giai on 3. V khng c tn kho, cng khng c thiu ht vo cui k 4.
Tnh trng thiu ht (Shortage end PD) : nu c thiu, s tin ca s thiu ht ny
xut hin trong ct ny. Trong v d, 100 trong ct thiu ca giai on 3 c ngha l 100
n v nhu cu khng c p ng. Bi v chng ta la chn ty chn cng vic tn
ng (backlog), tc cho php thiu hng hay cho php t hng tr li (Back-ordered),
nhu cu c p ng cng sm cng tt, m l trong giai on cui (ta b li 100
trong giai on 4).
Khng tng hoc gim (Increase or Decrease) t thng ny sang thng xy ra, do
, cc ct ny khng xut hin trong mn hnh ny.
Tng n v (Total units) : tng s cc n v nhu cu, sn xut, hng tn kho,
thiu hng, hoc tng v gim trong sn xut c tnh ton. Trong v d, 6.000 n v
c yu cu v n v 6000 c sn xut v c tng cng tn kho 600 n v /
thng, thiu 100 n v / thng, v 0 tng hoc gim sn xut n v / thng.
Tng chi ph tng thnh phn (Subtotal Costs) : cc tng s ca cc ct c
nhn vi chi ph ph hp, nng sut tng chi ph cho mi thnh phn chi ph. V d, 600
n v trong hng tn kho c nhn $3 cho mi n v, nng sut mt chi ph hng
tn kho tng cng l $1800, nh c hin th.
Tng chi ph (Total Cost) : tng chi ph tng th c tnh ton v hin th. i vi
chin lc ny, tng chi ph l $50.200.
TH
Graph
Hai th c sn trong m-un ny :
TRANG 49
PHN MM NH LNG POMQM
N c th hin th mt thanh th ca sn xut trong tng thi k (khng c hin

th) v n cng c th hin th mt th ca sn xut tch ly so vi nhu cu tch ly (
trn).
V D 2 : TN KHO BAN U V SN XUT TRC
NET V BACK-ORDERS
(Example 2 : Starting inventory and previous production)

Chng ti thc hin hai thay i v d trc. Nhng sa i ny c th c nhn
thy trong mn hnh sau y. Trong v tr "Hng tn kho ban u", chng ti t 100.
Ngoi ra, chng ti thay i phng php s dng nhu cu thc.
Kim tra ct "thi gian sn xut thng xuyn" trong u ra cho thy rng tng sn
lng l 5900 thay v 6000 t v d trc y do hng tn kho ban u. V vy,
chng ta ch cn sn xut 1.475 mi thng.
V D 3 :
S DNG LM THM GI V HP NG PH
(Example 3 : Using overtime and subcontracting)

Trong v d tip theo c hin th trong mn hnh sau y, chng ta ly v d ban
u (khng cn hng tn kho ban u) v gim cng sut n 1000 cho thi gian thng
xuyn (Regular Time). Chng ta bao gm nng lc (Capacity) l 100 cho lm thm
gi (Overtime) v 900 cho hp ng ngoi (Subcontracting), v chng ti bao gm
chi ph cho cc n v (Unit Costs) lm thm gi v hp ng ph l $9 v $11 tng
ng. iu ny c th c nhn thy nh sau.
TRANG 50
PHN MM NH LNG POMQM
Bi v khng c nng lc thi gian thng xuyn, chng trnh trng ti lm

thm gi v hp ng ph. Mt la chn u tin m t tn km. V vy, trong v d ny,
chng trnh lm 1000 n v u tin cho thi gian thng xuyn, sau 100 n v
lm thm gi ($9/unit), sau 400 n v (ca 900 c sn) cho hp ng ph $11/unit.
V D 4 : KHI HP NG PH L T TN KM HN SO VI LM THM GI
(Example 4: When subcontracting is less expensive than overtime)

Trong mn hnh sau y, chng ti cho thy mt trng hp hp ng ph l t tn
km hn so vi lm thm gi. l, s thay i duy nht chng ti thc hin t mn
hnh trc lm thm gi chi ph $13 thay v $9. Thi gian ny, chng trnh la
chn hp ng ph trc tin, v k t khi c nng lc, th lm thm gi khng
c s dng tt c.
V D 5 : TRNG HP 1 - MT DOANH S HNG BN (B TNG CHI PH TN TR)
(Example 5 : Lost sales - Case 1)

Chng ti a ra nhng v d trc v chng ti thay i t cho php thiu
hng (Back-orders) ti mt doanh s bn hng (Lost sales), c th c nhn thy
di y.
TRANG 51
PHN MM NH LNG POMQM
u ra cho thy mt s thiu ht l 100 n v vo cui giai on 3. Trong giai on

tip theo, chng ta sn xut 1.500 n v mc d chng ta ch cn c 1.400 n v.
Thm 100 n v ny khng c s dng p ng thiu ht giai on 3, k t khi
chng tr thnh doanh s bn hng b mt. 100 n v i vo hng tn kho, c th
c nhn thy t ct hng tn kho trong thi gian 4. N khng c ngha s dng
trong phng php sn xut n nh (Smooth Production Model) vi ty chn b mt
doanh s bn hng (Lost sales). Cui cng, tng nhu cu l khng thc s l 6000, k
t khi 100 doanh s bn hng b mt (trong khi chi ph sn xut vn tnh).
V D 6 : CHIN LC SN XUT THEO NHU CU (KHNG C HNG TN KHO)
Example 6 : The produce to demand (no inventory) strategy

Chng ti ly v d u tin ca chng ti v chuyn i (toggled) cc
phng php hin th sn xut theo nhu cu hoc chin lc rt ui (chase
strategy) sau y.
TRANG 52
PHN MM NH LNG POMQM
Ch rng chng trnh t thit lp ct "thi gian sn xut thng xuyn " bng
ct nhu cu. Hng tn kho khng c hin th bi v n lun lun l 0 trong ty chn
ny. Vi sn xut bng nhu cu v hng tn kho khng c bt u, s c khng thay i
trong hng tn kho, cng nh bt k s thiu ht no. T l sn xut s tng v / hoc
gim. Trong v d ny, sn xut trong giai on 1 l 1200 v sn xut trong giai on 2 l
1500. Do , ct tng c 300 trong giai on 2. Chng trnh s khng lit k bt k gia
tng trong giai on 1 nu khng c sn xut ban u c a ra. Tng s gia tng l
700, gim l 500.
Tng (Increase) : s thay i trong sn xut t thi k trc ti thi k ny xy ra
trong ct ny, nu thay i i din cho s gia tng. Ch rng chng trnh gi s
rng thay i khng din ra trong giai on u tin trong v d ny. Trong v d ny,
khng c thay i trong cc giai on khc bi v sn xut l khng i theo la chn sn
xut n nh.
Gim (Decrease) : nu sn xut gim, mc gim ny xut hin trong ct ny.
V D 7 : TNH CHI PH TNG V GIM
(Example 7 : Increase and decrease charging)

V d trc y c tng v gim trong sn xut. S gia tng v gim ny c tnh
cho thi gian sn xut thng xuyn. Trong mn hnh sau y, chng ti gim cng
sut thi gian thng xuyn buc sn xut thng qua thi gian thng xuyn v lm
thm gi.
Ch rng ct tng ch c mt gi tr ca n trong giai on th hai, khi thi gian

sn xut thng xuyn i t 1200 n 1500 n v. Thi gian sn xut thng xuyn vn
cn l 1500, mc d tng lm thm gi, iu ny khng hin th trong ct tng. Chng ti
khng tnh ph i vi tng nh vy.
TRANG 53
PHN MM NH LNG POMQM
1.2. M HNH VN TI TRONG HOCH NH TNG HP

(The Transportation Model of Aggregate Planning)
M hnh vn ti trong quy hoch tng hp c cha d liu m gn ging vi cc m
hnh va mi kim tra. S khc bit duy nht l m hnh vn chuyn khng xem xt s
thay i trong mc sn xut do khng c d liu nhp vo c cho php trong chi
ph tng v gim hoc cho cc n v giai on cui cng (units last period). Mn hnh
sng to s yu cu s lng cc giai on v liu tnh trng thiu hng c c cho
php hay khng. Tng t vi cc mn hnh trc c th c nhn thy di y.
Ch rng ch c mt mc nhp cho mi chi ph. Nh vy, m hnh ny khng th c
s dng cho cc tnh hung ni m cc chi ph thay i t giai on ti giai on. Bn
phi xy dng nhng vn ny ca chnh bn bng cch s dng m hnh vn chuyn
t menu Module Transportation ch khng phi l m hnh con : m hnh vn ti ca
quy hoch tng hp.
Ch : m hnh giao thng vn ti m l m hnh con th hai trong trnh n mi,
cng c th c truy cp nh l phng php cui cng trong m hnh con u tin.
Mn hnh gii php c hin th di y. Ca s bn tri c cha s lng sn

xut c th hin di hnh thc giao thng vn ti. Ca s bn phi tm tt s lng
sn xut, chi ph n v / thng ca tn tr (v thiu ht nu c) v cc chi ph.
TRANG 54
PHN MM NH LNG POMQM
N thm ch cn r rng hn rng y l mt vn vn ti, nu chng ta kim tra

ca s th hai ca u ra m l m hnh vn ti ring ca n.
Con s ln (9999) c nhp vo theo th t ngn cn chng trnh t pha

t hng (back-ordering). Nu bn thch, bng ny c th c sao chp, sau bn
c th m m hnh vn ti, to ra mt bng mi, bng trng l 13 by 4 v dn d liu ny
vo bng .
CN BNG DY CHUYN LP RP
(Assembly Line Balancing)
M hnh ny c s dng cn bng khi lng cng vic trn mt dy chuyn
lp rp. Nm quy tc khm ph c th c s dng thc hin s cn bng. Thi
gian chu k c th c a ra mt cch r rng hoc t l sn xut c th c cung
cp v chng trnh s tnh ton thi gian chu k. M hnh ny s khng phn chia
nhim v. Tch nhim v c tho lun chi tit hn trong phn sau.
M HNH
(The Model)
Khun kh chung cn bng dy chuyn lp rp c quyt nh bi s lng cc
nhim v phi c cn bng. Nhng nhim v ny c t hng mt phn, nh c
hin th, v d nh trong s u tin sau y.
TRANG 55
PHN MM NH LNG POMQM
Phng php. 5 quy tc khm ph c th c la chn l :

1. Thi gian thao tc di nht
2. Nhim v lm sau nht
(nhim v chia ra tng phn)
3. Xp hng trng lng v tr
4. Thi gian thao tc ngn nht
5. S b nht ca nhim v theo sau
1. Longest operation time

2. Most following tasks
3. Ranked positional weight
4. Shortest operation time
5. Least number of following tasks
Mt s kt qu :
Minimum theoretical number of stations = total production
time per unit / cycle time rounded up!
L thuyt ti thiu s lng cc trm = tng thi gian sn
xut cho mi n v / chu k thi gian (lm trn ln!)
Time allocated = number of stations * cycle time
Thi gian giao (cp pht) = s trm (s ni lm vic) * thi gian chu k
Time needed = sum of the task times
Thi gian cn c = tng thi gian nhim v
Idle time = time allocated - time needed
Thi gian nhn ri = thi gian giao - thi gian cn c
Efficiency = time needed / time allocated
Thi gian hiu qu = thi gian cn c / thi gian giao
Balance delay = 1 - Efficiency
Cn bng chm tr (s tr hon vic cn bng) =
1 - hiu qu
Ch : nhng s bt buc (Ties) b ph v trong mt hnh trang ty nu 2 nhim

v c u tin ging nhau da trn cc quy tc nht nh. Lu rng s bt buc b ph
v c th nh hng n kt qu cui cng.
TRANG 56
PHN MM NH LNG POMQM
CC THNG S CN LI L
(The remaining parameters are)

Thi gian chu k ( Cycle Time CTd ) :
thi gian chu k c th c a ra
mt trong hai cch. Mt cch l khi thi gian chu k c cho trc tip nh c hin th
trn. Trong khi iu ny l phng php n gin nht, n l ph bin hn xc nh
thi gian chu k t t l nhu cu (Demand Rate). Thi gian chu k c chuyn i
thnh cc n v tng t nh thi gian cho nhim v. (Xem v d 2).
n v thi gian cho cc nhim v (Task time unit) : n v thi gian cho cc
nhim v c cho bi hp th xung. Bn phi chn giy, gi, hoc pht. Ch rng
cc tiu ct cho cc ln nhim v s thay i khi bn la chn n v thi gian khc
nhau.
Tn nhim v (Task names) : tn nhim v l rt cn thit cn bng dy chuyn
lp rp khi ngi ta xc nh mc u tin (Precedences). Trng hp khng quan
trng.
Thi gian nhim v (Task times) : thi gian nhim v l c cho.
Mc u tin (Precedences) : nhp mc u tin vo, mt trong mi t bo. Nu c
2 mc u tin ngi ta phi nhp vo trong 2 t bo. Khng nhp a, b, ...". Trong thc
t, du phy s khng c chp nhn. Ch rng trong danh sch u tin trong mn
hnh trn, chng ti c hai kiu : a v A. Nh cp trc y, trng hp ca
cc ch ci khng thch hp.
V D 1
(Example 1)
Trong v d ny, chng ti c 6 nhim v t tn t a ti f. S u tin cho vn
ny xut hin trn. Thi gian thc hin mi nhim v l trn nhim v (ct gi,
pht, giy Task time unit ). Ngoi ra, lu rng nhim v sn sng bt u ca
s cn bng l nhim v a v b. Cui cng, trong v d u tin ny, chng ti s dng
mt thi gian chu k (CTd) l 10.
GII PHP
(Solution)
Mn hnh sau y c cha cc gii php v d u tin ca chng ti. Mn hnh gii
php bao gm hai ca s nh hnh di y. Ca s bn tri cung cp cho cc kt qu
y ca phng php c la chn trong khi ca s bn phi cung cp s lng
trm (s ni lm vic) cn thit (khng phi l con s trn l thuyt) khi s dng mi
phng php (quy tc) cn bng. Cc mn hnh gii php s lun lun cng xut hin v
cha cc thng tin nh nhau bt k quy tc no c la chn cho s cn bng. Ngoi
ra, nh c hin th trong ca s tm tt bn phi, trong trng hp ny mi phng
php (quy tc) dn ti 3 trm (3 ni lm vic). iu ny khng lun nh vy s c th
hin sau trong phn ny.
S Trm s ni lm vic (Station numbers) : s trm xut hin ct tri.
Chng ch c hin th cho cc nhim v u tin c np vo mi trm (ni lm vic
th nht (trm 1) c 3 nhim v: b, e, a ; trm 2 c 2 nhim v: d, c ; trm 3 c 1 nhim
v l f ). Trong v d ny, 3 trm c yu cu.
TRANG 57
PHN MM NH LNG POMQM
Tn nhim v (Task names) : cc nhim v c np vo trm c lit k trong

ct nhim v Task. Trong v d ny, nhim v b, e, v a trong trm 1, nhim v d v
c trong trm 2, v nhim v f trong trm 3.
Thi gian nhim v (Times) : chiu di ca thi gian cho mi cng vic xut hin
trong ct ny (nu bng nhp liu, th s thi gian ny c nhp vo ct giy, pht,
gi).
Thi gian cn li (Time left) : chiu di ca thi gian cn li ti cc trm c lit
k trong ct ny. S cui cng ti mi trm, tt nhin, l s thi gian nhn ri ca trm
. Thi gian nhn ri c t mu . V d, c 1 giy thi gian nhn ri ti trm 1, c
1 giy thi gian nhn ri ti trm 2, v c 2 giy thi gian nhn ri ti trm 3, tng cng
4 giy thi gian nhn ri cho mi chu k.
Nhim v sn sng (Ready tasks) : cc nhim v m l sn sng xut hin y.
Mt nhim v sn sng l bt k nhim v c mc u tin gp. Chng ti nhn mnh
iu ny bi v mt s cun sch khng lit k mt nhim v nh sn sng cho thi
gian vt qu thi gian cn li ti trm (tc khi thi gian cn li ca trm khng
thc hin nhim v c u tin tip theo, th nhim v vn c lit k vo nhim
v sn sng, trong khi mt s sch khng lit k). Ngoi ra, nu s lng k t trong
danh sch cng vic sn sng l rt di, bn c th mun m rng ct.
Thi gian chu k (Cycle time) : thi gian chu k c s dng xut hin di s
cn bng. Thi gian chu k c cho trc tip hoc c tnh ton. Trong v d ny,
thi gian chu k (CTd) c cho trc tip l 10 giy.
TRANG 58
PHN MM NH LNG POMQM
Thi gian phn b c cho c cp pht (Time allocated) : tng thi gian
phn b cho mi n v c hin th. Thi gian ny l sn phm ca s lng cc trm
v thi gian chu k ti mi trm. Trong v d ny, chng ti c 3 trm, vi thi gian chu k
mi trm l 10 giy, tng thi gian lm vic l 30 giy cho tt c cc trm.
Thi gian cn thit lm mt n v (The time needed to make one unit) : iu
ny ch n gin l tng ca thi gian nhim v. Trong v d chng ta c 1 + 5 + 2 + 7 +
3 + 8 = 26 giy.
Thi gian nhn ri (Idle time) : y l thi gian cn thit tr t thi im c
phn b. V d ny c 30 - 26 = 4, ph hp vi 4 giy trong 3 nhim v vi thi gian
nhn ri hin th mu (1 + 1 + 2 = 4).
Hiu qu dy chuyn (Efficiency) : hiu qu c nh ngha l thi gian cn thit
chia thi gian c phn b. Trong v d ny, hiu qu c tnh l 26 / 30 = 0,866667
= 86,6667%.
Cn bng chm tr t l thi gian ngng sn xut t l tr hon vic cn bng
(Balance delay) :
s chm tr cn bng l t l phn trm ca thi gian lng
ph hoc 100% tr i hiu qu dy chuyn. Trong v d ny, n l 4 (thi
gian nhn ri) / 30 = 0,1333 ; cng c xc nh bi 1 - 0,8667 = 0,1333.
S lng l thuyt ti thiu ca cc trm (Minimum theoretical number of
stations) (Nmin) : y l tng thi gian lm mt n v chia cho thi gian chu k v
c lm trn n s nguyn gn nht. Trong v d ny, chng ti c 26 giy cn thit
lm mt n v chia mt thi gian chu k 10 giy cho mt cu tr li l 2,6 ; m
chng ta lm trn n 3 trm.
Ngoi ra, mt ca s th hai s m ra hin th s lng cc trm yu cu s dng
ca cc quy tc cn bng khc nhau. Trong trng hp ny, mi quy tc u dn n
con s nh nhau l 3 trm. iu ny khng lun nh trng hp trong v d 4.
th u tin c th c hin th (xem kt thc ca phn ny), cng nh mt thanh
th ch ra bao nhiu thi gian c s dng ti mi trm. Chng c hin th
cui phn ny. Ngoi ra, nu c thi gian nhn ri ti mi trm, mt lu s xut hin
pha trn ch ra rng s cn bng c th c ci thin bng cch gim thi gian chu k.
V d, khi c thi gian nhn ri l 1, th 1 v 2 giy ti trm 3, chng ta c th lm
gim thi gian chu k i 1 giy.
V D 2 : TNH TON THI GIAN CHU TRNH
(Example 2 : Computing the cycle time)

Gi s rng i vi cng mt d liu chng ti yu cu sn xut ca 2.250 n v
trong 7.5 gi.
TRANG 59
PHN MM NH LNG POMQM
Chng ta gi thit s pht v s gi y , tnh ton thi gian chu k (CTd) l :

(7.5 gi / 2,250)*( 60 pht / gi)*( 60 giy / pht) = 27.000 / 2,250 = 12 giy / n v
MN NH GII PHP I THEO
NHNG QUY TC KHC :
(Other Rules)
Chng ti cp n cc quy tc khc nhau c th c s dng mc d chng ti
khng hin th kt qu.
Xin lu rng y l mt trong cc m-un nu bn thay i phng php (bng
cch s dng hp th xung) t mn hnh gii php, vn ngay lp tc s c gii
quyt. l, bn khng cn phi s dng cc nt EDIT v quay tr li cc d liu.
NHIM V LM SAU CNG NHT NHIM V CHIA RA TNG PHN
(Most Following Tasks)

Mt cch ph bin chn nhim v l bng cch s dng nhim v vi
cc nhim v lm sau cng nht. Thng bo t s a c 3 nhim v sau
n, v b c 2 nhim v theo sau n. V vy, nhim v u tin d kin l
nhim v a khi s dng quy tc ny (hoc nu bng nhau th nhim v no n
trc s c u tin thc hin trc). Kt qu hin th cho thy s nhim v sau
cng nht trong ct c t tn l nhim v sn sng Ready Tasks. iu
ny c hin th trong mn hnh kt qu v d 4.
TRANG 60
PHN MM NH LNG POMQM
PHNG PHP XP HNG TRNG LNG V TR
(Ranked positional weight method)

Xp hng trng lng v tr tnh tng ca nhim v v tt c cc nhim v tip theo.
V d, nhim v a c xp hng trng lng v tr l 1 + 2 + 7 + 8 = 18, trong khi i
vi nhim v b trng lng l 5 + 3 + 8 = 16. Cc nhim v vi trng lng ln nht
c d kin trc tin (nu n ph hp trong thi gian cn li). Ch rng e c
trng lng xp hng v tr cao hn c. Mn hnh hin th kt qu cho thy trng lng v
tr xp hng trong ct c tn l "nhim v sn sng Ready Tasks.
THI GIAN HOT NG NGN NHT
(Shortest Operation Time)

Mt quy tc c s dng i khi l u tin cho cc nhim v m mt thi gian t
nht.
S B NHT CA NHIM V THEO SAU
(Least Number of Followers)

Quy tc cui cng m c sn l s b nht ca nhim v theo sau.
V D 3 : PHI LM G NU THI GIAN THAO TC DI NHT KHNG PH HP
(Example 3 : What to do if longest operation time will not fit)

Mt s sch v mt s phn mm khng p dng ng cch cc quy tc hot ng
thi gian di nht. Nu nhim v vi thi gian di nht khng ph hp vi trm, nhim
v vi thi gian di nht th 2 c t vo trm, nu n ph hp.
Trong mn hnh sau y chng ti trnh by d liu trong 8 nhim v. Ch rng
nhim v b, c, e, v f ngay lp tc theo sau nhim v a.
TRANG 61
PHN MM NH LNG POMQM
S cn bng xut hin di y trong mt thi gian chu k l 5 giy. Sau khi cng
vic a c hon thnh, nhim v b, c, d, v e c sn sng. Nhim v b l di nht
nhng s khng ph hp trong 4 giy cn li ti trm 1. V vy, nhim v c c a
vo cn i. Chng ti cnh bo bn rng nu cu tr li trong cun sch ca bn khc
vi chng trnh, bn nn kim tra xem cc cun sch b qua a vo nhim v
vi thi gian hot ng di nht m s ph hp.
V D 4 : PHN CHIA NHIM V
(Example 4 : Splitting tasks)

(Most Following Tasks)
Nu thi gian chu k l t hn s lng thi gian thc hin mt nhim v c th,
c mt vn . Chng ti thc hin nhng g c gi l phn chia nhim v, nhng m
trong thc t thc s l trng lp. V d, gi s rng thi gian chu k l 2 pht v mt
nhim v phi mt 5 pht. Th chng ti c nhim v c thc hin 3 ln (ba ngi
ba my c lp vi nhau). C hiu lc l 3 n v s c thc hin mi 5 pht, tng
ng vi mt n v l mi 1,33 pht, ph hp vi chu k 2 pht.
By gi, cch thc t rng ba ngi lm vic c th khc nhau. Trong khi cc
chng trnh khc s phn chia nhim v, cc gi nh khc nhau t chng trnh ti
chng trnh. Thay v lm cc gi nh, chng ti ri khi n bn phn chia cc nhim
v bng cch chia thi gian nhim v mt cch thch hp.
Gi s rng trong v d 1, chng ti mun s dng mt thi gian chu k trong 5 giy.
Th n l cn thit ti to c hai nhim v d v f khi chng khng ph hp trong thi
gian chu k. Cch tip cn s dng gii quyt vn bng cch phn chia thi gian
nhim v bng 2, khi nhn rng ny l cn thit. Chng ti trnh by kt qu trong mn
hnh sau y. Ch rng cc quy tc khc nhau dn n s lng ti thiu ca cc trm
khc nhau !
TRANG 62
PHN MM NH LNG POMQM
NHNG TH
(Graphs)
Hai th khc nhau c sn. u tin l mt th u tin, nh th hin trong hnh
bn di. Xin lu rng c th c nhiu cch khc nhau v mt th u tin.
th th hai (khng hin th y) l thi gian c s dng ti mi trm. Trong

mt th gii hon ho ny tt c s l nh nhau (mt s cn bng hon ho).
TRANG 63
PHN MM NH LNG POMQM
M HNH N NH - PHN CNG CNG VIC

(The Assignment Model)
See also : Linear Programming (quy hoch tuyn tnh) , Transportation.
Cc m hnh chuyn nhng (phn cng cng vic) c s dng gii quyt vn
phn cng 1 cho 1 ca s phn cng nhn vin ti nhng cng vic, nhn vin ti
my, my ti cng vic, ect v.v... M hnh ny l mt trng hp c bit ca phng
php giao thng vn ti (Transportation method). Trong th t to ra mt vn
phn cng, n l cn thit cung cp s lng cng vic, v my mc, v cho bit vn
l vn gim thiu hay ti a ha. S lng cng vic v s lng my mc khng
phi l ngang nhau, nhng thng thng l vy.
Hm mc tiu (Objective function) : mc tiu c th l ti thiu ha hoc ti a
ha. iu ny c thit lp mn hnh to ra nhng c th c thay i trong mn
hnh d liu.
V D
(Example)
Bng di y cho thy d liu cho mt vn phn cng 7-vi-7. Mc tiu ca
chng ti l phn cng mi nhn vin bn hng cho mt lnh th vi tng chi ph ti
thiu. iu phi l chnh xc mt nhn vin bn hng mi lnh th v chnh xc cho
mi lnh th mt nhn vin bn hng.
Pennsylvania
New Jersey
New York
Florida
Canada
Mexico
Europe
Mort
Cippy
Bruce
Beth
Lauren
Eddie
Brian
12
54
87
54
89
98
33
45
87
27
34
76
65
12
54
76
23
87
44
62
15
37
37
65
26
96
23
42
32
18
77
23
55
87
40
71
78
76
82
90
44
12
34
65
23
44
23
12
* Bruce khng c php lm vic bang Pennsylvania.

Cu trc d liu gn ging vi cu trc cho cc m hnh giao thng vn ti. S khc
bit c bn l m hnh phn cng khng hin th cc ngun cung cp v nhu cu khi tt
c chng u bng 1.
Ch : c gng ngn cn vic phn cng c thc hin, chng hn nh
ngn cn Bruce ti Pennsylvania trong v d ny, cn nhp vo mt chi ph rt ln.
Nu bn g 'X' vo ca n, chng trnh s t mt chi ph rt ln l 9999 cho cc
vn ti thiu ha hoc 1 li nhun l -9999 cho cc vn ti a ha vo trong t
bo ( ).
TRANG 64
PHN MM NH LNG POMQM
GII PHP
(The Solution)
S phn cng (Assignments) : s gn" (s ch nh) trong phn chnh ca bng
l phn cng rng c thc hin. Trong v d, Mort c gn ti Pennsylvania,
Cippy ti Florida, Bruce n Canada, Beth n New York, Lauren ti New Jersey,
Eddie sang Chu u, v Brian ti Mexico.
Tng chi ph (Total cost) : tng chi ph xut hin trong cc t bo () trn bn tri,
$191 trong v d ny.
S phn cng cng c th c a ra trong hnh thc danh sch, nh c hin

th trong mn hnh di y.
Cc chi ph cn bin cng c th c hin th. V d, nu chng ta mun ch nh

Mort ti New Jersey, tng s s tng t $30 n $221.
TRANG 65
PHN MM NH LNG POMQM
CHI PH CN BIN
Marginal Costs
Cc chi ph cn bin cho cc vn Asignment khng phi l nhng g bn c th
mong i (iu ny cng ng khi s dng Solver ca Excel gii quyt vn ). Ti
ght nhn c cc k thut nhng ... Chi ph bin l chi ph m nhp vo ring cc
gii php (ton hc). Bi v vn chuyn nhng phn cng cng vic (Asignment)
l mt vn lp trnh tuyn tnh (Linear Programming) thoi ha, n c th cho
nhp vo mt gi tr l 0 nh l tri ngc vi 1 m bn s c mong i. V vy,
bn ang mong i chi ph bin nu dng ring c giao cho ct ring, nhng phn
mm (c Excel v gi phn mm ny) gii thch chi ph bin khc nhau t . Cc
dng c th (hoc khng th) c giao cho ct. im mu cht l ... Hy cn thn khi
nhiu din mo (inter-pretting) chi ph cn bin c cho i vi vn chuyn
nhng bi bt k gi phn mm no (mt s ca s kt qu c chi ph cn bin
cho nhng nhim v m khng c thc hin).
PHN TCH HA VN & BNG QUAN

(Breakeven / Cost-Volume Analysis)
Phn tch bng quan Cost-Volume Analysis (so snh gia chi ph vi sn lng)
c s dng trong mt s lnh vc khc nhau ca POM v QM, c bit l nng lc lp
k hoch (Capacity Planning) v phn tch v tr (Location Analysis). Phn tch chi
ph sn lng c s dng tm nhng im trong s khc bit (in-difference)
gia hai la chn c bn da trn cc chi ph c nh v bin ph. Mt im ho vn
(Breakeven) c tnh ton trong iu khon ca n v (Units) hoc la (Dollars).
Ho vn ch n gin l mt trng hp c bit ca phn tch chi ph sn lng,
m c mt chi ph c nh (Fixed Cost), mt chi ph bin i (Variable Cost), v doanh
thu trn mi n v (Revenue Per Unit).
Phn tch ha vn bao gm mt chi ph c nh (Fixed Cost), chi ph bin i
(Variable Costs) v gi bn (Selling Price) hoc doanh thu (Revenue), n c s
dng xc nh sn lng m ti mt mt mt s chuyn sang li nhun, l, sn
lng m ti khng phi l mt mt mt cng khng phi li nhun, n tr li cho cu
hi c nn la chn hay khng.
M hnh chi ph, sn lng bao gm cc chi ph c nh v chi ph bin i ln n 5
ty chn khc nhau (vy chc ch c 5 l ht), n c s dng cho cc vn nh l
la chn my no l tt nht. Phn tch chi ph-sn lng cng c th c s dng
tm im ha vn. Trong m hnh chi ph - sn lng, cc chi ph c nh v bin ph c
th c bao gm mt s thnh phn khc nhau. Nu bn c mt vn vi cc ty
chn khc nhau, m trong cng c doanh thu, ch cn thm mt s lng ty chn v
cho doanh thu l ty chn thm.
Mn hnh d liu c cha mt hp d liu thm vo cho php phn tch sn lng.
Cc d liu chnh bao gm mt danh sch cc chi ph. Chi ph (hoc doanh thu) l c
TRANG 66
PHN MM NH LNG POMQM
nh hoc bin i nh c thit lp bi mt hp th xung. Nhiu hn mt kiu chi

ph c th c nhp vo v chng trnh s tng hp tt c cc chi ph tng t li.
Nu vn l chi ph so vi doanh thu th n l hu ch cho php mt ty chn i
din cho doanh thu v t mi n v doanh thu nh l mt bin ph (ch khng phi l
nh ph) trong mt ct ca chnh n.
PHN TCH BNG QUAN - SO SNH GIA CHI PH V SN LNG
(Cost-Volume Analysis)
Trong phn tch chi ph sn lng chng ta so snh hai hay nhiu ty chn
xc nh nhng ty chn t tn km nht sn lng bt k. Cc chi ph bao gm hai
loi chi ph c nh v chi ph bin i, nhng chng c th l mt chi ph n m bao
gm cc chi ph c nh hoc chi ph bin i. Trong v d sau, chng ti ang ch ra
rng c 5 chi ph n khc nhau v 2 la chn.
V D 1 :
PHN TCH BNG QUAN (COST-VOLUME ANALYSIS)
(Example 1 : Cost-Volume Analysis)
D LIU
(Data)
Loi chi ph (Cost type) : mi loi chi ph phi c xc nh l chi ph c nh
hoc chi ph bin i. Mc nh rng chi ph u tin trong danh sch l chi ph c nh
v tt c cc chi ph khc l chi ph bin i. Nhng gi tr ny c th c thay i bng
cch s dng hp th xung trong t bo () .
Chi ph (Costs) : chi ph c th cho mi ty chn (Option) c lit k trong hai ct
trong bng.
Sn lng (Volume) : nu mt phn tch sn lng l mong mun, vic nhp vo
sn lng ti phn tch ny l nn c thc hin. Phn tch sn lng s tnh ton
tng chi ph (hoc tng doanh thu) ti sn lng c la chn. Nu sn lng l 0, th
khng c phn tch sn lng c thc hin khc hn i vi im ha vn. Chng ti
yu cu mt phn tch sn lng l 250 n v.
TRANG 67
PHN MM NH LNG POMQM
GII PHP
(Solution)
Mn hnh gii php rt n gin. Trong mn hnh trc c 5 chi ph vi mt s chi
ph c nh v bin ph. Chng trnh hin th cc kt qu nh sau :
Tng chi ph c nh (Total fixed costs) : vi mi mt trong hai la chn, chng

trnh c chi ph c nh, cng chng, v lit k chng bn di bng. Trong v d ny,
tng s chi ph c nh cho la chn 1 l $1300 (800 + 500), trong khi tng s chi ph c
nh cho phng n 2 l $900 (700 + 200).
Tng bin ph (Total variable costs) : chng trnh xc nh cc chi ph bin i,
cng chng ln, v lit k chng. Trong v d ny, tng chi ph bin i cho la chn 1 l
$10 cho mi n v, trong khi i vi phng n 2 l $12 cho mi n v.
im ha vn trong cc n v (Breakeven point in units) : im ha vn l s
khc bit gia chi ph c nh chia bi s khc bit gia chi ph bin i, v iu ny
c hin th trong n v. Trong v d ny, n l 200 n v.
im ho vn trong la (Breakeven point in dollars) : im ha vn cng c
th c th hin bng la.
Mt phn tch sn lng c thc hin cho mt sn lng l 250 n v. Tng
chi ph c nh v tng chi ph bin i c tnh ton cho mi la chn v chng
c cng mang li tng chi ph cho mi la chn.
Mt th c sn, nh sau :
TRANG 68
PHN MM NH LNG POMQM
V D 2 :
PHN TCH HA VN - SO SNH GIA CHI PH V DOANH THU
(Example 2 : Breakeven Analysis)

Mt loi tiu chun phn tch ha vn c doanh thu so vi chi ph.
D liu nhp cho cc ty chn ny l hi khc m chng trnh to ra mt ct cho

cc chi ph v mt ct cho doanh thu. Chi ph c nh v bin ph c nhp vo trong
ct chi ph v doanh thu trn mi n v c t trong ct doanh thu.
Cc c "xxxxxxx" ngha l gi tr (thi gian) v cng ln nn khng th phn
giao ti cc ny.
M hnh ny i hi phi chnh xc 3 u vo. u tin l chi ph c nh l
$10.000, th hai cho chi ph bin i l $20 cho mi n v, v th ba cho doanh thu
(bin ph) l $25 cho mi n v. Chng trnh s tnh ton mt sn lng ha vn l
2000 n v, hoc 50.000$ (khng c hin th).
V d ny cng c th c gii quyt bng cch s dng cc m hnh con chi ph
sn lng. Chn 2 ty chn v cho 1 l chi ph v 1 l doanh thu. t chi ph c nh
v chi ph bin i trong cc t bo () ca chng r rng, s dng khng chi ph c nh
cho doanh thu v s dng doanh thu trn mt n v nh l mt chi ph bin i. Chng
ti hin th iu ny di y.
V D 3 : BREAKEVEN IM HA VN C NHIU HN 2 LA CHN
(Example 3 : Breakeven point with more than two options)

Cc m-un ho vn c th thc hin mt phn tch ho vn ln n 5 la chn.
Trong phn sau y, chng ti cho thy u ra cho mt ha vn 3 ty chn. Cc mn
hnh gii php di y ch ra 3 im ho vn, so snh my tnh 1 vi my tnh 2, my
tnh 1 so vi my tnh 3, v my tnh 2 so vi my tnh 3. Tt nhin, trong khi c 3 im
ho vn, ch c hai trong s chng l c lin quan.
TRANG 69
PHN MM NH LNG POMQM
iu ny c nhn thy d dng hn mt cht bng cch nhn vo th ha vn

c a ra di y. im ha vn ti 40.000 n v s khng quan trng khi ti
40.000 n v ca 2 my tnh m ho vn c chi ph cao hn ty chn my tnh 2.
VN U T
(Capital Investment)
Module ny c th c s dng cho vic tm cc gi tr hin ti rng (NPV) ca
dng tin (Cash flow CF ) hoc cho vic tm t l hon vn ni b (IRR) ca dng tin.
Cc d liu cho v d ny bao gm mt dng vn vo (Inflows) v mt dng vn
chy ra (Outflows). Ngoi ra, vi vic tm cc gi tr hin ti rng, mt li sut (Interest
Rate r ) phi c cho.
V D 1 : GI TR HIN TI THUN (NPV)
Gi s mt cng ty mua mt ci my l 80.000$ ; m ci my ny tit kim cho
cng ty l $20.000 mt nm cho mi 5 nm tip theo v rng chic my c mt gi
tr cu h thanh l (Salvage) l $14.000 vo cui thi gian . V gi s li sut
nhp vo ty chn (Interest Rate) l 8% (0,08).
Cch d nht nhp vo d liu
ny l :
t $80.000 trong cc dng chy dng tin ra (Outflow) trong khong thi gian 0
Period 0 (nm th 0).
t 20.000$ trong dng vn dng tin vo (Inflow) cho giai on 1 v ri nhn
vo biu tng copy down trn thanh cng c in vo trong phn cn li ca
ct lu lng vo (Inflow) (sao chp xung ct).
t $14.000 (m 14.000$) trong dng chy (Outflow) ca giai on 5. iu
ny cho mt gi tr thanh l (Salvage) l +14.000$.
TRANG 70
PHN MM NH LNG POMQM
TRANG 71
PHN MM NH LNG POMQM
V D 2 :
GI TR HIN TI RNG - HIN GI THUN NPV
(Net Present Value)

Hy xem xt v d sau y. Mt cng ty i n mua thit b mi c chi ph l
100.000$. Bi v vi kinh nghim s dng cc thit b mi, cng ty s tit kim trong
vng 6 nm tip theo l : $22.000 ; $25.000 ; $22.000 ; $21.000 ; $19.000 v $18.000.
Khi kt thc 6 nm cng ty d kin c th cu h my (thanh l) 25.000$. Cng ty
mun bit gi tr hin ti thun bng cch s dng mt mc li sut l 10%. Mn hnh d
liu xut hin di y :
Mn hnh c hai ct cho d liu. Ct c dn nhn dng tin vo (Inflows) v

ct khc c dn nhn dng tin chy ra (Outflows). Chng ti ch ra ti thi im
to ra vn rng y l mt vn 6 giai on v bng d liu bao gm 6 thi k
cng vi thi k hin ti (l nm th 0). Chi ph mua $100.000 l mt dng vn chy ra
m xy ra ti lc bt u vn , do n c t trong ct dng vn chy ra ca
thi k hin ti l nm 0. 6 khong tit kim trong danh sch trn l dng vn vo, v
chng c t trong ct dng vn vo t giai on 1 n giai on 6. Gi tr cu
h (thanh l) c th c x l theo 2 cch, v chng ti chn cch m chng ti ngh
rng s cho mt mn hnh hin th tt hn. Chng ta c th thm gi tr thanh l $25.000
ti dng vn vo trong giai on 6 (=18000+25000). Nhng thay vo , chng ti
chn i din cho n nh l mt dng vn chy ra tiu cc (s m: -25000). iu
ny s gip ngha ca cc con s r rng hn. Mc cui cng c nhp vo l li
sut trong hp vn bn trn cc d liu (Interest Rate). Cc kt qu xut hin di y:
TRANG 72
PHN MM NH LNG POMQM
Mt ct c to ra m cho cc yu t gi tr hin ti (PV Factors) l cc khon

thanh ton duy nht. Bn phi n, cc ct dng vn vo (PV Inflows) v dng vn
chy ra (PV Outflows) c nhn vi cc yu t gi tr hin ti (PV Factors), v ct
bn phi xa hn cha cc gi tr hin ti (Present Values PV) cho dng vn rng
(dng vn vo v chy ra) trn c s giai on vi thi gian. Hng di cng
(Totals) cho tng cng mi ct v gii php ti vn ca chng ta l mt gi tr hin
ti rng (NPV) l $7603,25.
NH GI NI B CA S HON LI VN - T L HON VN NI B IRR
(Internal Rate of Return)

Vic tnh ton t l hon vn ni b l rt n gin. D liu c thit lp cng mt
cch nhng hp phng php c thay i t gi tr hin ti rng (NPV) ti t l
hon vn ni b (IRR). Cc kt qu xut hin bn di, ni m bn c th thy rng t
l hon vn ni b cho cng mt d liu l 12,38% v, tt nhin, gi tr hin ti rng
NPV (di cng bn phi) khi s dng t l (rate) ny l 0$.
PHN TCH QUYT NH

(Decision Analysis)
C hai m hnh rt c bn c s dng phn tch quyt nh : cc bng quyt
nh v cy quyt nh. Module ny cha : mt m hnh cho mt bng quyt nh
chung, mt m hnh cho vo mt cy quyt nh dng bng, mt m hnh mi th v
vi mt giao din ngi dng ha cho cy quyt nh, v mt m hnh to ra mt
bng quyt nh cung / cu (Supply / Demand) hoc mt tnh hung giai on tn kho.
TRANG 73
PHN MM NH LNG POMQM
M HNH BNG QUYT NH
(The Decision Table Model)

Bng quyt nh c th c s dng tm gi tr d kin : Maximin (hay cn gi
l Minimax Maxmini s ln nht trong ct ti thiu) hoc tm Maximax (hay cn gi
l Minimin Minmini gi tr ln nht trong bng hoc trong ct ti a) khi quyt nh
mt s ty chn c sn v y l mt kch bn c th xy ra. Ngoi ra, gi tr d kin
di chc chn, gi tr k vng ca thng tin hon ho, v tic nui (chi ph c hi c th
c tnh ton).
Khun kh chung cho cc bng quyt nh c cho bi s lng cc la chn
(cc quyt nh hoc cc la chn thay th khc) m c sn lm ra quyt nh v s
lng cc kch bn (hoc cc trng thi t nhin) m c th xy ra. Ngoi ra, chng ta
phi chn mc tiu l ti a ha li nhun hoc ti thiu ha chi ph.
Xc sut kch bn (Scenario probabilities) : i vi mi kch bn, n c th
(nhng khng bt buc) nhp mt xc sut. Cc bin php gi tr d kin (d kin
gi tr bng tin, gi tr d kin di chc chn, v gi tr k vng ca thng tin hon
ho) s yu cu cc xc sut, trong khi cc Maximin (minimax) v Maximax (minimin)
th khng.
Ch : nu xc sut l ging ht nhau th ch cn nhp vo du "=" trong mt t
bo () xc sut v chng trnh s thit lp tt c chng bng nhau (sao chp xung
ct).
Li nhun hoc chi ph (Profits or Costs) : li nhun (hoc chi ph) cho mi s kt
hp cc ty chn v kch bn l c cho.
Hurwicz Alpha : trn d liu l mt s kt hp thanh cun / hp vn bn nhp
gi tr cho Alpha Hurwicz, cho php bn nhp mt gi tr gia 0 v 1 cho Alpha Hurwicz.
Gi tr Hurwicz c s dng cung cp cho mt trung bnh c trng s ca cc kt
qu tt nht v ti t nht cho mi chin lc (theo hng - dng). iu ny khng c
trong sch gio khoa.
Mt bng c th c hin th m cho thy gi tr
Hurwicz i vi Alpha khc nhau t 0 n 1.
Cc thng tin ch yu l thnh qu thu c, hoc li nhun hoc chi ph, m
xy ra i vi mi quyt nh / kt hp kch bn. Ngoi ra, bn c th nhp vo xc
sut kch bn. y l nhng cn thit cho tnh ton gi tr tin t d kin
(Expected Monetary Value) nhng khng tnh ton cho Maximin, Maximax, v.v...
Nu xc sut c cho th ct u tin bn phi ca bng (EMV) l gi tr d
kin (Expected Value) hoc gi tr tin t d kin (Expected Monetary Value) nu
xc sut c cho. y l tng ca cc kt qu sn phm nhn vi xc sut i vi
mi dng (php nhn l c sn trong mt ca s u ra khc nhau). Ct tip theo,
Ct dng ti thiu (Row Min) ch n gin l kt qu thp nht c th cho mi dng.
Ct sau y, Ct dng ti a (Row Max) c kt qu cao nht c th cho mi dng.
Nu mt gi tr c cho i vi Hurwicz Alpha th ct cui cng (Ct Hurwicz)
cha cc tnh ton cho vic ny. Bn di ba ct ny l mt dng (ca ct ti a
hoc ct ti thiu Column Maximum or Column Minimum) m c cha cc gi tr
tt nht i vi mi ba ct mi. Di y l mt bng tm tt cc cu tr li.
TRANG 74
PHN MM NH LNG POMQM
V D 1 : BNG QUYT NH
(Example 1 : A Decision Table)

V d sau y trnh by 3 la chn quyt nh l s dng hp ng ph, s
dng lm thm gi, hoc s dng mt phn thi gian gip . Cc kch bn (cc trng
thi states t nhin) m nhu cu s thp, bnh thng, hoc cao, hoc l s c mt
cuc nh cng hoc lm vic chm li. Bng cha li nhun nh l ch nh. Hng u
tin trong bng i din cho xc sut m mi trng thi ny s xy ra. Ba dng cn li
i din cho li nhun m chng ta tch ly nu chng ta thc hin m quyt nh v
trng thi t nhin xy ra. V d, nu chng ta chn s dng lm thm gi v y l
nhu cu cao, th li nhun ca chng ta s l 180.
GII PHP
(Solution)
Mn hnh kt qu sau c cha c d liu v cc kt qu cho v d ny.
Gi tr d kin (Expected values EMV ) : cc gi tr d kin cho cc ty chn

c tnh ton v xut hin trong mt ct c nhn "EMV" (d kin gi tr bng tin),
m c ni vo pha bn phi ca bng d liu.
Cc php nhn gi tr d kin (Expected Value Multiplications) :
y l cc
php nhn trung gian ca xc sut bi gi tr i vi mi .
TRANG 75
PHN MM NH LNG POMQM
Hng (dng) ti thiu (Row minimum) : i vi mi hng, yu t ti thiu c

tm thy v c lit k. Yu t ny c s dng tm Maximin hoc Minimin.
Hng (dng) ti a (Row maximum) : i vi mi hng, cc yu t ti a lin tip
c tm thy v c lit k. Con s ny c s dng xc nh Maximax hoc
Minimax.
Hurwicz : i din cho (kt qu tt nht nhn vi 40%) cng vi (kt qu ti t nht
nhn vi 60%) cho mi hng. V d, i vi cc hp ng ph, Hurwicz l :
4 * 140 + 6 * 100 = 116.
Gi tr d kin ti a (Maximum expected value) : bi v y l mt vn li
nhun, chng ti ang quan tm n vic tm gi tr ti a. Gi tr ti a s l s ln nht
trong ct gi tr d kin, trong v d ny l 124,5
Maximin : l s ln nht (ti a) trong ct ti thiu. Trong v d ny, Maximin l
100.
Maximax : l gi tr ln nht trong bng hoc gi tr ln nht trong ct ti a.
Trong v d ny, n l 190.
THNG TIN HON HO
(Perfect Information)
Kt qu tt nht theo tng kch bn / trng thi t nhin (ct) State of
Nature (column) c tm thy v c t trong dng tn l thng tin hon ho
(Perfect Information). Bn di l mt dng cc thng tin hon ho nhn vi xc
sut cho ct .
Tng ca cc sn phm ny l gi tr d kin chc chn
(Expected Value of Certainty) v c lit k trong ct cui cng.
Gi tr d kin
ca thng tin hon ho l s khc bit gia s tng ny v gi tr d kin tt nht
(Best Expected Value).
Mt mn hnh th hai ca kt qu, trnh by cc tnh ton cho gi tr d kin ca
thng tin hon ho nh hnh di y (bng ny khng tn ti nu xc sut khng c
cho).
Thng tin hon ho (Perfect Information) : thm mt dng c nhn " Perfect
information " c add vo bn di d liu ban u. Trong dng ny, chng ti
lit k cc kt qu tt nht cho mi ct. V d, cc kch bn nhu cu thp, kt qu tt nht
l 120 c a ra bng cch s dng lm thm gi.
TRANG 76
PHN MM NH LNG POMQM
Hon ho * Xc sut (Perfect * Probability) Gi tr d kin di chc chn

Expected value under Certainty : gi tr d kin di chc chn c tnh l tng
ca cc sn phm ca xc sut nhn vi nhng kt qu tt nht. Trong v d ny l :
EV (Certainty) = 2 * 120 + 3 * 150 + 25 * 190 + 15 * 120 + 1 * 130 = 147,5
Cc hng (dng) hin th php nhn n (Perfect * Probability) trong phng trnh
trn (nh 24 ; 45 ; 47,5 ; 18 ; v 13) v s tng 147,5 c hin th pha bn tay
phi ca c 2 phng trnh v hng (dng).
Gi tr d kin ca thng tin hon ho (Expected value of Perfect Information):
gi tr d kin ca thng tin hon ho (EVPI) l s khc bit gia gi tr k vng tt
nht (124,5) v gi tr d kin di s chc chn (147,5), trong v d ny l 23.
Gi tr d kin ca thng tin hon ho l s khc bit gia tng s (Sum) ny v
gi tr d kin tt nht (Best Expected Value).
S HI TIC / S MT MT C HI
(Regret / Opportunity Loss)

Hi tic hay mt c hi : kt qu tt nht theo tng kch bn / trng thi t nhin
(ct) c tm thy v s hi tic hay mt c hi c xc nh nh l s khc bit
gia kt qu cc v kt qu tt nht ct ny. S hi tic Minimax v Minimin l
c cho (hi tic d kin Expected Regret dn n kt qu tng t nh gi tr d
kin v do khng c trnh by).
Mt phn ba mn hnh hin th u ra c sn l s hi tic hoc mt mt c hi
nh c hin th di y.
Bng gi tr (Table values) : cc gi tr trong bng cho mi ct c tnh nh l cc
gi tr tr t gi tr tt nht trong ct ca d liu. V d, theo nhu cu thp, kt qu
tt nht l 120. Nu chng ta hp ng ph v nhn c 100 th hi tic ca chng ta
l 20 (120 100 = 20) trong khi nu chng ta s dng mt phn thi gian gip th
s hi tic ca chng ta l 120 - 105 = 15. Hai ct nng sut hai b kt qu. Trong ct
c dn nhn hi tic ti a (Maximum Regret), chng ti xc nh s hi tic ti t
nht (cao nht) cho mi quyt nh v ri tm thy s hi tic Minimax Regret l 50
bng cch nhn vo nhng hi tic tt nht (thp nht) ny. Trong ct c nhn hi tic
d kin (Expected Regret) , chng ti ch n gin l nhn hi tic trong mi dng vi
xc sut.
( 20 * 0,2 ) + ( 30 * 0,3 ) + ( 50 * 0,25 ) + ( 0 * 0,15 ) + ( 0 * 0,1 ) = 25,5
TRANG 77
PHN MM NH LNG POMQM
cng l mt ca s khng hin th trong hng dn s dng ny m gi tr

lng Hurwicz i vi cc Alpha khc nhau t 0 n 1 (bng 0,01 i vi mi
ty chn quyt nh) (d kin hi tic Expected Regret dn n kt qu tng t
nh gi tr d kin Expected Value v do khng c trnh by).
CY QUYT NH
(Decision Trees)
Cy quyt nh c s dng khi trnh t quyt nh c thc hin. Cc Cy bao
gm cc Nhnh (Branches) kt ni cc im (Points) quyt nh, hoc cc im i
din cho c hi (Chance), hoc kt qu cui cng (Final Outcomes). Cc xc sut
(Probabilities) v li nhun (Profits) hoc chi ph (Costs) c nhp vo v quyt nh
phi chng nn c thc hin v gi tr ca mi nt (Node) c tnh ton. Tt c cc
bng quyt nh c th c t trong cc hnh thc ca mt cy quyt nh. S i lp
l khng ng.
Lu : phin bn 3.0 ca phn mm bao gm 2 phong cch u vo khc nhau
cho cy quyt nh. M hnh u tin c nhp d liu dng bng trong khi cc m hnh
th hai l d dng hn s dng bi v n c nhp d liu ha. M hnh u tin
(dng bng) c duy tr trong phn mm cho ph hp vi phin bn trc.
V D 2A : CY QUYT NH GIAO DIN KHNG HA
D liu u vo dng bng.
Decision Trees Tabular (cy quyt nh dng bng)
Cc d liu cho v d ny c nhp vo nh sau :

Start
xxxx
1
1
2
2
3
3
3
End
1
2
3
4
5
6
7
8
Probability
xxxxx
.6
.4
.2
.3
.5
Payoff
xxxxxx
100
50
200
75
0
Dng trn cng c to ra bi chng trnh v khng c sn chnh sa.

TRANG 78
PHN MM NH LNG POMQM
V D 2B : CY QUYT NH GIAO DIN KHNG HA

(Example 2 : A Decision Tree - non graphical)
Khun kh chung cho cc cy quyt nh c cho bi s lng nhnh, s lng
cc nt trong cy. S lng nhnh lun t hn s lng cc nt. Mi nt lun c chnh
xc mt nhnh i vo n. S lng nhnh i ra t bt k nt no c th l nt 0 ; 1
hoc 2. Cc im nt c 3 loi, c cc nt quyt nh, cc nt c hi, v cc nt cui
cng. Thng thng, cc nt quyt nh c i din bi hnh ch nht, v cc nt c
hi c i din bi cc hnh trn. V d ca chng ti c a ra bi mt s cy
quyt nh in hnh. Cc con s c 12 nhnh. Li nhun l quyn ca cc nt thit b
u cui. Ch rng c mt chi ph $100 gia chn mt s (nghin cu th
trng) nhnh.
s dng m-un cy quyt nh, c 2 iu phi xy ra. u tin, cc nt phi

c thm vo bn phi ca cc nhnh kt thc. V mt k thut, n l bt hp php
v mt cy kt thc vi ngnh (nhnh) ch khng phi l cc nt. Th hai, cc nt
phi c nh s. Cc con s sau y cho thy cc nt gi tr gia tng (cc nt b
sung) v thc t rng tt c cc nt c s. Cch thun tin nht l s ca
cc nt i t tri sang phi v t trn xung di.
Mn hnh d liu ban u (d liu bng) c to ra bng cch tr li rng c 12

nhnh v nhng ci ny chng ta ao c ti a ha li nhun. Mn hnh sau y
bao gm c bng d liu nhp vo ban u v gii php.
TRANG 79
PHN MM NH LNG POMQM
Nt bt u v kt thc (Start and End Node) : nhnh c c trng bi cc nt

bt u v kt thc. Thm mt nhnh tn l "Start" i din cho kt qu cui cng.
Cc nt gi tr c hin th trong ct bn phi. Trong v d ny, gi tr ca cy quyt
nh l $465.
Phn nhnh xc sut (Branching Probabilities) : xy ra ct 4 v xc sut i t
nt bt u nhnh n cc nt cui cng. Cc xc sut ra ca mt nhnh c hi n
nn cng ti 1.
Li nhun hoc chi ph (Profits or Costs) : li nhun (hoc chi ph) cho mi nt
kt thc m l thit b u cui th c nhp vo. Ngoi ra, n c th nhp vo mt
li nhun hoc chi ph cho nhnh bt k. V d, thng bo rng trong nhnh 10 (t nt 6
n nt 11), chng ti nhp vo mt chi ph $100 bng cch t -100 trong t bo
() .
GII PHP CHO CY QUYT NH
(The Decision Tree Solution)

D LIU GII PHP :
Nhnh s dng (Branch use) : i vi nhng ngnh (nhnh) m l nhnh quyt
nh th nn lun la chn, mt s lun lun Always c hin th , trong v d ca
chng ta, chng ta nn chn (t 1 nhnh n 3 nhnh) hn l (t 1 n 2 nhnh). i
vi nhng nhnh m chng ta nn chn nu chng ta c nhn, th chng ta hin th "c
th" Possibly, v d, nu chng ta c nhn n nt 6, th chng ta nn chn (t 6 n
9 nhnh) hn l (t 6 n 8 nhnh). Tuy nhin, khng c m bo rng chng ta s
nhn ti nt 6 do tnh cht xc sut ca Cy quyt nh. Kiu nhnh cui cng l nhnh
m chng ta nn chn nu chng ta c nhn, nhng chng ta khng nn nhn. iu
ny c nh du nh l ngc (li) "Backwards, nhn ti nhnh 7 (t nt 4 ti nt
8), nu chng ta nhn ti nt 8, chng ta nn s dng nhnh ny. Tuy nhin, khi chng
ta la chn t 1 nhnh n 3 nhnh lc u, chng ta khng nn kt thc ti nt 4.
Nt kt thc (Ending Node) : ct cc nt kt thc c lp li lm cho u ra d
dng c hn.
Kiu nt kt thc (Ending node type) : i vi mi nt kt thc, chng trnh xc
nh n nh l mt nt cui cng, mt nt quyt nh, hoc nt mt c hi.
Gi tr d kin (Expected value) : gi tr d kin cho mi nt c lit k. i vi
cc nt cui cng, gi tr d kin l ging vi u vo. i vi cc nt c hi, gi tr d
kin s l s kt hp c trng s ca cc gi tr ca cc nt. i vi cc nt quyt nh,
gi tr d kin l gi tr tt nht c sn t cc nhnh . C hai nt c hi v nt quyt
nh s c vi chi ph tr t cc gi tr nt (Node Values). V d, gi tr ca nt 11 l
$550. Tuy nhin, gi tr ca nt 6 l $450 do chi ph $100 i t nt 6 ti nt 9.
Mt th ca cc cu trc cy c th c hin th bi chng trnh.
TRANG 80
PHN MM NH LNG POMQM
V D 3 : CY QUYT NH - GIAO DIN NGI DNG HA
(Example 3 :
A Decision Tree - Graphical User Interface)
D liu u vo dng ha.
Mt trong nhng m hnh cho php cy quyt nh c nhp vo ha hn l

trong cc bng nh c a ra trn. Chng ti s s dng m hnh ny kim tra
cng v d va mi hon thnh.
Sau khi la chn cc m hnh, giao din s xut hin nh c hin th di y.
y l m hnh duy nht trong cc phn mm m c mt giao din u vo khng phi l
bng d liu giao din thng thng.
th (cy quyt nh) c hin th trong khu vc rng ln bn tri v c to

ra bng cch do ngi dng s dng cc cng c bn phi. Ban u ch c 1 nt. Bc
tip theo l thm nt s kin 2 t nt 1. Cc cng c bn phi thit lp cho nt 1. Mc
nh cho nt 1 rng n l mt nt quyt nh nh chng ta cn trong trng hp ny.
Mt nt Button c sn thay i cc nt nu iu ny tr nn cn thit. S lng
mc nh ca nhnh add thm vo l 2, nu chn 3 nhnh cn c add thm vo,
th bc u tin l chn Actions: n = 3, ri bm vo button (nt) "Add n Branches
( add thm nhnh). Cy c 2 nhnh mi ca chng ta xut hin nh sau.
...
TRANG 81
PHN MM NH LNG POMQM
Ch rng 2 nhnh c thm vo. V nt hin ti ang c chn trong hnh

l nt 2 c ch nh bi c 2 thc t rng s ca nt pha trn bn phi l nt 2
nhng cng bi thc t rng nhnh ti nt 2 c t m trong mt mu sc khc
(mu xanh). Ch rng cc nhnh c t tn mc nh l "Quyt nh 1" (Decision1)
v "Quyt nh 2", ect v.v... iu ny c th c thay i bng cch s dng cc
khu vc thng tin nhnh di cng ca khu vc cng c u vo.
Ti thi im ny, chng ta cn thm 2 nhnh t nt 2. Mc nh l add nhnh
quyt nh ti cc s kin v ngc li (add nhnh s kin ti cc quyt nh). Cc loi
nt (Node) lun lun c th c thay i sau ny. Click vo "Add n nhnh", ri nhp
vo xc sut (Probability) 0,6 v 0,4 cho c 2 nt mi v nhp vo li nhun (Profit)
l $400 cho nt 2 mi (tc nt 5), nu l chi ph (Cost) th nhp s m. Sau ,
thm 2 nhnh ti nt 3 v in vo trong xc sut 0,7 v 0,3 v li nhun 500$.
iu ny mang li nhng iu sau y.
Ch : cc nt c th c la chn bng cch bm vo chng hoc s dng kt
hp / hp thanh cun pha trn cng ca phn cng c bn phi.
Hon thnh d liu u vo bng cch thm cc nhnh quyt nh v d liu ti

cc nt 4 v 6 v s kin ti nt 11. Ngoi ra, bao gm chi ph $100 (-100) ti nhnh
quyt nh 6 (nt s kin 11, tc nt quyt nh 6, bao gm cc nt 6 v 11, vy phi
chn nt 11 in chi ph -100). Sau khi tt c cc d liu c nhp vo, nhn
vo nt gii quyt trn thanh cng c. D liu l mu en v gii php l mu xanh nh
bnh thng. Ch rng, nhnh m nn c s dng th c ch nh trong mu
xanh.
TRANG 82
PHN MM NH LNG POMQM
V D 4 : KIM K N - GIAI ON D TR N - TN KHO THI GIAN N
(Example 4 : Single period inventory)

M hnh ny c th c s dng to ra mt bng quyt nh cho tnh hung
lu kho giai on duy nht (cung / cu) (supply / demand) (cc vn nhu cu cung
ng Supply Demand Problems. Hy xem xt v d sau y. Trong qu kh, mt
hng hng khng quan st thy mt nhu cu cho cc ba n c bn trn my
bay nh c cho trong bng di y. Chi ph mi ba n ca hng hng khng gi
4USD v c bn vi gi 10$. Nu hng hng khng b thiu ht mt ba n, h cung
cp cho hnh khch mt phiu mua hng tr gi $5 cho thc phm ti sn bay n. My
bay nn d t bao nhiu ba n mi chuyn bay ?
Meals
Probability
(nhng ba n)
(xc sut)
10
.1
15
.2
20
.5
25
.15
30
.05
Bt u, bi vic to ra mt bng vi 5 nhu cu :
Chng trnh ang i hi 3 li nhun cng nh nhng nhu cu r rng v xc sut.

Li nhun trn mt n v (Profit per Unit) (Li nhun thng xuyn Regular
Profit) : y l li nhun bnh thng cho cc n v mua v bn. Trong trng hp
ny li nhun l $10 - $4 = $6.
Li nhun n v vt qu (Profit per Unit Excess) (li nhun trn hng
ho vt qu Profit on Excess Goods) :
l li nhun i vi cc n v m
ra lnh ht (over-ordered) (tc lng cn phi cung ln hn kh nng thc, s thit
mt khon li, tnh theo n v). Trong mt s trng hp, ni c mt gi tr cu vn
s vt qu chi ph ca n v ny s l mt li nhun, trong khi trong trng hp khc,
iu ny s l mt mt mt (m). Trong trng hp ny l mt mt mt m bng chi
ph ca mt ba n khng bn c 4 $ (1 ba b thiu * 4 USD = 4 , m).
TRANG 83
PHN MM NH LNG POMQM
Li nhun trn mt n v thiu ht (Profit per Unit Short) (li nhun trn hng
ho thiu ht Profit on Goods Short) :
y l li nhun cho cc n v khi chng
ta khng t hng. N s l mt li nhun nu chng ta c th mua cc n v
bn sau khi thc t l mt chi ph t hn so vi gi bn. Nu khng, n s l 0 hoc
c th thua l. Trong trng hp ny, bi v chng ta cp mt chng t, nn chng ta
c mt s mt mt bng chi ph ca chng t 5 $ (do cp phiu mua hng 5 USD) .
Nu chng ta khng cp chng t s khng c li hoc s mt mt s n v m
chng ta khng th p ng nhu cu.
Nhu cu v Xc sut (Demands and Probabilities) : nhp vo danh sch cc nhu
cu v xc sut lin quan ca chng.
Gii php di y. Hng Hng Khng nn t 20 ba n ti a ha li
nhun d kin ca n. Gi tr ca li nhun d kin l $93,75
NH GI CC YU T - MODULE CON
(Factor Rating)
TRANG 84
PHN MM NH LNG POMQM
NH GI CC YU T
(Factor Rating)
Version 3.41 Build 108 ngy 20/09/2010 mi c module ny, cng c mt m un
con trong m un Phn tch quyt nh (Decision Analysis) nh thy trn. Ngoi ra cc
m un khc cng c b sung thm mt vi tnh nng, v c thm m un con.
D BO
(Forecasting)
M hnh d bo (Forecasting Models) c chia thnh 4 m hnh con. Kiu u
tin ca m hnh l khi chng ta s dng d liu qu kh s dng d liu bn hng
(Past Data sales) d on tng lai d on nhu cu (Future demand).
iu ny c gi l phn tch chui thi gian (Time Series Analysis), trong bao
gm phng php ngy th (Naive Method), phng php di chuyn trung bnh
(Moving Averages), phng php di chuyn trung bnh trng (Weighted Moving
Averages), phng php n nh theo cp s nhn (Exponential Smoothing),
phng php n nh theo cp s nhn vi xu hng (Exponential Smoothing with
Trend), phng php phn tch xu hng (Trend Analysis), phng php hi quy
tuyn tnh (Linear Regression), phng php phn tch bi s phn tch nhn ging
(Multiplicative Decomposition) v phn tch ph gia (Additive Decomposition).
M hnh th 2 hi quy n gin v nhiu hi quy (Simple and Multiple
Regression) l tnh hung m mt bin (bin nhu cu) l mt chc nng ca mt hay
nhiu bin khc, iu ny c gi l nhiu hi quy (Multiple Regression). C s
chng cho gia hai m hnh hi quy tuyn tnh gin n mt bin c lp (Simple
Linear Regression) c th c thc hin vi mt trong hai m hnh con, tc l hi
quy n gin (Simple Regression) c th c thc hin bng cch s dng hoc
phn tch chui thi gian (time series analysis) hoc phn tch nhiu hi quy
(multiple regression).
Ngoi ra, gi phn mm ny c cha mt m hnh th 3 lp n hi quy chiu
(Regression Projector) cho php chng ta to ra cc d bo (Forecasts) a
ra mt m hnh hi quy c th (Particular Regression Model) v m hnh th 4
phn tch li (Orror Analysis) cho php chng ta tnh ton cc li a ra cc nhu
cu v cc d bo.
TRANG 85
PHN MM NH LNG POMQM
MODULL CON : PHN TCH T THI GIAN (DNG THI GIAN - CHUI THI GIAN)
(Time Series Analysis) Phn tch chui thi gian

Cc u vo phn tch chui thi gian l mt lot (series) cc con s i din
cho d liu qua cc thi k gn y nht n giai on thi gian (n time periods)
(l s lng thi gian ca d liu trong qu kh, ng nhp s lng thi gian m bn
s lm cc d bo). Trong khi kt qu chnh l d bo cho giai on tip theo, th kt
qu b sung c trnh by khc nhau ty theo k thut no c la chn. i vi
mi k thut, u ra bao gm chui "cc d bo" c thc hin trn d liu qu kh v
d bo cho giai on tip theo. Khi s dng phn tch xu hng (Trend Analysis)
hoc phn tch theo ma (Seasonal Decomposition), cc d bo c th c thc
hin nhiu hn mt giai on trong tng lai.
Cc bin php tm tt bao gm cc bin php li sai lch truyn thng bin php
li truyn thng ca thin v (traditional error measures of bias) (tc li trung bnh
Average Error), v li bnh phng trung bnh (mean squared error), li tiu chun
(standard error), trung bnh lch tuyt i (mean absolute deviation MAD) v
trung bnh li phn trm tuyt i (mean absolute percent error MAPE).
Ch : cc tc gi khc nhau tnh ton sai s chun (standard error) trong
nhng cch hi khc nhau. l, mu s (denominator) trong cn bc 2 (square
root) c cho bi -2 bi mt s tc gi v -1 bi cc tc gi khc. POM-QM For
Windows s dng -2 trong mu s i vi trng hp gin n (simple cases) v
lun lun hin th cc mu s u ra.
MN HNH D LIU CHUI THI GIAN
(The Time Series Data Screen)

Gi s rng chng ta c d liu nh c cho trong bng sau v mun d bo nhu
cu trong tun ca ngy 14 thng 2 (v c th l ngy 21 thng 2 ; 28 thng 2 , ...)
Week
(tun)
Sales
(hng bn)
January 3
100
January 10
120
January 17
110
January 24
105
January 31
110
February 7
120
Khun kh chung cho chui thi gian d bo c a ra cho thy s lng cc

im d liu qu kh (past data points). V d trn c cc d liu qu kh i vi
6 thi k cui cng va qua (tun), v chng ta ao c d bo cho giai on tip theo
giai on 7 (tun th 7, ngy 14 thng 2).
TRANG 86
PHN MM NH LNG POMQM
Phng php d bo (Forecasting Method) : hp th xung c 8 phng php

c t tn trn cng ca m-un ny, cng vi 1 phng php ngi dng
nhp d bo ring ca h theo th t thc hin mt phn tch li (phin bn mi c
10 phng php). Tt nhin, kt qu ph thuc vo phng php d bo c la
chn. Phng php di chuyn trung bnh (Moving Average) c hin th trn.
S lng giai on trong di chuyn trung bnh, n (Number of Periods in The
Moving Average, n) : s dng trung bnh di chuyn (moving average) hoc di
chuyn trung bnh trng s (weighted moving average), s lng giai on trong trung
bnh phi c cho. y l mt vi s nguyn (Integer) gia 1 v s lng giai on
thi gian ca d liu. Trong v d trn, 2 giai on c la chn, nh thy trong
khu vc d liu thm (ty chn : # Periods to Average) (gi tr trung bnh ny c
tnh trn ht thy bao nhiu giai on l phi c cho trc).
Gi tr cho bin ph thuc Y (Values for dependent (Y) variable) : y l nhng
con s quan trng nht bi v chng i din cho d liu. Trong hu ht cc trng
hp, chng s ch n gin l doanh s bn hng trong qu kh (Past Sales) hoc
nhu cu (Demand). D liu trong ct nhu cu c cho bng 100, 120, 110, 105, 110,
v 120.
GII PHP
(Solution)
Mn hnh cc gii php l tng t tt c, nhng u ra chnh xc ph thuc vo
phng php la chn. i vi cc k thut n nh ca trung bnh di chuyn c trng
s hoc khng trng s (moving averages weighted or unweighted) v n nh
theo cp s nhn duy nht (single exponential smoothing), th c mt thit lp ca
u ra, trong khi i vi n nh theo cp s nhn vi xu hng (exponential
smoothing with trend), th c mt hin th u ra hi khc. i vi cc m hnh hi quy
(regression models), c mt thit lp khc na ca u ra. Phng php c sn u
tin l phng php ngy th (Naive method) m ch n gin l s dng d liu cc
giai on gn y nht nh l d bo (forecast) cho giai on tip theo. y l mt
trng hp c bit ca di chuyn trung bnh vi n = 1 hoc trng hp n nh theo
cp s nhn vi alpha () = 1 v vy chng ta khng hin th cc phng php ngy th
y. Chng ti bt u vi phng php di chuyn trung bnh (moving averages).
TRANG 87
PHN MM NH LNG POMQM
V D 1 : PHNG PHP DI CHUYN TRUNG BNH
(Example 1 : Moving Averages)

Chng ta ang s dng di chuyn trung bnh 2 tun n = 2 bng u vo trn.
u ra chnh l mt bng tm tt cc kt qu.
Cc tnh ton cho tt c cc kt qu ny c th c nhn thy trn ca s chi tit

hin th bn di.
D bo (Forecasts) : ct u tin ca d liu u ra l tp hp thit lp cc d

bo m s c thc hin khi s dng k thut. Ch rng v y l di chuyn trung
bnh 2 tun, nn d bo u tin khng th c thc hin cho n tun th 3 (tc ch
c th d bo bt u t giai on th 3). Gi tr giai on 3 ny l 110, m xut hin
nh l nhp cnh u tin trong ct d bo. 110 c tnh l (100 +120) / 2 (gi tr
trung bnh c tnh trn 2 giai on nn ta chia 2). Ba con s 115 ; 107,5 v 107,5 i
din cho "cc d bo" ca d liu c. S cui cng trong ct, 115, c nh du
(mu ) l d bo cho giai on tip theo (tun th 7).
TRANG 88
PHN MM NH LNG POMQM
Giai on d bo tip theo (Next period forecast) : nh cp trong on

trc, d bo cui cng l bn di d liu (115) v l d bo cho giai on tip
theo, n c nh du nh vy trn mn hnh. Trong v d, n l 115.
Li (Error) : ct ny bt u phn tch li. S khc bit gia d bo v nhu cu
xut hin trong ct ny. Dng u tin c mt nhp cnh l dng m d bo u tin
din ra. Trong v d ny, d bo u tin xy ra vo ngy 17 thng 1 (dng 3) l = 0 v
d bo (Forecasts) l 110, c ngha l cc li l 0 (110 110 = 0). Trong tun tip theo
d bo l 115, nhng nhu cu l ch c 105, v vy cc li l -10 (105 115 = -10).
Gi tr tuyt i ca li |Error| (Absolute value of the error) : ct ny cha gi tr
tuyt i ca li v c s dng tnh ton lch MAD hay tng s lch tuyt
i (total absolute deviation). Ch rng -10 trong ct li tr thnh 10 trong ct
ny gi tr tuyt i (mt s co bng, c sa, mt s tch cc).
Li bnh phng (Error Squared - Error^2) : ct ny c cha bnh phng mi li
theo th t tnh ton li bnh phng trung bnh (mean squared error) v sai s
chun (standard error). 10 c bnh phng v c lit k nh l 100. Chng
ti cnh bo rng bi v chng ta bnh phng cc s, nn n hon ton c th l nhng
con s s tr nn ln hn y v rng hin th s tr nn ln xn mt cht. iu ny
c bit ng khi in.
Li t l phn trm tuyt i |Pct Error| (Absolute Percentage Error) : ct ny
cha gi tr tuyt i ca li chia cho nhu cu. Nu nhu cu l 0 th phn mm s pht
hnh mt cnh bo v MAPE.
Tng s (Totals) : tng cho nhu cu v mi 4 ct li xut hin trong dng ny.
Dng ny s c cu tr li cho cc vn trong cun sch da trn tng s lch tuyt
i (total absolute deviation) hn l lch tuyt i trung bnh (mean absolute
deviation). Nhng cun sch ang s dng tng s thay v trung bnh, nn cnh bo
sinh vin v so snh khng cng bng khi c s giai on khc nhau trong vic tnh
ton li.
Trung bnh (Averages) : cc trung bnh cho mi 4 li xut hin trong dng ny.
Tng li trung bnh (average error) c gi l thin v (Bias) v nhiu cun sch b
qua bin php li rt hu ch ny. Tng li trung bnh tuyt i trung bnh tng lch
tuyt i (average absolute error) c gi l MAD v xut hin trong hu ht cc
cun sch do s d dng tnh ton ca n. Tng li trung bnh bnh phng (Average
Squared Error) c gi l Mean Squared Error MSE v thng c kt hp vi
hi quy / bnh phng ti thiu (regression / least squares). Tng trung bnh ca cc
li phn trm tuyt i (absolute percentage errors) c gi l mean absolute
percentage error MAPE.
Bn ci tn ny c ghi trn mn hnh nh l Bias,
MSE, MAD, MAPE bn di gi tr ca chng. Trong v d ny, thin v (Bias) l
1,25, MAD l 6.25, MSE l 65,625 v MAPE l 5,55%.
Li chun (Standard Error) : mt bin php li l quan trng hn, y l li tiu
chun. Nhng cun sch khc nhau c cc cng thc khc nhau cho cc li tiu chun.
l mt s tc gi s dng n - 1 trong mu s (denominator), v mt s tc
gi khc s dng n - 2, chng trnh ny s dng n - 2. Mu s c hin th
trong u ra tm tt nh thy trn. Trong v d ny, sai s chun (Standard Error)
l 11,4564. Trong mu s cho li chun ny (Denominator for Standard Error),
TRANG 89
PHN MM NH LNG POMQM
n l s lng d bo (number of forecasts) thc hin nh tri ngc vi s lng

mu d liu (number of pieces of data). V d, d bo di chuyn trung bnh (moving
average forecasts) khng bt u trong giai on u tin. Cc li tiu chun
(standard error) l cn bc hai (square root) ca tng bnh phng li (Total Error
Squared) c chia bi n - 2. Nu cu tr li khng ph hp vi sch gio khoa ca
bn, xin vui lng kim tra sch gio khoa c la chn trong phn mm l chnh xc
(tr gip, thng tin ngi s dng).
Ch : cc my tnh phn phi bnh thng phn phi chun (Normal
Distribution Calculator) c th c s dng tm khong tin cy (confidence
intervals) v a ch cu hi xc sut (probabilistic) khc lin quan ti d bo.
Mt mn hnh c sn hn cho tt c cc phng php ny. l mt mn hnh m
cho php kim sot d bo kt qu (theo di tn hiu).
Di chuyn trung bnh (moving averages) y l mt mn hnh tm tt cc bin

php li so vi s lng d bo n trong di chuyn trung bnh.
Mt trong cc mn hnh u ra (khng c hin th trong hng dn s dng ny)

trnh by cc bin php li nh mt chc nng ca n. Ngoi ra, th di chuyn trung
bnh c mt thanh cun cho php bn d dng nhn thy cc d bo thay i nh s
thay i n ra lm sao.
TRANG 90
PHN MM NH LNG POMQM
V D 2 : PHNG PHP DI CHUYN TRUNG BNH C TRNG S
(Example 2 : Weighted moving averages)

Nu phng php di chuyn trung bnh trng s c la chn, hai ct mi s
xut hin trn cc bng d liu nh c hin th trong mn hnh sau y. Ct bn phi
l ni m cc trng s c t vo. Cc trng s c th l phn s m tng l 1 nh
trong v d ny (0,6 v 0,4) ; nhng chng khng c cng ti 1. Nu chng khng,
chng s c thay i t l. V d, trng s ca 2 v 1 s c chuyn i thnh
2/3 (2 trong 3 2+1=3) v 1/3 1 trong 3. Trong v d ny, trng s 0,6 v 0,4
c s dng thc hin cc d bo. V d, d bo cho tun th 7 ngy 14 thng 2
l : 0,6 * 120 + 0,4 * 110 = 116.
Ngoi ra, i vi phn tch li, trng lng 0,6 v 0,4 s c p dng nh vy m
0,6 th lun lun l trn cc d liu gn y nht. V d, d bo cho ngy 17 thng 1
s c cho bi : 0,6 * 120 + 0,4 * 100 = 112.
Trng s u trang (0,6) c p dng cho cc d liu gn y nht (most

recent data). Trng s th hai (0,4) c p dng cho 2 ln d liu gn y nht
(2nd most recent data), v.v...
Xin lu rng ct trng s Weight l khng ph hp vi ct d liu Data.
l, trng s trong dng 1 th khng p dng cho d liu trong dng 1.
Ngoi ra, nh ni trn, cc trng s c thu nh t 1. V d, nu trng s ca
bn l 4 ; 3 ; v 1 (4+3+1=8) ; th cc trng s s c s dng l 4/8 ; 3/8 v 1/8.
Mt mn hnh gii php (th cp) xut hin di y. Nh trc y, cc li v cc
bin php li c tnh ton.
TRANG 91
PHN MM NH LNG POMQM
V D 3 : LM N NH S M (N NH CP S NHN)
(Example 3 : Exponential Smoothing)

Alpha cho n nh theo cp s nhn (Alpha for exponential smoothing) : s
dng lm n nh theo cp s nhn, mt gi tr n nh khng i alpha phi c nhp
vo. Con s ny l gia 0 v 1. pha trn ca mn hnh mt s kt hp thanh cun /
hp vn bn s xut hin, cho php bn nhp vo gi tr n nh khng i alpha nh
c hin th trong mn hnh sau y. Gi tr n nh khng i alpha l 0,5 trong v
d ny.
Ch : nu bn chn alpha () = 0, phn mm s tm gi tr tt nht (MAD thp
nht) cho alpha !
Mt d bo bt u cho n nh theo cp s nhn (A starting forecast for

exponential smoothing) : thc hin n nh theo cp s nhn, d bo bt u l
cn thit. Khi lm n nh theo cp s nhn c chn, ct nhn "d bo" Forecast
s xut hin trn mn hnh pha bn di, l mt ct trng. Nu bn mun, bn c th
nhp mt s trong ct ny nh d bo. Nu bn khng nhp s, d bo bt u c
thc hin nh l nhu cu bt u (tc l, nu bn khng nhp vo mt d bo bt
u (Starting Forecast), chng trnh s s dng on mnh d liu u tin nh l
d bo cho giai on 1 (Forecast for Period 1).
Cc mn hnh kt qu c cc ct v xut hin nh l 2 phng php trc ,
c hin th tip theo nh sau :
Mt trong cc mn hnh u ra (khng c hin th trong hng dn s dng ny)

trnh by cc bin php li nh mt chc nng ca alpha. Ngoi ra, cc th cho
hm m (cp s nhn) c mt thanh cun cho php bn d dng nhn thy cc d bo
thay i th no nh alpha thay i.
TRANG 92
PHN MM NH LNG POMQM
V D 4 : N NH THEO CP S NHN VI KHUYNH HNG
(Example 4 : Exponential Smoothing With Trend)

n nh theo cp s nhn vi xu hng yu cu 2 hng s n nh khng i.
Mt gi tr n nh khng i beta cho xu hng ny c thm vo m hnh.
Beta cho n nh theo cp s nhn (Beta, for exponential smoothing) : thc
hin n nh theo cp s nhn vi xu hng, mt hng s lm n nh (t 0 ti 1) phi
c cho (ngoi t 0 ti 1 ca alpha). Nu beta l 0, n nh theo cp s nhn duy
nht c thc hin. Nu beta l s tch cc, n nh theo cp s nhn vi xu hng
c thc hin nh c hin th.
Mt d bo bt u (Starting Forecast) cng c th c cho (nh thy
n nh theo cp s nhn trn).
Khuynh hng ban u (Initial trend) : trong m hnh ny, xu hng ban u
c chng trnh thit lp l 0, tr khi n c khi to. N nn c thit lp
cng giai on thi gian nh l d bo ban u (Initial Forecast).
Cc mn hnh gii php cho k thut ny l khc vi cc mn hnh cho cc k thut

m t trc y. Tnh ton d bo xut hin trong Ct c nhn Unadjusted Forecast
cha iu chnh d bo. Nhng con s ny tng t nh trong v d trc (v chng
ta s dng cng mt gi tr alpha). D bo xu hng xut hin trong ct c nhn
trend - xu hng.
Xu hng ny l s khc bit gia d bo n nh gp i t
giai on ti giai on (trng s bi beta). Cn cc d bo xut hin trong ct c
nh du "Adjusted Forecast iu chnh d bo.
Ct d bo cha iu chnh Unadjusted Forecast c cho bi phng trnh
n nh theo cp s nhn thng thng : F(t+1) = F(t) + Alpha ( D(t) - F(t) )
F
t+1
= (alpha )*(nhu cu thng t) + (1 ) * (d bo thng t)

= alpha * D
= F
t1
+ ( D
+
t1
(1 alpha) * F
F
t1
)
TRANG 93
PHN MM NH LNG POMQM
Xu hng (Trend) c tnh ton bi mt phng trnh tng t nh trn, v

d bo iu chnh (Adjusted Forecast) c cho bi d bo cha iu chnh cng
vi xu hng.
Lu : tht khng may, c mt s khc nhau gia n nh theo cp s nhn
(Exponential Smoothing) vi phng php xu hng (Trend Methods). Trong khi
tt c chng tng t nhau, kt qu li khc nhau. V vy, n c th l kt qu c
cho bi POM-QM for Windows s khng ph hp vi kt qu ca vn bn ca bn.
iu ny l rt ng tic nhng khng th trnh khi. Nu bn ang s dng vn bn
Prentice Hall, hy chc chn rng phn mm c ng k (tr gip thng tin ngi s
dng) cho vn bn trong th t c c cc kt qu ph hp.
H s iu hng : Ft = (Dt - 1) + (1 - )(Ft - 1 + Tt - 1)
Tt = (Ft - Ft - 1) + (1 - )Tt - 1
Hm m
D
bo (Ft)
D bo FITt =
Hm m
iu hng (Tt)
V D 5 : PHN TCH XU HNG
(Example 5 : Trend Analysis)

Nh cp trc y, mn hnh gii php cho hi quy khc vi mn hnh gii
php cho cc k thut d bo khc. Mt bng tm tt mu u ra bng cch s dng hi
quy cho cng mt d liu xut hin di y.
N c th thc hin hi quy ni m cc bin c lp i din cho thi gian.
Gi tr cho bin c lp X (Values for independent (x) variable) : i vi chui
thi gian hi quy, cc gi tr mc nh c thit lp t 1 n n v khng th thay i.
i vi hi quy kt hp, gi tr thc t ca bin ph thuc (Y) cn c nhp vo (xem
v d 6).
TRANG 94
PHN MM NH LNG POMQM
Cc mn hnh c thit lp trong th t m cc tnh ton c thc hin cho vic

tm cc dc (h s gc) v cc ngn chn (h s chn) s c r rng. Trong
th t tm nhng gi tr ny l cn thit tnh ton tng ca X^2 (X bnh phng)
v tng ca XY. Hai ct ny c trnh by, ty thuc vo cun sch, hoc l tng cc
ct ca chng hoc trung bnh ca cc ct ny, cng nh hai ct u tin, s c s
dng to ra ng hi quy. ng ny c cho bi cc h s gc v h s chn,
c lit k pha di bn tri ca mn hnh. Trong v d ny, ng m d liu tt
nht ph hp c cho bi :
Y = 104.33 + 1.857 * X
( Y = a.X + b )
(c c l bn hng c c s l 104,33 vi mc tng l 1,857 mi tun)
Nu d liu tun t, d bo giai on tip theo s c hin th. iu ny c cho
bi cch chn nhiu hn s lng giai on vo ng hi quy. Trong v d, chng ta
s chn 7 vo phng trnh trn, nng sut (Yield) l 117,33 ; nh c hin th trn
mn hnh di cng ca ct d bo.
Cc li tiu chun c tnh ton v hin th nh vi tt c cc phng php khc.
Trong v d ny, n l 8,0696 tt hn so vi bt k phng php no khc m c
nhn thy. Cng lu rng cc li bnh phng trung bnh c hin th (trong v d ny
l 43,41). Cc thin v (Bias) th tt nhin l 0, cng nh l hi quy tuyn tnh th khng
thin v. Chng ti hin th mn hnh tm tt nh sau.
Ch rng cc h s tng quan v h s r bnh phng (r^2) c hin th
nh l u ra. Tm li l nhng d bo cho mt s giai on tip theo, khi y l mt
phn tch xu hng (chui thi gian hi quy).
th phn tch xu hng c thanh cun m lm cho n rt d dng thay i

dc v cc ngn chn ca ng (ng xu hng).
TRANG 95
PHN MM NH LNG POMQM
V D 6 :
Example 6 :
KHNG CHUI THI GIAN HI QUY

Non time series regression
Linear Regression / Least Squares

Hi quy tuyn tnh / bnh phng t nht ti thiu
i vi hi quy tuyn tnh / bnh phng t nht (ti thiu), cc ct l X^2 cho bnh
phng ca cc bin c lp Independent Variables (thng l thi gian 1, 2, 3, ...)
v ct X*Y cho cc sn phm ca cc bin c lp v bin ph thuc
(Dependent Variables). Ct d bo c cho bng cch s dng phng trnh hi
quy (regression equation) m c tnh ton v c lit k gn di cng ca
mn hnh.
N c th thc hin hi quy ni m cc bin c lp i din cho thi gian hoc
khng tuyn b (khng i din) cho thi gian.
Hi quy c th c s dng trn d liu m l quan h nhn qu. Trong mn hnh
k tip, chng ti trnh by doanh s bn D nh l mt chc nng ca s lng
inches ca nc ma trong 4 qu ca nm. Gii thch ca mn hnh gii php l
ng m d liu ny ph hp nht c cho bi :
Doanh s bn D = 49,93 + (27,43 * S Inch ca ma)
TRANG 96
PHN MM NH LNG POMQM
i vi hi quy, n cho php i n ct c nh du giai on (x) v thay

i cc gi tr trong ct ny.
Trn d liu l mt hp vn bn m cho php chng ta t mt gi tr cho X nhp
vo phng trnh hi quy. Gii php ny xut hin trong cc bng tm tt (khng hin
th). Trong v d ca chng ta, nu X = 10, th bng tm tt ch ra rng Y = 324,2901.
V D 7 : PHN TCH V PHN MA
(Example 7 : Decomposition and Deseasonalization)

Phn tch nhn ging (Multiplicative Decomposition)
i vi chui thi gian hi quy (Time Series Regression), bng tm tt cha
cc d bo (Forecasts) cho mt s giai on trong tng lai. i vi phn ma
Deseasonalization c mt ct m cha hoc l di chuyn trung bnh trung tm
(Centered Moving Average) hoc l trung bnh tng th ca cc d liu (Overall
Average Of The Data) ph thuc vo ty chn chn. Ct t l (Ratio) c
cho bi nhu cu / trung bnh (demand / average). Cc ma (Seasonals) c tnh
ton, v ct n nh (Smooth) c cho bi nhu cu / ma (demand / seasonal).
D liu phn ma (Deseason) l ging nh d liu c n nh
(Smoothed), ct tht li ct c hi quy (Regressed) cha cc d bo bng
cch s dng hi quy trn cc d liu c phn ma (Deseasonalized) v ct
dy dn ct ma (Seasoned) c nhng tht li c hi quy (Regressed)
c nhn bi cc yu t theo ma (Seasonal Factor). i vi nhiu hi quy
(Multiple Regression), cc h s xut hin trong mt dng pha trn v phng
trnh y c cho trong bng tm tt.
Quan trng i vi phng php phn tch l s lng cc ma c s
dng (number of seasons) # Seasonal (v d nu chn # Seasonal = 4 ma
tc n = 4 th n / 2 = 2, b qua 2 giai on, v bt u tnh ton t giai on th 3,
tng t, n = 12, n / 2 = 6, b qua 6 giai on, v bt u tnh ton t giai on th 7).
iu ny c thit lp trong thanh cun / hp vn bn kt hp trong hp d liu b
sung. iu ny phi c t nht l 1 v t hn mt na s giai on ca d liu.
N c th s dng mt di chuyn trung bnh trung tm CMA (Centered Moving
Average) hoc trung bnh MA (Average) ca tt c cc d liu nh l c s
phn tch. iu ny c thit lp trong hp ty chn trn cc d liu, c hai, phn
tch nhn ging tch bit cc nhn tnh ma v (Multiplicative) v phn tch ph gia
tch bit cc cng tnh ma v (Additive Decomposition) c th c thc hin.
Ngoi ra, n c th m rng cc h s cng s lng giai on ti trung bnh ti 1
(nu l nhn ging) hoc ti 0 (nu l ph gia).
u ra ph thuc vo k thut c th, nhng ni chung, bn s c cho d
bo cho giai on tip theo v mt phn tch li m bao gm :
Bias = Mean (of : demand forecast)
Thin v = Trung bnh (ca : nhu cu d bo)
MAD = Mean (of : absolute value of demand forecast)
Li trung bnh tuyt i = Trung bnh (ca : gi tr tuyt i nhu cu d bo)
TRANG 97
PHN MM NH LNG POMQM
MSE = Mean (of : square of demand forecast)

Li trung bnh bnh phng MSE = Mean (bnh phng ca nhu cu d bo)
MAPE = Mean average percent error
T l li trung bnh tuyt i MAPE = Trung bnh li phn trm trung bnh
Mn hnh sau y s hin th mt v d vi d liu theo ma. Nh c th c nhn
thy trong mn hnh, c 12 im d liu.
Bn phi nhp s lng cc ma nh 4 qu hoc 12 thng hoc 5 hoc 7 ngy.

Ngoi ra, bn phi nhp c s cho s n nh. Bn c th s dng hoc di chuyn trung
bnh trung tm (m l ph bin) hoc trung bnh tt c d liu. Ngoi ra, bn c th c
phn mm quy m cc yu t theo ma nu bn thch.
Mn hnh gii php c cha mt s ct.
TRANG 98
PHN MM NH LNG POMQM
Di chuyn trung bnh trung tm (Centered moving average) :

d liu c n
nh bng cch s dng mt di chuyn trung bnh m di nh l giai on thi gian 4
ma. Bi v s lng ma thm ch cn, di chuyn trung bnh trng s bao gm mt
na ca thi k cui v tt c ca 3 giai on gia. V d, cho ma h 1996, trung
bnh trng s l :
{ 0,5*(96) + 68 + 95 + 94 + 0,5*(93) } / 4 = 87.875
Trung bnh ny khng th thc hin cho giai on n / 2 u tin v bt u
trong giai on 3.
Nhu cu ti t l di chuyn trung bnh (Demand to Moving Average Ratio) : i
vi tt c cc im d liu m c tnh di chuyn trung bnh, t l cc d liu thc t
di chuyn trung bnh c tnh ton. V d, i vi ma h 2002, t l ny l :
95 / 87.875 = 1,081
Yu t theo ma (Seasonal factors) : cc yu t ma v c tnh nh mc trung
bnh ca tt c cc t l. V d, cc yu t theo ma h l trung bnh ca 1,081 (ma h
2002) v l 0,997 (ma h 2003), trong sn lng 1,039 ; nh th hin cho c ma
h 2002, ma h 2003, v ma h nm 2004.
M rng quy m yu t theo ma (Seasonal Factor Scaling) : 4 yu t ma v l
1,067 ; 0,813 ; 1,039 v 1,105 ; m tng l 4,024 (ch khng phi l 4). Nu chng ta
chn cc ty chn trong cc khu vc trn cc d liu quy m cc yu t th yu t
ma v ca chng ta s c thay i t l (nhn vi 4 / 4,024) v tr thnh 1,060 ;
0,808 ; 1,033 v 1,098 tng ng.
D liu n nh (Smoothed data) : cc d liu ban u c phn chia theo yu
t ma v ca n a ra cc hiu ng theo ma v tnh ton cc d liu n dnh.
D bo cha gii quyt - cha iu chnh d bo (Unadjusted Forecast) : sau khi
n nh cc d liu, phn mm tm thy ng xu hng cho cc d liu n nh. Ct
ny i din cho d bo bng cch s dng ng xu hng ny. ng xu hng
chnh n c th c tm thy trn mn hnh kt qu tm tt.
iu chnh d bo (Adjusted Forecast) : ct cui cng (trc khi phn tch li) b
mt d bo ti ng xu hng v ri nhn chng vi cc yu t ma v thch hp.
Cc li da trn iu ny tin hnh iu chnh d bo so vi d liu gc.
Bng tm tt bao gm cc d bo cho thi gian ti.
TRANG 99
PHN MM NH LNG POMQM
PHN TCH PH GIA - PHN TCH CNG TNH
(Additive Decomposition)
Chng ti khng hin th u ra y. M hnh ph gia (cng tnh) s dng s
khc bit ch khng phi l t l xc nh cc yu t ma v m l ph gia ch
khng phi l bi s.
Phng php cui cng l ngi dng t xc nh (user-defined). iu ny cho
php bn nhp vo d bo v cho php phn mm thc hin cc phn tch li. Ging
module c sn nh 4 m hnh con khi menu New c chn.
MODULE CON : NHIU HI QUY
(Multiple Regression)
Nh ni trn, cc m-un d bo c th thc hin nhiu hi quy. C hai yu t
d liu u vo. S lng giai on ca d liu phi c cho, ngoi ra, s lng ca
cc bin c lp phi c cho. Trong v d u tin ny, chng ti s m rng vn
hi quy trong v d 6. Lu rng i vi hi quy gin n (mt bin c lp) c 2 m
hnh con c th c s dng gii quyt vn . Hoc l phn tch chui thi gian
bng cch s dng phng php hi quy hoc m hnh con hi quy.
Khi bn bt u mt vn mi, bn s c yu cu nhp vo :
Tiu vn (Problem Title).
S cc quan st (Number of Observations).
S lng bin c lp (Number of Independent Variables).
Nu s lng bin c lp l 1 th y l hi quy n gin (Simple Regression).
Nu khng, hy nhp vo cc thit lp d liu nh l : y, x1, x2, ...
Chng trnh tm cc h s Beta m to ra dng ng (Line) :
Y = beta0 + (beta1 * x1) + (beta2 * x2) + ....
V D 8 : NHIU HI QUY
(Example 8, m dun con : Multiple Regression)

Trong v d ny, chng ti s dng 2 bin c lp v do nhiu hi quy phi
c s dng. Chng ti c nhp vo 4 s lng giai on v 2 s ca bin c lp.
Chng ti in vo cc d liu, v gii php mn hnh xut hin bn cnh. u
vo c 4 ct : mt cho tn ca khong thi gian, mt cho bin ph thuc (Y) ( D), mt
bin c lp (X) (cn ma), v mt cho bin c lp (X) thi gian (t 1 n 4). Mn
hnh hin th u ra l hi khc trc. Cc tnh ton khng c hin th. Phng trnh
hi quy khng c hin th r rng trn mn hnh ny nhng c th c tm thy bng
cch nhn vo cc h s beta bn di bng. l, phng trnh :
Doanh s bn hng D = 98,2381 + (26,5238 * Ma) + (11,9381 * Times)
iu ny c th hin r rng trn mn hnh tm tt m chng ti khng hin th.
TRANG 100
PHN MM NH LNG POMQM
MODULE CON :
LP N HI QUY CHIU
(Projecting)
(Regression Projector)
Bn c th a ra mt s d bo bng cch in vo cc gi tr cho cc h s

hi quy trong ct u tin v cc gi tr cho cc bin c lp (X) vo cc ct cn li.
M hnh th ba trong d bo cho php chng ta lm mt phng trnh hi quy v
lp d n n. Hy xem xt v d di y.
Khi chng ta t vn , chng ta ch ra rng c 5 bin s c lp v chng ta

mun to ra 3 d bo. ng hi quy c cho bi ct u tin :
Y = 80 + 3X1 + 7X2 + 21X3 + (-6X4) + 2X5
.
Y = 80 + 60 + 700 + 84 + (-18) + 36 = 942
Ba ct cha d liu cho X1 ti X5 cho mt trong ba d bo c thc hin.
Dng 1 cha mt s 1 khi y l s ngn chn. Cui cng, dng di cng cha cc
d bo l 942 ; 1018 v 1085 cho 3 kch bn.
TRANG 101
PHN MM NH LNG POMQM
MODULE CON : PHN TCH LI

(Error Analysis)
M hnh cui cng c th c s dng nhp c hai : d bo v d liu theo

th t thc hin mt phn tch li y . Phn tch li l ging ht vi nhng ci
c hin th trc y. S khc bit l phn mm cho php ngi dng nhp vo ct
d bo ch khng phi l da trn mt trong cc phng php c sn.
Ct d bo (Forecast) cha cc d bo theo phng php c chn.
Ct Li Error cha gi tr l : thc t tr i d bo.
Ct Li Error cha gi tr tuyt i, l ct khc.
Ct Li Error ^2 cha bnh phng ca ct khc ( ni trn).
Ct Li PCT PCT Error cha gi tr tuyt i ca li c chia bi datum.
L THUYT TR CHI
(Game Theory)
Mt tr chi tng khng (Zero Sum Game) c cho bi mt bng m a
s tin chi tr (Payoff) ti dng ngi chi Row Player (Ngi Chi 1) t
ct ngi chi Column Player (Ngi Chi 2). Bng tr chi c mt dng cho
mi chin lc (Strategies) ca dng ngi chi v mt ct cho mi chin lc
(Strategies) ca ct ngi chi.
Hy xem xt 2 ngi chi game c cho bi bng sau :
Strategy 1
(chin lc 1)
Strategy 2
Strategy 3
Strategy 4
Strategy 5
Strategy 1
10
-12
34
75
67
Strategy 2
38
57
96
28
-33
Row / Column
TRANG 102
PHN MM NH LNG POMQM
Nu dng ngi chi la chn chin lc dng 1 v ct ngi chi la chn

chin lc ct 1, th ct ngi chi chi tr cho dng ngi chi l 10. Nu dng
ngi chi la chn chin lc 1 v ct ngi chi la chn chin lc 2, th ct
ngi chi phi chi tr -12, hay ni cch khc, ct ngi chi nhn c 12 t
dng ngi chi.
Dng v Ct phi la chn mt chin lc m khng bit
nhng g i th la chn.
i khi gii php l cho ngi chi lun lun la chn mt chin lc (gi l mt
chin lc tinh khit) v i khi gii php l cho ngi chi la chn mt chin lc
ngu nhin (gi l mt chin lc hn hp). Trong c hai trng hp, iu ny c th
c xc nh.
GII PHP CHO V D
(Solution to the Example)

Cc gii php cho v d ny c hin th bn cnh.
Dng nn chi chin lc u tin 53,25% thi gian v chin lc th hai

46,75% thi gian. Ct nn chi chin lc th hai 59,17% thi gian v chin lc
th nm 40,83% thi gian v khng bao gi chi chin lc 1 ; 3 ; hoc 4. Nu h
lm theo nhng hn hp ny, th gi tr (k vng) ca tr chi l : Ct s phi tr
cho Dng l 20,2544. l, nu h chi game ny vi mt s lng ln thi gian
theo sau cc hn hp ti u ca h, nhng s tin phi tr (Payoffs) s l -12 ; 67 ;
57 v -33 (b qua cc ct c tng = 0) v trung bnh s l 20,2544.
MAXIMIN V MINIMAX
Maximin cng l Minimax, l s ln nht trong chui gi tr ti thiu.
Khc vi Maximax (hay cn gi l Minimin, l s ln nht trong chui gi tr ti a).
Xem m un s 06 : Phn tch quyt nh.
Mn phn tch nh lng trong kinh doanh (kinh t lng).
Khi kim tra cc tr chi, chng ta thng bt u bng vic tm kim cc Maximin
v Minimax. tm Maximin cho Dng, th kim tra tng dng v tm kt qu
ti t nht (l gi tr ti thiu). iu ny xut hin trong ct c nhn "dng ti thiu"
(Row Minimum) l -12 v -33 trong bng di y, ri tm gi tr tt nht trong
chng (l -12), th l gi tr ti a (gi tr ln nht) ca Minimax hay cn gi l
Maximin.
TRANG 103
PHN MM NH LNG POMQM
tm Minimax cho Ct, th kim tra mi ct v tm s tin phi tr ti t nht

(s ti a m Ct phi chi tr). iu ny xut hin trong dng c tn l "ct ti a"
(Column Maximum) l 38, 57, 96, 75, v 67. Minimax l gi tr tt nht (thp nht)
trong chng (l 38).
Gi tr ca tr chi l gia Maximin v Minimax nh xut hin trong tr chi ny
vi mt gi tr l 20,2544, m l khong gia ca -12 v 38.
GI TR D KIN CHO DNG
(Expected Values for Row)

Bng di y hin th cc tnh ton (php nhn) gi tr d kin cho mi chin lc
dng. Khi dng s dng c hai chin lc (1 v 2 ca n), th gi tr d kin l nh
nhau v ph hp vi gi tr d kin ca tr chi.
GI TR D KIN CHO CT
(Expected Values for Column)

Tng t nh vy, nu Ct chi ct 2 hoc 5, Ct s t c gi tr ca
tr chi. Tuy nhin, nu Ct chn ct 1, 3, hoc 4, th h hoc c y s phi tr
nhiu hn gi tr ca tr chi nh th hin bi cc gi tr d kin trong bng di y.
TRANG 104
PHN MM NH LNG POMQM
th l c sn nu mt hoc c hai ngi chi c t nht l hai chin lc.
LP TRNH MC TIU - QUY HOCH MC TIU

(Goal Programming)
M hnh lp trnh mc tiu (Goal Programming) rt ging vi m hnh lp trnh
tuyn tnh (Linear Programming), nhng trong khi chng trnh tuyn tnh c mt mc
tiu, chng trnh mc tiu c th c mt s mc tiu. Hy xem xt v d sau y.
Gi s mt cng ty sn xut hai sn phm X1, X2. Cc yu cu ngun lc v li
nhun c cung cp trong bng di y.
Product 1 (X1)
(Sn phm 1)
Product 2 (X2)
Available
(Sn c)
16
12
72
30
Profit per unit

(Li nhun n v)
Labor hours per unit
(nhng gi n lc)
Material per unit
(n v vt cht)
Ngoi ra, cng ty c mc tiu sau y :

1. Tng li nhun nn c t nht 250.
2. N cn c thi gian thit lp sn xut cho sn phm 2, v vy chng ti mun
sn xut theo l t nht l 5.
3. Nhu cu hin ti cho sn phm 1 l 14. V vy, chng ti mun sn xut chnh
xc 14.
Vn ny xut hin tng t nh mt chng trnh tuyn tnh, nhng by gi
chng ti c 3 mc tiu ch khng phi l 1 mc tiu.
TRANG 105
PHN MM NH LNG POMQM
D LIU
(Data)
Bt k chng trnh mc tiu no cng c xc nh bi s lng ca cc bin v
s lng cc hn ch hoc cc mc tiu. Khng tnh cc hn ch (Restrictions)
khng tiu cc khng phi l s m (Non-Negativity) nh l cc hn ch
(Constraints) (khng tnh cc hn ch khng m nh l cc hn ch, cc hn ch
phi l s m).
Nh vy, trong v d ny, chng ta c 2 bin s v 5 hn ch / cc
mc tiu ( 2 kh khn 2 hn ch v 3 bn thng 3 mc tiu ). Thng tin ny c
nhp vo nh c hin th trong mn hnh sau y :
Mt s thng tin ging ht lp trnh tuyn tnh, nhng c mt s s khc bit. u

tin lu rng khng c chc nng mc tiu (hm mc tiu). Th hai, nhn thy rng c
thm 4 ct u (bn tri) ca bng trc cc bin quyt nh. Nhng ct thm c
s dng cho cc mc tiu v khng hn ch (m bn c th thy rng chng l 0).
Mc tiu / hn ch (Goals / Constraints) : trong mi dng ca bng, chng ti
nhp vo hoc l mt hn ch hoc l mt mc tiu. Hai dng u tin i din cho
nhng hn ch. Khi chng l nhng kh khn (hn ch), 4 ct u tin khng c s
dng (s 0 c nhp vo). Cc hn ch c nhp vo trong thi trang (din mo,
giao din) thng thng.
Ba dng tip theo i din cc mc tiu, v c hai kha cnh mc tiu. Khi chng l
nhng mc tiu, thng bo rng ng nhp dng l du "=". Cc gi tr theo X1 v X2
phc v vo vic to ra cc mc tiu kt hp vi cc bin (d+) v (d-), ch ra rng chng
ta phi t trn (over-achieve) di (under-achieve) bao nhiu mc tiu. V d, dng 3
trong bng l vit tt ca :
1.X1 + 0.X2 - (d1+) + (d1-) = 14
X1 - (d1+) + (d1-) = 14
Nu X1 l di 14, th d1- i din cho s tin di (s thp hn), nhng nu
X1 l trn 14, th d1+ i din cho s tin m chng ta vt qu (s cao hn).
Tng t nh vy, dng tip theo (dng 4, mc tiu 2, c du = l mc tiu) i
din cho :
16X1 + 12X2 - (d2+) + (d2-) = 250
V vy, d2+ v d2- i din cho s tin li nhun vt qu 250 (d2+) v di
250 (d2-) tng ng.
TRANG 106
PHN MM NH LNG POMQM
Cc ton t, mc tiu l : (d1+) , (d1-) , (d2+) , (d2-) , (d3+) , (d3-). Cu hi t ra

l chng ta mun t hng th no, hoc trng s ca cc mc tiu ny l bao nhiu,
l, chng ta tng phn (phn nh) tm quan trng ca 6 mc tiu ny nh th no?
Chng ti lm iu ny bng cch s dng cc u tin v trng s trn ng.
u tin v trng s (Priorities and Weights) : u tin, c c 6 mc tiu (d1+,
d1-, d2+, d2-, D3+, D3-) trong v d ny, nhng chng ta khng quan tm nu chng ta
t trn (over-achieve) mc tiu li nhun ca chng ta l 250, cng khng lm chng ta
quan tm nu chng ta sn xut nhiu hn so vi 5 n v sn phm 2. V vy, c trng
lng v u tin ca hai mc tiu ny c thit lp l 0. Cc u tin cho 4 mc tiu
khc c phm vi t 1 n 3. ngha ca cc u tin khc nhau l th t m trong
cc mc tiu c hi lng. Ni cch khc, mc tiu u tin 1 phi c hi lng trc
mc tiu u tin 2, phi hi lng trc mc tiu u tin 3, v c nh vy. Trong v d
ny, chng ta mong mun u tin l lm chnh xc 14 n v sn phm 1, ri chng ta
mun m bo mc li nhun ti thiu ca chng ta l 250, sau chng ta mun c
gng m bo mc nhm (l hng) ti thiu ca chng ta l 5 sn phm 2.
Trong mi u tin, n c th gn cc trng s khc nhau cho cc mc tiu. iu ny
c th hin trong v d tip theo.
Cc du hiu hn ch (The constraint sign) : y l mt hp th xung c th
c s dng thay i kiu hn ch t "nh hn hoc bng"(<=) ; cho ti "bng"(=);
ti "ln hn hoc bng"(>=). Nh nu trn, mc tiu phi c du "=".
H s bn tay phi (Right-hand side coefficients) (RHS) : cc gi tr pha bn
tay phi ca nhng hn ch c nhp vo y. i vi kh khn (hn ch), l
nhng h s thng thng, trong khi i vi cc mc tiu, l nhng mc tiu c
thit lp.
GII PHP
(The Solution)
Mn hnh sau y hin th cc gii php tm tt (cc hot cnh mc tiu n
Simplex - n cng c sn hin th , nh l mt th cho cc vn 2 chiu).
TRANG 107
PHN MM NH LNG POMQM
Cc gii php ti u l sn xut 14 n v sn phm 1 v 2 n v sn phm 2.

u tin 1 (Priority 1) s t c, nu khng t c (non-achievement) th l 0,
trong khi chng ta khng t c u tin 2 v 3. Hy nh rng, d+ l s tin m
chng ta vt qu mc tiu, v d- l s tin m chng ta thiu t n (di mc
tiu). Cc phn tch hn ch (Constraint Analysis) ch ra rng chng ta s dng t
hn s gi lao ng (Labor hours) l 18 gi, s gi m chng ta c sn, dng chnh
xc s lng vt liu (Material) m chng ta c, t mc tiu s 3 chnh xc (t 14 n
v sp1), t di (under-achieved) li nhun Profit (mc tiu / hn ch s 4) l 2, v
t di kch thc hng lot kch thc c 1 l hng (mc tiu / hn ch s 5) l 3.
Mt th (khng c hin th) cng c sn nu s lng cc bin l 2.
V D 2 : S DNG TRNG S
(Example 2 : Using weights)

Chng ti sa i u tin mc tiu ca chng ti nh th hin trong v d sau
y. Thi gian ny chng ta cn p ng c mc li nhun Profit mc tiu cao
nht ca chng ta v mi th khc ch l th yu. Tuy nhin, chng ta cho gp i
trng s dt di (under-achieving) 5 n v sn phm 2 ca chng ta, so snh vi
thiu (b l) mc tiu ca chng ta l 14 sn phm 1 (ng vi b l mc tiu 14 sp).
Kt qu sau y : chng ta nn sn xut 12,5 n v sn phm 1 v 5 n v sn

phm 2. Th chng ta s t c u tin hng u ca chng ta, nhng b l u tin
th 2 Priority 2 (1,5 i din cho 14 - 12,5). Ch rng chng ta ch c 2 u tin.
Cc phn tch mc tiu / hn ch cho chng ta thy rng chng ta c 4,5 gi
cng lao ng (Labor hours) cn li (cha s dng, dng t hn s gi c sn),
dng chnh xc 30 kg vt liu (Material) m chng ta c, t di (under-achieved)
nhu cu sn phm 1 (Product 1 - Demand) l 1,5. t trn (over-achieved) mc tiu
li nhun Profit ca chng ta l 10, v p ng c mc tiu l lm c t nht
5 n v sn phm 2 chnh xc.
TRANG 108
PHN MM NH LNG POMQM
S NGUYN V LP TRNH S NGUYN HN HP

(Integer and Mixed Integer Programming)
Gn ging M un Linear Programming - Quy Hoch Tuyn Tnh
Bt k chng trnh tuyn tnh s nguyn hoc hn hp s nguyn u c xc

nh bi s lng ca cc bin v s lng cc hn ch. Nh vi lp trnh tuyn tnh,
khng tnh cc hn ch (Restrictions) khng tiu cc khng phi l s m (NonNegativity) nh l cc hn ch (Constraints)
(khng tnh cc hn ch khng m
nh l cc hn ch, cc hn ch phi l s m). Hu ht cc gi lp trnh tuyn tnh
ca sinh vin (tr Solver ca Excel) u gi nh rng cc bin phi l khng m.
Hy xem xt v d lp trnh s nguyn sau :
Maximize (lm cc i)
350 X1
+ 500 X2
X1
+ 1.5 X2
<= 15
+ 4 X2
>= 0
Subject to (theo)
- X1
X1, X2 >= 0
X1, X2 Integer (l s ngyn)
Cc thnh phn v nhp d liu gn ging nh lp trnh tuyn tnh. S khc bit l
mn hnh u vo c thm mt hng (row) xc nh kiu ca bin nh l : s nguyn
(integer), s thc (real), hoc 0 / 1 (tt c u l s dng).
TRANG 109
PHN MM NH LNG POMQM
Chc nng mc tiu (hm mc tiu) (Objective function) : vic la chn ti thiu
ha hoc ti a ha c thc hin theo cch thng thng ti thi im to ra vn ,
nhng n c th c thay i trn mn hnh d liu bng cch s dng cc ty chn
mc tiu trn cc d liu.
H s hm mc tiu (Objective function coefficients) : cc h s (thng gi l
cj ) c nhp vo l cc gi tr s.
H s hn ch (rng buc) (Constraint coefficients) : cc c quan chnh (phn
chnh) ca thng tin cha cc h s hn ch, thng c gi l aijs. Cc h s
ny c th l tch cc hay tiu cc (c th dng hoc m).
Cc du hiu hn ch (rng buc) (The constraint sign) : iu ny c th c
nhp vo mt trong hai cch. N cho php nhn phm [<] , phm [>] , hoc phm [=] .
Khi bn i n mt t bo () vi cc du hiu hn ch, mt mi tn th xung xut hin
trong v c th c s dng.
H s bn tay phi (Right-hand side coefficients) (RHS) : cc gi tr bn tay phi
ca cc hn ch c nhp vo y. y cng c gi l bis. Chng phi l
khng m.
Cc kiu bin (The variable type) : y l mt hp th xung s thay i kiu bin
t "s nguyn" ti "s thc". Bn c th thay i tt c cc bin cng mt lc bng
cch nhp vo ct ngoi cng bn tri "0/1". iu ny l rt hu ch cho cc vn
ngn sch vn.
S lp li ti a v mc ti a (chiu su) (Maximum number of iterations
and Maximum level (depth)) (s ln th v sai, th v sai) : nu bn nhn c mt
tin nhn v s lng lp li hoc chiu su ch khng phi l mt gii php, bn c
th lm tng nhng con s.
GII PHP
(The Solution)
Gii php c a ra bi mt mn hnh n gin vi cc bin v gi tr ca chng.
TRANG 110
PHN MM NH LNG POMQM
S LP I LP LI (S LN TH V SAI)
(Iterations)
S lp i lp li c th c tm thy trong mn hnh khc. Cc gii php LP
(Linear Programming Lp trnh tuyn tnh) ti vn ban u (nhn thy 1 s lp
i lp li, mc 0) c c X1 v X2 nh khng phi s nguyn (Non-Integers).
Chng ta phn nhnh trn X1 bng cch thm hn ch X1 < = 10. Cc gii php
LP cho vn ny c X1 l s nguyn nhng X2 khng l s nguyn (non-integer),
v vy chng ta phn nhnh cho X2 bng cch thm cc hn ch X2 < = 3. iu
ny mang li mt gii php s nguyn (t 3 s lp i lp li th ri sai ri li th cho
n ln 3 th cho cc kt qu X2 l s ngun).
Chng ta to ra cc nhnh khc
bng cch thm X2 > = 4 v iu ny mang li mt gii php tt hn s nguyn
(5.150 > 5.000). Chng ta i n nt ban u v to ra nhnh X1 > 11 , trong
mt gii php sn lng khng kh thi (Infeasible). V vy, chng ta c thc hin.
Mt th (khng c hin th) c sn cho m-un ny.
V D 2 : CHNG TRNH HN HP S NGUYN
(Example of a mixed integer program)

Hy xem xt v d sau y :
Maximize (lm cc i)
Subject to (chinh phc ti)
30x + 33y + 50z

23x+ 43y + 16z <= 1000
32x + 33y + 25z <= 2500
43x + 53y + 26z <= 1500
x, y, z >= 0
X Integer (s nguyn), z 0/1
Mt ln na, cc thnh phn ging ht nhau cho lp trnh tuyn tnh v s nguyn,
ngoi tr vic c thm mt dng thng tin m cn phi c cho ch ra cc kiu ca
bin (s thc, s nguyn, hoc 0/1).
TRANG 111
PHN MM NH LNG POMQM
GII PHP
(The Solution)
Cc kiu bin v gi tr ca chng c trnh by.
Ch : chng trnh tuyn tnh c th c nhp vo v c gii quyt nh

cc chng trnh hn hp s nguyn nhng cc bng s khc, v s lp li (th v sai)
ca lp trnh tuyn tnh s khng c sn.
QUN L HNG D TR - KIM K

(Inventory)
Nhng m hnh ny s dng cc bin khc ca M hnh (EOQ) s lng t hng
kinh t (Economic Order Quantity (EOQ) Model) trong th t xc nh th t hp
l, hoc s lng sn xut.
Bn cnh M hnh EOQ tiu chun (Standard EOQ
Model), chng ta s bao gm M hnh s lng sn xut kinh t (EPQ) (Economic
Production Quantity (EPQ) Model). i vi c hai m hnh EOQ v EPQ, chng ta
cho php tnh trng thiu hng (Shortages) c bao gm vo. Cui cng, chng ta
cho php gim gi s lng chic khu s lng (Quantity Discounts) cho cc m
hnh EOQ.
TRANG 112
PHN MM NH LNG POMQM
Mt kiu m hnh th hai l phn tch ABC.

Hai m hnh cui cng c s dng tnh ton nhng im t hng li
(Reorder Points ROP) (ti mt mc sn lng m ta thy cn phi t thm hng)
i vi phn phi bnh thng (phn phi chun) (Normal Distributions) v i vi
phn phi ring bit (phn phi ri rc) (Discrete Distributions).
M HNH KIU EOQ
(EOQ-Type Models)
Mn hnh sau y c cha mt v d m bao gm c cc d liu v gii php.
D LIU
(The Data)
Tc (t l) nhu cu mc cu (hng nm) (Demand Rate) (D) : t l nhu cu
hay mc s dng (Usage) th c nhp vo y. Thng thng, t l nhu cu ny
l mt t l hng nm , nhng n khng cn phi vy. S n v thi gian ca t l
nhu cu (D) ny phi ph hp vi s n v thi gian ca chi ph tn tr (Holding
Cost H), tc ph hp n v tnh (thng ra thng, nm ra nm, ect v.v...).
Chi ph t hng (Setup Cost) (Ordering Cost) (S) : y l chi ph c nh
(Fixed Cost) ca vic t mi n hng hoc chi ph ang lm (Making) cho mi
hot ng sn xut (cho mi l hng sn xut).
T l chi ph tn tr (Holding Cost Rate) (Holding Cost) (H) : y l chi ph ca
vic tr hng hoc thc hin mt n v hng tn kho cho mt giai on thi gian.
Chi ph ny hoc c cho nh l mt s tin c th (khi H l 1 s c th, khng thay
i) hoc c cho nh l mt t l phn trm (%) ca mc mc gi (khi H l 1 s
thay i nh t l % ca gi ) (t l chi ph tn tr v chi ph tn tr c nhp
liu chung vo mt ca H).
TRANG 113
PHN MM NH LNG POMQM
Ch : nu bn mun chi ph tn tr l mt t l phn trm ca chi ph n v

(Unit Cost), nhp vo mt du phn trm "%" sau con s. V d, "20" c ngha l 20
la, nhng "20%" c ngha l 20% ca chi ph n v (Unit Cost). Nu chi ph
tn tr l mt t l phn trm ca chi ph n v , bn phi nhp cc chi ph n v vo.
Chi ph n v n gi gi mua 1 n v (Unit Cost) (P) : iu ny i khi th
cn thit, nhng nhiu ln th khng, bi v EOQ l c lp vi chi ph n v .
im t hng li (Reorder Point) ROP :
hp ty chn trn cc d liu cho
php chng ta tnh ton im t hng li. Ba dng u vo c thm vo trong
cc trng hp ny. Chng ta phi hoc nhp vo mt t l nhu cu hng ngy tc
s dng hng ngy, t l mc s dng (Daily Demand Rate d ) hoc nhp vo
s ngy trong nm (Days Per Year D/d) (nu nhp c 2 cng lc th s gy ra li
nhp liu, v phn mm s t tnh ci cn li) do t l nhu cu hng ngy (d) c th
c tnh t t l nhu cu hng nm (Annual Demand Rate D) (d = D / D/d).
Ngoi ra, chng ta phi nhp vo s ngy cho thi gian ch (Lead Time LT).
S lng t hng (Order Quantity) (0 = EOQ) : trn cc d liu l mt thanh cun
/ hp kt hp cho php bn nhp vo mt gi tr cho s lng t hng. Nu bn
nhp vo mt s khc 0, th 2 thit lp kt qu s c hin th. Mt ct kt qu s
dng EOQ (Results using EOQ), trong khi ct khc s cho kt qu s dng s
lng t hng quy nh (Results using s lng m bn g vo).
GII PHP
(The Solution)
Mn hnh u ra xut hin trong mn hnh trc. Trong v d 1, chng ta gii
quyt c mt m hnh EOQ tiu chun v, ngoi ra, tm thy kt qu khi s dng mt
s lng t hng (S) l 20 n v. Cc kt qu m hnh nh sau :
S lng t hng ti u (Optimal Order Quantity) (Q*) : y l s lng t
hng kinh t nht. Nu khng c gim gi s lng (khng c chic khu s lng),
th l EOQ. Tuy nhin, khi gim gi s lng l c sn (nh trong v d 3), th y
hoc l EOQ hoc l im chit khu trn cc EOQ. Trong v d ny, s lng t
hng ti u l 16,33 n v cho mi n hng.
Mc tn kho ti a (Maximum Inventory Level) I max : n rt hu ch bit
s tin ln nht m s c trong hng tn kho. Trong m hnh EOQ tiu chun, th iu
ny ch n gin l s tin m ta t hng li, trong m hnh sn xut hay thiu
ht hng, th n l t (lng t hng t nht, tc mc tn kho ti a). Trong v d ny,
tn kho s khng bao gi vt qu 16,33 n v khi s dng EOQ (Q*) hoc s
khng bao gi vt qu 20 n v nu 20 l s lng t hng (S).
Mc tn kho trung bnh (Average Inventory Level) : nu khng c t hng li
(Back-orders), th hng tn kho trung bnh l mt na ca hng tn kho ti a I max .
Chi ph tn tr hng nm (Annual Holding Costs) da trn hng tn kho trung bnh.
n t hng mi nm (Orders Per Year) (Orders Per Period) (D/Q*) : khong
thi gian gi nh l mt nm, v s lng n t hng s c hin th. Trong v
d ny, n l 12,25 n hng i vi kt qu s dng EOQ (Results using EOQ)
v l 10 i vi kt qu s dng s lng t hng quy nh l 20 n v (Results
using 20).
TRANG 114
PHN MM NH LNG POMQM
Chi ph n v (Unit Costs) (P. D) : y l tng chi ph cho s n v t hng.

Trong nhiu trng hp, chi ph n v n (php nhn ring) s l 0, v do , tng
chi ph n v (PD) s l 0.
Tng chi ph (Total Costs) (TCmin) : y l tng chi ph ca c chi ph tn kho
v chi ph n v (n s cng thm P.D ; nu c P.D). Con s ny hu ch cho
cng vic kim tra trn cc vn gim gi (chic khu).
im t hng li (Reorder Point) (ROP) : y l sn phm ca t l nhu cu
hng ngy (d) v s ngy ch Lead Time (LT). Trong v d ny, chng ta c mt t
l nhu cu hng ngy l 0,8 n v v mt thi gian ch l 5 ngy, trong ti mt
lng tn kho m ta cn phi t hng li t thm hng (ROP) l 4 n v (khi tn
kho cn 4 n v th phi t thm hng).
Mt th ca chi ph so vi tn kho c hin th bn cnh ( tn kho v t
hng bng mt na tng chi ph, bng mc tn kho trung bnh Average Inventory
Level ).
V D 2 : HNG TN KHO VI SN XUT
(Example 2 : Inventory with Production)

Trong v d sau y, chng ti hin th d liu cho mt vn vi sn xut. D liu
bao gm cc thng s thng thng ca t l nhu cu, chi ph thit lp (t hng), chi ph
lu gi (tn tr), v chi ph n v . Chng ti cng ang hin th cc kt qu cho mt
chnh sch sn xut 300 n v mi ln hot ng. Trong v d ny, chng ti thit
lp cc chi ph tn tr (H) l 20% n gi (P) mi n v. Ngoi ra, trong m hnh
ny, chng ta c yu cu cho mt t l sn xut hng ngy (Daily Production Rate)
( p ) , hoc mt t l nhu cu hng ngy (d) hoc s ngy hot ng trong mt nm
(D/d). Ch trong v d ny chng ti thit lp cc ngy mi nm (D/d) l 250.
Chng trnh s tnh ton t l nhu cu hng ngy (d) l 10.000 / 250 (d = D / D/d).
Ngoi ra, chng ti c th nhp vo t l nhu cu hng ngy (d) tnh s ngy
mi nm (D/d).
TRANG 115
PHN MM NH LNG POMQM
Gii php ny xut hin bn cnh. T l nhu cu hng ngy (d) c tm thy
l 40 n v / ngy. Cc kt qu cn li l ging nh trong v d u tin. Ch rng
chi ph tn tr (H) c tnh l 18$ da trn 20% ca 90$ chi ph n v (P).
V D 3 :
GIM GI S LNG - CHIT KHU S LNG
(Example 3 : Quantity discounts)

Mt mn hnh gim gi s lng xut hin trong hnh minh ha sau y. Cc
thng tin thng thng c t u trang. Ngoi ra, s lng ca cc phm vi
gi c phi c cho ti thi im to ra vn .
TRANG 116
PHN MM NH LNG POMQM
Mt phn tch chi tit v s lng t hng v chi ph ti mi phm vi gi c

sn, nh hnh di y :
M HNH T HNG TR LI
(Back order Models)

Phn mm ny cng c kh nng tnh ton EOQ hoc m hnh sn xut vi n
t hng li (Back-orders). Nhng m hnh ny khng xut hin trong tt c cc sch
gio khoa, nn chng ti khng hin th chng trong hng dn s dng ny. Nu bn
c phn mm thit lp cho mt vn bn Render, th m hnh ny s khng hin th ln
trong trnh n ph (menu con).
PHN TCH ABC - PHN LOI A B C
(ABC Analysis)
Mc tiu ca phn tch ABC l xc nh cc mc quan trng nht c lu gi
trong hng tn kho. Tm quan trng c o bng khi lng la. Mt v d xut hin
di y cho mt vn vi 6 mc.
TRANG 117
PHN MM NH LNG POMQM
i vi mi mc, thng tin c nhp vo l :

Tn mc (Item name) : nh thng l, mt ci tn c th c nhp trn mi dng.
Nhu cu (Demand) : t l nhu cu cho mi mc l c cho.
Mc gi (Item price) : chi ph hoc gi c ca mi mc l c cho.
T l phn trm ca loi A v loi B (Percentage of A and B items) : trong v
d ny, chng ti mun 20% mc c chn l loi A, 30% mc l loi B. Sau khi
chng trnh sp xp th t (Sorts) cc mc bng khi lng la, th 20% ca 6 mc
s c phn loi nh l loi A (6 * 20% = 1,2 mc lm trn thnh 1 mc, tc ch c 1
mc c chn l loi A, vy sau khi chng trinh phn loi theo khi lng la v
sp xp th t t cao xung thp, ri tnh tch ly th ch c 1 mc u tin mi c
chn l loi A, loi A l loi c khi lng la ln nht trong cc phn loi) v tip
sau l 30% ca 6 mc (tc 1,8 mc lm trn thnh 2 mc) s c phn loi nh l
loi B. Cc mc cn li s c xem l loi C.
Ch rng cc mc c sp xp theo t l phn trm khi lng la ca

chng. V rng l, chng khng xut hin theo cng th t nh l trn mn hnh u
vo ban u. u ra tnh ton cho mi mc l :
Khi lng la (Dollar-volume) : y l nhu cu nhn vi gi cho mi mc.
T l phn trm khi lng la (Dollar-volume Percentage) : y l mc t l
khi lng ng la c chia bi : khi lng la / tng khi lng la * 100.
TRANG 118
PHN MM NH LNG POMQM
T l phn trm khi lng tch ly la (Cumulative Dollar-volume Percentage) :

y l mt tch ly (Running Total) khi lng la khi cc mc c sp xp th t
t khi lng la cao nht xung khi lng la thp nht.
Th loi phn loi, xp loi (Category) : y l phn loi nh c gii thch
trn.
T HNG LI I VI PHN PHI BNH THNG (PHN PHI CHUN)
(Reorder Points for the Normal distribution)

Di y l mn hnh gii php tnh ton cc c phiu (d tr) an ton (Safety
Stock SS) v im t hng li (ROP) cho cc trng hp nhu cu (Demand)
trong thi gian ch (LT) c cho bi mt phn phi bnh thng. Cc mn hnh
gii php bao gm u vo bn tri.
Nhu cu hng ngy (Daily Demand) :

thi gian ch (LT).
y l t l nhu cu hng ngy (d) trong
lch chun ca nhu cu (Demand Standard Deviation) (St ma ca d) :

y l lch tiu chun cho t l nhu cu hng ngy. Nu t l nhu cu hng ngy
l c nh th nhp vo mt lch chun l 0.
Mc phc v (Service Level) : y l t l phn trm nhu cu cn c p
ng (mc p ng nhu cu).
Thi gian ch trong ngy (Lead Time in days) (LT) : y l thi gian ch trong
ngy.
lch tiu chun ca thi gian ch (Lead Time standard deviation) (St ma
ca L) : y l lch chun ca thi gian ch. Nu thi gian ch c c nh
nhp 0 vo cho lch chun.
Ch : hin th cho Heizer / Render c da trn nhu cu thi gian ch c
cho v lch chun v ch c 3 u vo. Ni chung, s dng hin th trn, nu
vn c cho nhu cu thi gian ch v lch tiu chun th thit lp ngy thi gian
ch l 1 v lch chun thi gian ch l 0.
TRANG 119
PHN MM NH LNG POMQM
T HNG LI I VI PHN PHI RI RC
(Reorder Points for a Discrete distribution)
im t hng li w/o D tr an ton (Reorder Point w/o Safety Stock) : y

l im t hng li trc khi xem xt d tr an ton. Trong v d ny, k hoch ban
u ca chng ti l t hng li khi tn kho gim xung n 70. Nh vy, nu nhu
cu trong thi gian ch khng qu 70, chng ti s khng c bt k d tr an ton
(Stock-outs) no. Khi nhu cu ti a l 90 v im t hng li ca chng ti l 70
th d tr an ton ti a ca chng ti s l 20 n v .
Chi ph thc mi nm (Carrying cost per year) : y l chi ph thng thng ca
hng tn kho thc. Trong v d ny l $7 cho mi n v mi nm.
Chi ph hng d tr (Stock-out Cost) : y l chi ph cho mi n v khng c
kh nng p ng nhu cu. Trong trng hp ny l $18 mi ln m chng ta thiu
ht mt n v .
n t hng mi nm (Orders per year) : y l s ln mi nm chng ta thc
hin qu trnh t hng. Trong v d ny, chng ta t hng hai ln mt nm.
Phn phi xc sut (Probability distribution) : y l ct nhu cu thi gian ch
v xc sut ca chng.
Kt qu di y, ch ra rng chi ph d tr an ton ti thiu l 10 v do im
t hng li sa i l 70 gc cng thm 10, tng cng l 80 n v.
TRANG 120
PHN MM NH LNG POMQM
Khi im t hng ban u ca chng ta l 50 v nhu cu thi gian ch ca

chng ta khc nhau t 70 ti 110, chng ta cn ti a (90-70) 20 n v d tr an
ton, do kt qu cho ra l gi tr gia 0 v 20 n v. Trong 3 trng hp ny, chi
ph thc, chi ph hng d tr (Stock-out) v tng chi ph c tnh ton v hin th.
Cc tnh ton di y l kt qu tm tt.
HOCH NH CNG VIC CA HNG (DY CHUYN)

Job Shop Scheduling (Sequencing)
LCH TRNH SN XUT IU SN XUT
DY TRUYN NI TIP 1 MY 2 MY
See also : Assignment phn cng cng vic
M hnh lp k hoch cng vic ca hng c s dng gii quyt mt vn

cng vic ca hng 2 my.
i vi vn 1 my , cc phng php c sn l :
- Thi gian x l (ch bin) ngn nht - Shortest processing time.
- n trc phc v trc - First come first serve.
- Do ngy hoch nh k hn hoch nh (lp k hoch ng k hn)
Due date scheduling.
- Phng php ca Moore - gim thiu s lng cc cng vic cui cng (nm).
Moore - Minimize the number of late jobs.
- Lp ch trng - do ngy n hn (k hn) tr i thi gian ch bin.
Slack - Due date minus Processing Time.
- Lp ch trng / Hot ng - do qu trnh ch bin chia bng s hot ng.
Slack/Operation - Due process divided by # oper.
- Thi gian x l (ch bin) di nht - Longest processing time.
- T l quan trng - Critical ratio.
i vi lp lch trnh 2 my , phng php ca Johnson c s dng gim
thiu thi gian lm vic (Make-span nhp lm vic, thi gian lm vic ti thiu,
thi gian hon thnh ngn nht).
HOCH NH 1 MY
(One-Machine Scheduling)
Hy xem xt vn lp lch trnh 1 my sau y. 5 nhn vin c o to vn
hnh cc my mc khc nhau bi mt ngi hun luyn vin duy nht ch c th o
to mt ngi ti mt thi im (o to ni tip). Thi gian o to mi ngi khc
nhau v c cho trong bng i km cng vi ngy n hn v s lng ca cc
hot ng lin quan.
TRANG 121
PHN MM NH LNG POMQM

Job
(Cng vic)
Time
(Thi gian)
Due Date
(K hn)
Number of Operations
(S lng cc hot ng)
Janet
3 days
Barry
Alexis
13
Sammy
10
Lisa
15
Ernie
C hai : d liu v 1 gii php xut hin trong mn hnh k tip.
Phng php (quy tc u tin) : cc quy tc c sn cho lp k hoch bao gm :

1. SPT - Shortest processing time.
1. SPT - Thi gian x l (ch bin) ngn nht .
2. FCFS - First come first serve.
2. FCFS - n trc phc v trc.
3. Slack - Due date minus Processing Time.
3. Lp ch trng - Ngy n hn tr i thi gian ch bin.
4. Slack/Op (Operation) - Due process divided by # oper (Operation).
4. Lp ch trng / Hot ng - Do qu trnh chia bi s hot ng.
5. EDD - Earliest Due date.
5. EDD k hn c nht do ngy hoch nh (thi gian hon thnh sm nht).
6. Moore - Minimize the number of late jobs.
6. Phng php Moore - Gim thiu s lng cc cng vic cui nm.
7. LPT - Longest processing times.
7. Thi gian x l (thc hin) di nht .
8. Crit rat - Due date today / Processing Time (Critical ratio).
8. T l quan trng (Ngy n hn tr i ngy hm nay) / thi gian thc hin.
TRANG 122
PHN MM NH LNG POMQM
Cc d liu c nhp vo l :
S ngy bt u Starting Day Number (Starting Day Number / Starting Time) :
S ngy m bt u lm vic ngy th bao nhiu bt u lm / hoc thi gian m
bt u khi cng (khng tnh s lng thi gian thc hin cng vic) : mt ty chn
ngy bt u c th c cho. V d 2 s hin th vic s dng ty chn ny.
S lng ngy tip nhn (Date Received) (s lng ngy tip nhn cng vic
trc khi thc hin n) : n c th lit k danh sch s ngy mi cng vic c tip
nhn. Thng tin ny s c s dng trong lch trnh khi phng php FCFS - n
trc phc v trc c s dng. Nu ngy nhn c cho th chng s c s
dng trong vic tnh ton dng thi gian (Flow Time) (xem v d 2). Ngy tip nhn
phi nh hn hoc bng ngy bt u (Date Received < = Starting Day Number),
v ngc li. l tt c cc cng vic phi c nhn trc ngy bt u.
Tn cng vic (Job Names) : tn c th c nhp cho tng cng vic.
Tn my (Machine Name) : cc t Machine1 My1", Machine2 My2", ect v.v...
trn cng ca ct (trong lch trnh 2 my) c th c thay i cung cp tn ca
cc loi my. Trong v d ny, qu trnh c i tn thnh "o to" (Training).
Thi gian x l (ch bin) (Processing Time) : s lng thi gian m mi cng
vic s phi mt (lm) trn mi my c nhp vo trong ct c nhn l Tn My
Machine Name.
K hn giao hng (Due Date) : trong mt s trng hp k hn giao hng c
s dng. Chng c nhp y.
S lng ca hot ng (Number of Operations) (# Opns) :
trong trnh t s
dng lp ch trng (Slack) cho mi quy tc hot ng, n l cn thit cho mt
s lng hot ng tch cc. Ngoi phng php Slack/Op-(Operation) - Due
Process Divided By # Oper (Operation) th i vi bt k phng php no khc, ct
ny c th c b qua.
V D 1 : THI GIAN X L (CH BIN) NGN NHT
(Example 1 : Shortest processing time)

Cc kt qu ph thuc vo quy tc no c la chn. Trong v d u tin ca
chng ti, chng ti chn SPT - Thi gian x l ngn nht, nhng khi i qua cc v
d tt c cc thng tin s c hin th, c gii thch. u ra cho v d u tin ca
chng ti c hin th trong mn hnh trc.
Th t cng vic (Job Order) : mt Ct (Order) c hin th cho thy khi mi
ngi (mi cng vic) s c o to (c ch bin). V d 1, Ct cho thy rng
Janet s l th 2, Barry th 4, Alexis 3, Sammy 5, Lisa 6, v Ernie s l u tin.
Trnh t ni tip (Sequence) : cng mt trnh t c hin th nhng trong mt
cch khc ca s khc ( di cng) ca mn hnh. Trong v d ny, trnh t l Ernie
tip theo Janet, Alexis, Barry, Sammy, v Lisa.
Dng thi gian (Flow Time) :
thi gian m mi cng vic kt thc c cho
trong mt ct ca dng thi gian. Trong v d ny, Ernie l ngi u tin (first) c
o to v kt thc sau khi thi gian x l l 2 ngy. Janet l c o to th hai
(second) v kt thc sau hn 3 ngy na ti thi im 5. Cng vic cui cng thc
hin (sixthth 6), l Lisa, kt thc sau 30 ngy.
TRANG 123
PHN MM NH LNG POMQM
Thi gian hon thnh (Completion Time) : nu ngy bt u (Starting day number)
khng phi l 0, mt ct thi gian hon thnh c a ra bao gm ngy bt u (xem
v d 8).
Tnh trng chm chp hoc s chm tr (Tardiness or Lateness) (Late) : nu
k hn giao hng (Due Dates) c cho, s khc bit gia dng thi gian v k hn
ny c hin th (trn mn hnh hin th mu ). S khc bit ny s khng bao gi
di 0. Ni chung khng c iu g l sm trong vic lp k hoch.
Tng s (Totals) : i vi c hai : dng thi gian v s chm tr, tng s c
tnh ton v hin th.
Trung bnh (Averages) : c lin quan hn so vi tng s l mc trung bnh.
Dng thi gian (Flow Time) trung bnh i din cho tc m cng vic li h
thng sau khi chng c nhp vo. Tnh trng chm chp Lateness trung bnh
(S chm tr Tardiness trung bnh) i din cho lch trnh xu thc hin vi s tn
trng ti k hn giao hng ha hn ca chng ta nh th no.
Ch : vic chm tr trung bnh c tnh ton da trn tt c cc cng vic,
khng phi ch cc cng vic tr. Trong v d ny, n l 34/6, mc d Ernie c o
to v thi gian.
S lng trung bnh ca cng vic trong h thng (Average Number of Jobs in
the system) : iu ny c tnh l tng dng thi gian (vo hoc sau ngy bt u
Starting Day Number) c chia bi dng thi gian ti a.
BIU GANTT
(Gantt Chart)
Mt biu Gantt minh ha lch trnh trn my l c sn, nh thy trong mn
hnh sau y :
TM TT THNG TIN
(Summary)
Mt trong cc ca s u ra cho lch trnh 1 my l mt kt qu tm tt cho tt c
cc phng php nh c hin th di y.
TRANG 124
PHN MM NH LNG POMQM
V D 2 : N TRC C PHC V TRC
(Example 2 : First come first served)

Trong v d ny, chng ti thay i quy tc ca chng ti l FCFS - n trc
c phc v trc v ngoi ra chng ti t ngy nhn (Date Received) cho
tng cng vic v ngy bt u l 100 ( 99 cng c, v phi t 99 tr ln. v d
1 phi t 1 tr ln ).
Nhng kt qu bn di.
TRANG 125
PHN MM NH LNG POMQM
K t khi ty chn FCFS c chn, chng trnh s sp xp cng vic theo

ngy nhn.
Ch rng c thm mt ct kt qu c tn l "Thi gian hon thnh
(Completion Time). y l dng thi gian cng vi ngy bt u tr i 1. V d,
cng vic ca Lisa bt u vo u ngy 100, c lm vic trong 9 ngy v do
c hon tt vo cui ngy 108. Thi gian hon thnh l vo cui ngy hm .
V D 3 : LCH TRNH LP CH TRNG (HOCH NH THEO S CHNG)
(Example 3 : Schedule according to slack)

Lp ch trng (Slack) c nh ngha l ngy o hn (k hn giao hng) tr i
thi gian cn thit x l mt cng vic. Trong th t s dng slack, ngy n
hn phi c cho.
Ct lp ch trng (Slack) khng xut hin trc nhng lm by gi. l s

khc bit gia cc ct k hn giao hng (Due Date) v ct "o to (Production
Time). Trong v d, Janet phi c o to vo ngy 4 nhng phi mt 3 ngy
o to, v vy l mt ngy ca Slack (lp ch trng - thp im). Cc cng vic
c ln lch theo th t tng dn lp ch trng (Slack). Janet c t nht v l d
kin u tin, trong khi Alexis c nhiu nht (9) v l d kin cui cng. Gii php ny
xut hin di y.
TRANG 126
PHN MM NH LNG POMQM
V D 4 : THI GIAN LP CH TRNG CHO MI HOT NG

THI GIAN CHO MI HOT NG CHNG
THI GIAN THAO TC CHNG (NGH X HI)
(Example 4 : Slack time per operation)

Chng ti s dng d liu trong ct s cc hot ng (Operations). u ra
(khng c hin th) cha mt ct mi c tiu Lp ch trng / Hot ng
(Slack/Operation) (Slack Per), c to ra bng cch chia cc Slack bng s lng
ca cc hot ng (Number Of Operations) (# Opns) => (Slack / # Opns = ?). Trong
v d, 1 ngy ca lp ch trng (Slack) cho cng vic 1 c chia bi 2 hot ng,
nng sut mt Slack mi gi tr hot ng l 0,5 (=1/2=0,5). Cng vic c ln k
hoch theo th t tng dn lp ch trng cho mi hot ng. V vy, Janet l u
tin (0,5) v Alexis l sau (=9/1=9), Ties c chia ty tin.
V D 5 : HOCH NH K HN GIAO HNG
Example 5 : EDD - Earliest Due date (Due date scheduling)

Janet l 1 k hn u tin v l d kin u tin, trong khi Lisa l mt k hn
cui cng v l d kin cui cng.
V D 6 : PHNG PHP MOORE
(Example 6 : Moores method)

Phng php Moore gim thiu s lng cc cng vic cui nm. Trong v d th
hin bn cnh, phng php ca Moore dn n trnh t : Janet, Ernie, Lisa, Sammy,
Alexis, v Barry, trong c ba cng vic cui. Khng c lch trnh c t hn ba cng
vic cui, nh c th c nhn thy trong bng tm tt c hin th cui v d 1.
TRANG 127
PHN MM NH LNG POMQM
V D 7 : THI GIAN X L (CH BIN) DI NHT
(Example 7 : Longest processing time)

Phng php LPT lch trnh cng vic t di n ngn nht. iu ny thng l
cch ti t nht thc hin lp k hoch. Trong v d (khng c hin th), trnh t
sn lng LPT l : Lisa, Sammy, Barry, Alexis, Janet, Ernie, l i din chnh xc
vi lch trnh SPT ca kha hc. Lch trnh ny c mt dng thi gian trung bnh 21,5.
Khng c lch trnh c mt dng thi gian trung bnh ln hn. Chng trnh ny c
4,3 cng vic trong h thng trung bnh. Khng c lch trnh c mt s lng ln trung
bnh ca cng vic trong h thng.
V D 8 : T L QUAN TRNG (T L PH BNH)
(Example 8 : Critical ratio)

T l quan trng c nh ngha l k hn giao hng tr i ngy hm nay ri chia
cho thi gian x l (Due Date Today) / Processing Time. y l v d u tin
m chng ti s dng s ngy bt u (Starting Day Number) trn cc d liu.
Cng vic c ln k hoch trong th t tng dn t l quan trng (Critical ratio).
Trong v d ny, lch trnh l Janet, Barry, Sammy, Ernie, Lisa, Alexis. Lu trong mn
hnh c thm mt ct sn lng u ra l thi gian hon thnh (Completion Time).
Bi v cng vic khng bt u vo thi im 0, dng thi gian v thi gian hon
thnh l khc nhau. V d, Janet l cng vic u tin c thc hin v bt u
ngy hm nay vo ngy th 3. K t khi phi mt 3 ngy, chng ti lm vic vi Janet
trong 3, 4, 5 ngy ; m tr thnh thi gian hon thnh. Cng vic l mt ngy cui nm.
TRANG 128
PHN MM NH LNG POMQM
HOCH NH 2 MY
(Two Machine Scheduling)

Hy xem xt cc vn sau y. Mt trung tm nh my cn g v in cc cng
vic cho 7 khch hng. Chiu di ca thi gian m mi cng vic i hi phi sa
cha cui cng (nh my) v in n s c hin th trong bng sau y. Mi cng
vic u tin phi nh my xong trc khi n c th c sao li (Duplicating).
Customer
(Khch hng)
Typing
(nh my)
Duplicating
(Sao li)
20 minutes
19 minutes
Deb
43
27
Leah
37
38
Dara
62
11
Art
80
52
Sharon
12
36
Rivka
25
41
Harry
Trong mn hnh k tip, chng ti chng minh cc vn 2 my. Phng php

ca Johnson c s dng, th t, v trnh t c lit k nh sau.
Ngoi ra, thi gian m ti mi cng vic kt thc trn mi my s c hin th.
Ln nht ca tt c nhng thi gian ny l make-span (thi gian hon thnh cng vic)
hoc thi gian m ti tt c cc cng vic c hon thnh, n c hin th pha
di. Trong v d ny, n s mt 290 pht hon tt cng vic.
TRANG 129
PHN MM NH LNG POMQM
CC BC CA PHNG PHP JOHNSON
(Johnsons Method Steps)

Mt u ra th cp cho m hnh con ny l mn hnh hin th th t trong
cng vic c la chn theo phng php ca Johnson. iu ny c hin th trong
mn hnh sau y.
Thi gian nh nht trong s 14 ln l 11 pht cho Dara vo sao li (Duplicating).

V vy, Dara c ln k hoch cui cng nht k t khi sao li l my th hai. Thi
gian nh nht tip theo trong s tt c cc khch hng ngoi tr Dara l 12 cho
Sharon vo nh my (Typing). K t khi nh my (Typing) l qu trnh u tin,
Sharon l d kin u tin. Phng php tip tc tm ra thi gian nh nht ca tt c
cc khch hng t xut v lch trnh ca khch hng cng sm cng tt nu thi gian
l trn nh my (Typing) v cng mun cng tt nu thi gian l sao li (Duplicating).
Mt biu Gantt 2 my c th c hin th cng nh hnh di y. Nu tn
ca cng vic l qu di cho thanh trong biu , th n s c rt ngn. V d, xem
Sharon trn my 1.
TRANG 130
PHN MM NH LNG POMQM
CCH B TR PHNG TIN SN XUT

(Layout)
B TR THEO QU TRNH THEO B PHN SN XUT
See also : Assembly line balancing cn bng dy chuyn
M hnh c s b tr c s dng t cc b phn cc phng ban

(Departments) trong phng ln (Rooms) theo th t gim thiu tng s
khong cch (Distance) di chuyn nh l mt chc nng : khong cch gia cc
phng ln (Distances between the Rooms) v dng lu lng di chuyn gia cc
phng ban (Flow between Departments). Trong mt s trng hp, n l cn thit
c nh (Fix Certain) cc b phn phng ban ti nhng v tr c t trong
phng ln c th . Khong cch gia cc phng c th hoc khng c i xng
(Symmetric / Not Symmetric), thng thng l vy, nhng iu ny l khng cn thit.
D LIU
(Data)
Khun kh cho vic b tr c cho bi s lng ca cc phng ban b phn
(Departments), hoc s lng phng ln (Rooms) m chng ti gi nh l nh
nhau, khi m mi b phn phi c giao cho mt v ch mt phng.
Cc d liu c bn sau bao gm hai bng s lng : mt cho dng chy dng
lu lng di chuyn (Flow Table) v mt cho khong cch di chuyn (Distance Table).
TRANG 131
PHN MM NH LNG POMQM
Phng php (Method) : c 2 phng php c sn. Phng php mc nh l lit

k r rng (Explicit Enumeration). iu ny c m bo tm ra gii php ti u.
Tht khng may, nu kch thc vn qu ln, phng php ny s mt qu nhiu
thi gian. Mt phng php th hai, so snh cp (Pairwise Comparison) c sn.
Tht khng may, phng php ny khng c bo m lun lun tm thy cch b
tr tt nht.
Dng lu lng di chuyn lin tc (InterDepartmental Flows) : s lng cc
chuyn i t mt b phn ti cc ch nh khc trong mt bng gi l Ma trn dng
chy (Flow Matrix).
Ma trn khong cch (Distance Matrix) : khong cch gia cc phng c nhp
vo trong bng ny. in hnh l ma trn khong cch s l i xng (Symmetric).
S la chn c thc hin vo u ca cc m-un. l, khong cch t phng
i n phng j , cng nh khong cch t phng j n phng i.
Mt mu thit lp d liu xut hin trong mn hnh trc. Ch trong v d ny
rng khong cch (Distances) l i xng (Symmetric).
GII PHP
(Solution)
Gii php ch n gin l giao cc b phn ti cc phng thch hp.
Tng khon di chuyn (Total Movement) tng s cc di chuyn b phn, tng s
cc khon di chuyn ca cc b phn cng c ghi nhn (13.000) mc ti thiu.
Thit k t phng (Room Assignments) : bn phi mi dng b phn phng

ban (Department Row) s xut hin Phng m cc b phn nn c t vo.
Trong v d ca chng ti, Vt liu (Materials) nn c t trong phng 2, My
hn (Welding) trong phng 1, ect v.v...
Tng khong di chuyn (Total Movement) = Total (Trips * Distance) : tng s
lng cc chuyn i ca sn phm (Trips, Flows) nhn vi cc khong cch
(Distances) c lit k phn u. y l nhng g chng ti ang c gng gim
thiu. Ch rng trong v d ca chng ti, tng khong di chuyn ti thiu l 13.000.
TRANG 132
PHN MM NH LNG POMQM
Tng khong di chuyn (Total Movement) c th hin th thnh php nhn n

l (Trips * Distance) :
dng lu lng di chuyn (Flows) c th i thnh cc
chuyn i (Trips) ca sn phm,
khong cch (Distance) t phng ti phng
(Room-to-Room) i thnh dng di chuyn (Flows) t qu trnh ti qu trnh
(Process-to-Process). iu ny c th hin (mt phn) trong mn hnh sau.
TRANG 133
PHN MM NH LNG POMQM
Trong th t chng minh Phng php so snh cp (Pairwise Comparison),

chng ti lm ging v d, nhng thay i phng php v cch gii quyt n.
Cc kt qu c hin th di y. Ch rng, qu tht vy, so snh cp
(Pairwise Comparison) khng tm ra gii php ti u khi phong tro lu lng
di chuyn, khong di chuyn (Movement) tnh theo phng php so snh cp.
Kt qu 15.200 l ln hn so vi chuyn ng lu lng di chuyn tnh theo
phng php iu tra r rng (Explicit Enumeration).
C NH CC B PHN TRONG CC PHNG C TH

NHNG BAN C NH TRONG NHNG PHNG C TH
SA CHA THIT T PHNG BAN TRONG PHNG C TH
(Fixing Departments in Specific Rooms)

Nu tn phng xut hin trong Ct c nhn "C nh Phng" (Fixed Room), b
phn s c c nh trong cn phng . Gi s rng trong v d trc y ca
chng ti, chng ti c yu cu phi c Vt liu (Materials) c t trong phng 1.
Th thc hin vic ny, chng ta t phng 1 (Room 1) trong dng ca Vt
liu (Materials), trong Ct "C nh Phng" (Fixed Room) bng cch s dng hp
th xung v chn Room 1.
TRANG 134
PHN MM NH LNG POMQM
Gii php theo sau. Cc thit k t phng (Room Assignments) th tt nhin

s khc nhau, v tng s lu lng di chuyn (Total Movement) th tt nhin l ln
hn so vi cc gii php ti u cho cc vn khng hn ch.
NG CONG HC
Learning (Experience) Curves
S TNG TRI KINH NGHIM
Hai m hnh c sn cho ng cong hc, trong m hnh u tin, n c gi

nh rng h s hc (Learning Coefficient) l c bit n, trong m hnh th hai,
n c gi nh rng thi gian sn xut (Production Time) cho 2 n v (Two Units)
l c bit n, v h s ng cong hc (Learning Curve Coefficient) c
tnh ton da trn chng. Trong c 2 trng hp, chng ta c th tm thy thi gian
sn xut (Production Time) cho cc n v (Units) t 1 n 1 s lng quy nh
v thi gian sn xut tch ly (Cumulative Time) cho cc n v ny. Ngoi ra, m
hnh ng cong hc c th c v th.
D LIU
(The Data)
Hy xem xt mt tnh hung m trong n v 1 phi mt 10 gi.
Unit number of Base Unit
: l 1 ( L 1 , t 1 , ... )
Labor Time for Base Unit, Y1 : l 10 gi.
H s hc (Learning Coefficient) l 90%.
V chng ti quan tm cho ti 20 n v u tin. Tc s mc ca n v
cui cng Number of The Last Unit, N : l n v th 20.
Thi gian thc hin n v cui cng (Time for Last Unit) : l 6,3422 gi.
Sau y l mt mn hnh c cha c d liu v 1 dng u ra (ng ra) chnh :
TRANG 135
PHN MM NH LNG POMQM
S n v ca n v c s (Unit number of Base Unit) : iu ny thng l 1

(1 gi , 1 t , 1 l , ... ) nh trong v d ca chng ti, nhng n c th c thit lp
ti 1 s bt k.
Thi gian lao ng cho n v c s (Labor Time for Base Unit) : y l chiu
di ca thi gian m n cn sn xut s lng n v theo quy nh trn. Trong
v d ca chng ti, l 10 gi.
S ca n v cui cng (Number of the Last Unit) : y l s mc (s th t)
ca n v cui cng m s c hin th v / hoc s dng cho tnh ton. Trong
v d, chng ti quan tm cho ti n v th 20 hoc 20 n v u tin.
H s ng cong hc (Learning Curve Coefficient) : y l mt s gia 0 v 1.
y l t l phn trm ca thi gian ca n v u tin m n phi mt lm n
v th hai v cng l t l phn trm ca thi gian ca n v th hai m n phi
mt lm n v th 3, ri th 4. H s ng cong hc ch c nhp vo m
hnh u tin (Display Times Given A Coefficient). M hnh th hai (Find Learning
Coefficient Given 2 Times) s xc nh h s ng cong hc da trn d liu
mc vo tip theo.
Thi gian thc hin n v cui (Time for Last Unit) (Time to make Last Unit) :
khng c hin th trn mn hnh ny, nhng c hin th trong v d tip theo,
nhng mnh cui cng ca thng tin ca m hnh th hai l thi gian phi mt
sn xut n v cui cng ch khng phi l h s ng cong hc. Da trn mnh
thng tin ny, h s ng cong hc s c xc nh (xem v d 2).
V D 1 : THI GIAN TNH TON V THI GIAN TCH LY
(Example 1 : Computing times and Cumulative times)

Display times given a coefficient .
Display times given a learning.
Hin th thi gian c cho 1 h s.
Vn mu xut hin trong mn hnh trc. 4 dng d liu vo ch ra rng n
v u tin (n v th nht) mt 10 gi sn xut, n v cui cng l n v
th 20, v h s hc l 90%. l s gim trong thi gian l nh vy , vi
gp i n v s, thi gian l 90% ca thi gian trc .
Gii php trong mn hnh trc m n v cui cng (s 20) mt 6,3422 gi.
Mt bng b sung l thi gian v thi gian tch ly c th c hin th. u
ra bao gm 3 ct.
TRANG 136
PHN MM NH LNG POMQM
S n v s th t ca cc n v (Unit number) : iu ny chy t 1 n

n v cui cng, m trong v d ca chng ti l 20. Hai ct b sung nh sau :
Thi gian sn xut (Production Time) - thi gian sn xut mt n v duy
nht (Time To Produce A Single Unit) : ct ny cha thi gian sn xut mt
n v . V d, phi mt 10 gi sn xut n v 1 (theo quy nh ca u vo) ;
9 gi sn xut n v 2 (nh tnh ton bng cch s dng h s hc) ; 8,1 gi
sn xut n v 4 (90% ca 9 gi) ; 7,29 gi sn xut n v 8, v c nh vy.
Nhng con s th v l nhng con s m khng thuc quyn hn ca 2. V d,
phi mt 6,3422 gi sn xut n v th 20.
Thi gian tch ly (Cumulative Time) : ct cui cng cha s lng thi gian
sn xut tt c cc n v t ti v bao gm c s lng n v (tch ly). R
rng, phi mt 10 gi sn xut n v 1. Phi mt 19 gi sn xut c n v
1 v 2 ; 35,5621 gi sn xut 4 n v u tin v 146,0776 gi sn xut 20
n v u tin. Mt th ca thi gian sn xut cc n v c th c hin th.
Thanh cun c th c s dng xem hiu ng ca h s hc trn th.
TRANG 137
PHN MM NH LNG POMQM
V D 2 : TM H S NG CONG HC
(Example 2 : Finding the learning curve coefficient)

Find learning coefficient given 2 times.
Tm h s hc c cho 2 ln.
Sau y l mn hnh gii php cho mt v d ca m hnh th hai. Trong trng
hp ny, chng ta bit rng n v th 4 mt 73 gi v n v th 37 mt 68 gi.
Chng trnh tnh ton, da trn hai ln chng, h s ng cong hc l 0,9781.
LP TRNH TUYN TNH

(Linear Programming)
Quy hoch tuyn tnh theo ng thng
Ging M un Integer & Mixed Integer Programming - Quy Hoch S Nguyn
Bt k cc chng trnh tuyn tnh u c xc nh bi s lng ca cc bin

v s lng cc hn ch. Khng tnh cc hn ch (Restrictions) khng tiu cc
khng m (Non-Negativity) nh l hn ch (Constraints). Hu ht cc gi
chng trnh tuyn tnh (nhng khng phi Solver ca Excel) u gi nh m ni
cch khc cc bin phi l khng m.
Hy xem xt v d sau y vi 2 hn ch v 2 bin :
Maximize (Lm cc i)
Subject to (theo iu kin)
3x + 3y
3x + 4y
6x + 4y
<= 14
<= 15
(Labor hours - nhng gi lao ng)

(Lbs material - Vt liu Lbs)
x, y >= 0
TRANG 138
PHN MM NH LNG POMQM
Mn hnh d liu cho vic ny xut hin bn cnh. Chng ti cho thy ton b
mn hnh chng ti c th im (ch) ra rng mt cng c cc bc (Step) xut
hin ngay by gi trn thanh cng c trc cng c gii quyt (Solve). Ngoi
ra, cc bc (Step) c kch hot trong trnh n File.
Chc nng mc tiu (hm mc tiu) (Objective Function) :

vic la chn ti
thiu ha hoc ti a ha c thc hin theo cch thng thng ti thi im to ra
vn , nhng n c th c thay i trn mn hnh d liu bng cch s dng
cc ty chn mc tiu trn cc d liu.
H s hm mc tiu (Objective Function Coefficients) : cc h s chi ph / li
nhun ( thng gi l cj ) c nhp vo l cc gi tr s. Cc h s ny c th l
tch cc hay tiu cc (dng hoc m).
H s hn ch (rng buc) (Constraint Coefficients) : cc phn chnh ca
thng tin cha cc h s hn ch, thng c gi l aijs. Cc h s ny c th l
tch cc hay tiu cc.
H s bn tay phi (Right-hand side Coefficients) (RHS) : cc gi tr trn bn
phi bn tay ca nhng hn ch c nhp vo y. y cng c gi l bis.
Chng phi l khng m.
Cc du hiu rng buc (The Constraint Sign) : iu ny c th c nhp vo
mt trong hai cch. N cho php nhn phm [<] , phm [>] , hoc phm [=]. Ngoi ra,
khi bn i n mt t bo () vi cc du hiu hn ch, mt mi tn th xung xut hin
trong , nh c hin th trong mn hnh sau y trong 2 hn ch trong ct vi cc
du hiu hn ch.
TRANG 139
PHN MM NH LNG POMQM
Bn c th bm vo mi tn ang mang li trong mt hp th xung nh sau :
Hnh thc phng trnh (Equation Form) : Ct ngoi cng pha bn phi hin
th cc hnh thc phng trnh ca hn ch v khng th chnh sa trc tip, nhng
cc thay i c th l cc h s, tn ct, du hiu hoc thay i bn tay phi (RHS).
GII PHP
(The Solution)
Sau y l gii php cho v d ca chng ti. Xin lu rng mn hnh hin th
thay i phn no ty chn ca sch gio khoa chn trong tr gip thng tin
ngi s dng.
Gi tr ti u cho cc bin (Optimal values for The Variables) : bn di mi

ct, cc gi tr ti u cho cc bin c a ra. Trong v d ny, X nn l 0,3333
v Y nn l 3,25.
Chi ph / Li nhun ti u (Optimal Cost / Profit) :
gc di bn phi ca
bng, li nhun ti a hoc chi ph ti thiu c a ra. Trong v d ny, li nhun
ti a l $10,75.
Gi en Gi kp , Gi bng (Shadow Prices) : cc Gi bng Gi kp (Dual)
xut hin bn phi ca mi hn ch. Trong v d ny, chng ti s tr hn 0,5 cho
hn 1 n v ca ti nguyn 1 v tr hn 0,25 cho hn 1 n v ca ti nguyn 2.
TRANG 140
PHN MM NH LNG POMQM
TH
(The graph)
Mt trong cc hin th u ra khc l mt th nh c hin th trong mn hnh
sau y. Cc khu vc kh thi c t. Bn phi l mt bng ca tt c cc im gc
kh thi v gi tr ca hm mc tiu (Z) ti cc im . Ngoi ra, cc rng buc v
hm mc tiu c th c nh du mu bng cch nhp vo nt ty chn trn
bn phi theo "Hn ch hin th .
BNG PHM VI
(Table of Ranges)
Ngoi vic lit k cc gi tr, chng ti cung cp thm thng tin v cc bin.
Cc gii thch ca cc thng tin b sung c li cho sch gio khoa ca bn.
Trong v d, bn c th thy chi ph gim, h s gi tr mc tiu nguyn, v gii hn
di, gii hn trn (phm vi) trn ht cc gii php s l nh nhau. l, cc bin
s lm trn cng mt gi tr nh nhau l 0,3333 v 3,25 ; ch c gi tr hm mc
tiu (li nhun hoc chi ph) s thay i.
Ch : mt s vn bn v cc chng trnh khc cho php gim (Decrease)
v tng (Increase) (t gi tr ban u) ch khng phi l gii hn trn v di
trong cc (phm vi).
TRANG 141
PHN MM NH LNG POMQM
NHNG S LP I LP LI
(Iterations)
S lp i lp li (Iterations) cng c th c hin th.
thay i theo cc sch gio khoa chn.
Phong cch hot cnh
DANH SCH GII PHP
(Solution List)
N cng c th hin th gii php trong mt danh sch, nh sau :
VN KP
(The dual problem)

Mt ca s kt qu khc hin th cc vn kp.
TRANG 142
PHN MM NH LNG POMQM
CC BC
(Stepping) => xem cc kt qu bng cng c Cc Bc (Step).

Nu bn nhn vo mn hnh u tin trn cng ca phn ny, bn s nhn
thy rng bn tri ca cng c gii quyt (Solve) mt cng c cc bc (Step)
xut hin.
Trong khi s lp i lp li (Iterations) c sn trong mn hnh u ra lp i lp
li (Iterations), n cng c th bc qua v nhn thy mt s lp i lp li ti mt
thi im. u im chnh ca Cc Bc (Stepping) l bn c th chn cc bin
ang nhp. Chng ti c p Cc Bc (Step) v mn hnh xut hin nh sau :
(hin th thay i theo vn bn thit lp trong tr gip thng tin ngi s dng).
Cc phn mm to ra mt hot cnh n (Simplex n) thm 2 bin

chng (Slack - Chng). Ct u tin c nh du khi n c ng gp li nhun
cao nht. Nu bn mun ct ny, bm cng c Bc (Step). Nu bn mun thay
i cc ct tr, ch cn nhp chut vo mt ct khc (chn ct cn xem) v sau
nhn Step. Sau mt s lp i lp li mn hnh xut hin nh di y.
TRANG 143
PHN MM NH LNG POMQM
Khi cc gii php ti u c tm thy, mt tin nhn c hiu lc s xut

hin trong thanh hng dn nh hnh di y. Khi phn mm cho php bn lp li
ngay c sau khi tm thy cc gii php ti u, khi bn lm xong, bn phi nhn
vo cng c Finish (xong , kt thc).
S NH V V TR A IM
(Location)
C 4 m hnh c s v tr. M-un u tin l cht lng tiu chun / h thng
trng s ch quan nh tnh (Standard Qualitative / Subjective Weighting System)
(s dng i vi nh gi cc yu t - Factor Rating).
Mt s yu t (Factors)
c xc nh c xem xt l quan trng (Important) i vi cc quyt nh v tr.
Trng s (Weights) c giao cho cc yu t ny, v cc im s (Scores) cho cc
yu t ny c xc nh i vi cc trang web (cc a ch , a im) c th khc
nhau. Chng trnh tnh tng trng s ca cc im s (v xc nh cc a
ch v tr vi im s cao nht).
Phng php th hai v th ba l phng php nh lng i vi v tr trn
mt dng mt ng thng (1 chiu) hoc mt mt phng (2 chiu). Trong
trng hp 1 chiu (One-Dimensional), s phi hp ta (Coordinate - Coord)
hoc s ng ph (s v tr) phi c cho. Trong trng hp 2 chiu, c ta
ngang v ta thng ng phi c cho. Trong c hai trng hp, chng trnh
s c mt trng s mc nh ca 1 chuyn i mi v tr, nhng iu ny c th
c thay i phn nh s lng khc nhau ca cc chuyn i (Trips) hoc
trng s khc nhau ca cc vt liu (Materials).
Chng trnh s tm thy v tr
trung bnh (Median Location) v v tr ngha (Mean Location), v tng trng s
(Total Weighted) v khong cch khng trng s (Unweighted) t mi a im.
Ch : mt s m hnh v tr c gi l v tr mt chiu v v tr hai chiu,
cng c bit nh l m hnh "trung tm ca lc hp dn" trong mt s sch gio
khoa.
M hnh cui cng ch n gin l phn tch ho vn p dng cho cc vn
v tr .
TRANG 144
PHN MM NH LNG POMQM
M HNH (TRNG S) NH TNH
The Qualitative (Weighting) Model

Nu m hnh cht lng (nh tnh) c chn, cc khun kh chung c
cho bi s lng cc yu t v s lng cc a ch tim nng. Trong mn hnh sau
y, chng ti cho thy mt v d vi 7 yu t v 3 a im tim nng.
Yu t trng s (Factor Weights) : trng s nn c a ra cho mi yu t.
Cc trng s c th c cho nh l s nguyn hoc cc phn on (phn s).
Ni chung, trng s tng hp ti 1 hoc 100 (tng cng = 100), nhng iu ny
khng phi l mt yu cu.
im s (Scores) : im s ca mi thnh ph trn mi yu t nn c cho.
V D 1 :
PHN TCH (NH TNH) V TR TRNG S
(Example 1 : Weighted location (qualitative) analysis)

Trong mn hnh sau y, chng ti hin th mt s y trong mu cha, cng
vi gii php. Ch rng cc thnh ph v cc yu t c t tn.
u ra l rt n gin v bao gm nhng iu sau y :

Tng s trng im (Total Weighted Score) (Total Weighted) : i vi mi
thnh ph, trng s c nhn vi cc im s i vi mi yu t v c
tng kt. Tng s c in bn di cng ca mi ct. V d, im s cho
Philadelphia c tnh ton nh :
10 * 90 + 30 * 80 + 5 * 60 + 15 * 90 + 20 * 50 + 10 * 40 + 5 * 30 = 6500
M c lit k bn di cng ca ct Philadelphia.
Trng s bnh qun (Weighted Average) (Total Score tng im s / Total
Weight tng trng s) cng c hin th cho tng a im.
CHN A IM 1 CHIU
(One-Dimensional Siting)
Nu chn a im 1 chiu c la chn, khun kh chung bao gm mt ct
trng s hoc cc chuyn i, v ct 1 ta duy nht hoc a ch, v 1 ct
php nhn (Multiplication). Cc thng tin cn thit theo th t bt u l s
lng cc a ch c bao gm trong phn tch.
TRANG 145
PHN MM NH LNG POMQM
V D 2 : V TR 1 CHIU
(Example 2 : One-dimensional location)

Mn hnh gii php, trong bao gm cc d liu cho mt phn tch 4 a ch,
c a ra trong mn hnh sau y.
Cc thng tin c in vo l :
Trng s / cc chuyn i (Weight / Trips) : trng s hoc s lng cc chuyn i
ti v / hoc t mi a ch. Gi tr mc nh l 1 cho mi a im. y l nhng
g nn c s dng khi tt c cc khch hng / cc a im c coi l bnh ng
(nh nhau). Nu nhiu chuyn i hn na c thc hin cho mt khch hng khc
hn, iu ny c th c bao gm trong ct trng s / chuyn i (Weight / trips).
Nu s lng cc chuyn i l nh nhau, nhng trng s ca cc vt liu khc
nhau, iu ny nn c bao gm.
Ta X (X Coordinate) (X Coord) : ta ca cc a im phi c cho.

iu ny c th c th hin theo nhiu cch khc nhau. y c th l cc a
ch ng ph (trn cng mt ng ph khi y l 1 chiu), chng c th l tng
trong mt ta nh (n c th cho kch thc i ln thay v ngang qua), hoc chng
c th l ta ng - ty hoc bc - nam, ni mt con s tiu cc (s m) c
ngha l pha ty v mt con s tch cc (s dng) c ngha l pha ng hoc
mt s m c ngha l pha nam v mt s dng c ngha l pha bc (s dng
cc ta tiu cc s m i vi mt trong cc hng dn : e, g. -2 = 2S trong khi
2 = 2N phn bit Bc North Nam South hoc ng East Ty West).
Vn mu ca chng ti vi mt gii php xut hin trn. u ra mt ln
na l rt n gin.
Tng trng s hoc s lng cc chuyn i (Total Weight or Number of Trips) :
trong th t tm v tr trung bnh hoc v tr ngha, n th cn thit xc nh
tng s cc chuyn i hoc tng trng s. Trong v d, c 13 tng chuyn i, v vy
chuyn i gia l th 7.
V tr ngha v tr trung bnh (The Mean Location) : y l v tr ti thiu ha
tng bnh phng khong cch ca cc chuyn i.
Chuyn i trung bnh trung bnh tuyn gia (The Median Trip) : chuyn i trung
bnh c xc nh l chuyn i s 7 v xy ra t v tr 2800.
TRANG 146
PHN MM NH LNG POMQM
Ni chung, mt cu hi th v l liu mt ngi qun l nn gim thiu tng

khong cch hay gim thiu tng bnh phng khong cch. Lu trong v d ny
l mt cu tr li mt sn lng ti chn (khi) 2800 v mt cu tr li sn lng
khc ti khi 3100 3200 (3192,308).
CHN A IM 2 CHIU
(Two-Dimensional Siting)
Cc thng tin chn a im 2 chiu tng t nh cc yu cu thng tin chn
a im 1 chiu. Mt ln na, thit lp thng tin ch l s lng a im. Mn hnh
sau y cha cc d liu v gii php cho mt vn chn a im 2 chiu. Ch
khc bit gia cc d liu i vi chn a im 1 chiu v 2 chiu l ct ph, m
by gi xut hin cho d liu 2 ta . D liu c nhp vo trong cng mt cch
nh chn a im 1 chiu.
V D 3 : V TR 2 CHIU
(Example 3 : Two-dimensional location)

Mn hnh gii php chn a im 2 chiu c mt s lng ln cc thng tin
nh trin lm trong mn hnh trc. Mt s thng tin ging nh chn a im 1
chiu v mt s l thm.
Trng s ta X (Weighted X-Coordinate) (X Multiplied) : iu ny ch n
gin l ta nhn vi s lng cc chuyn i. Trong v d ny, s lng cc
chuyn i l tch cc i vi 5 v tr u tin, nhng 0 tch cc i vi 2 v tr cui
cng. Php nhn (Multiplications) vi trng s c th c nhn thy.
Trng s ta Y (Weighted Y-Coordinate) (Y Multiplied) : iu ny l ging
ht ct trc, ngoi tr vic n l ta Y m c nhn. Nhng ct trng s
chng minh cc tnh ton m dn n cu tr li bn di d liu. Mc trung bnh
(Averages , Median) ca cc ct ny l cu tr li. Lu trong v d ny rng
chia bng 7 sn lng trung bnh (khng trng s) u tin v chia bng tng trng
s, m l 320, sn lng trung bnh (trng s) th hai.
TRANG 147
PHN MM NH LNG POMQM
Trung bnh (tuyn gia) (Median) : cc chuyn i trung bnh l 160 (khng
phi 160,5) v ta X trung bnh l 132 trong khi ta Y trung bnh l 75.
Trung bnh (Averages) : trung bnh trng v khng trng ca cc ta c
hin th.
BNG KHONG CCH
(Table of Distances)
Bng khong cch t im (Point) n im c th c hin th.
Tng s khong cch (Total Distance) :

dng c tn l "Tng" (Total) cha
tng khong cch t mi a ch n a ch ny. Phng tin tnh ton khong
cch ph thuc vo bng (khong cch khng giang so vi thay v khong cch
khi chn thnh ph). S 997,665 cho nguyn vt liu 1 (Raw Material 1) c
ngha rng a ch nguyn vt liu 1 ti ta 132, 123 c tng khong cch l
997,665 t 6 a ch khc. l, nu bn thc hin mt chuyn i t 6 a ch
n a ch ca nguyn vt liu 1, n s bao ph mt khong cch l 997,665.
Mt cch khc xem ct ny l ni rng a ch tim nng 1 (Potential Site 1)
l trung tm hn so vi a ch tim nng 2 bi v n c mt khong cch l
921,7104 ; m nh hn 1.018,993 ca a ch tim nng 2.
Tng trng s (Weighted Total) :
cc con s trong dng khong cch
(Distance Row) khng a vo ti khon, m cc con s khc ca cc chuyn i
c thc hin gia cc im (Points) hoc s lng khc ca vt liu c di
chuyn gia cc im. Ct ny nhn thi gian khong cch s lng ca chuyn
i, hoc s lng vt liu c di chuyn. Mt ln na, tuy nhin, a ch tim
nng 1 c v c li th hn a ch tim nng 2.
Ch : c th, v thm ch c th hu ch, gii quyt vn 1 chiu
bng cch s dng m hnh 2 chiu vi mt ta nh nhau ti 0 cho tt c
cc a ch.
TRANG 148
PHN MM NH LNG POMQM
PHN TCH HA VN
(Breakeven Analysis)
Mt m hnh c sn. iu ny ch n gin l mt m hnh phn tch ho vn
k t khi ha vn c p dng cho vn v tr. Mt v d xut hin di y.
Cc im giao nhau s c tm thy v mt th c sn.
XC NH KCH C
(Lot Sizing)
Xc nh kch c l hng cho 1 mn nguyn vt liu
Hoch nh nhu cu vt liu ERP
See also : Materials Requirements Planning MRP
Ging m un Aggregate Planning Quy Hoch Tng Hp
M hnh ny s thc hin rt nhiu kch thc xc nh tng chi ph tn tr
(Total Holding), chi ph t hng (Setup Costs), v chi ph d tr ra (Stock-out Costs)
khi nhu cu khng nh nhau trong tng thi k. Cc phng php chun bao gm
s lng t hng kinh t (EOQ), s lng t hng giai on sn xut (POQ), phng
php rt nhiu-rt nhiu L-cho-L (Lot-for-Lot), phng php bn thi gian cn
bng (Part-Period Balancing), v Wagner-Whitin m tm thy c lch trnh ti
u. Rt nhiu kch thc gn nh khng thay i tho lun trong hip hi h
thng MRP (MRP # ERP).
TRANG 149
PHN MM NH LNG POMQM
(The data)
Xem xt v d sau :
D LIU
Week
(Tun)
Demand
(Nhu cu)
July 11
July 18
July 25
August 1
August 8
August 15
Chi ph tn tr (Holding Costs) (H) l $2 cho mi n v mi tun v chi ph

thit lp mt hot ng sn xut (chi ph t hng Setup Costs (S) l $21. Khng c
hng tn kho ban u (Initial Inventory), cng khng c thi gian ch (Lead Time) (LT).
Mt mn hnh d liu cho vn ca chng ti xut hin bn cnh. Cc d liu
c cho bao gm nhu cu bn tri, cc chi ph v thng tin khc trn bn phi ca
bng.
6 phng php c sn trong hp phng php trn d liu :

1. Wagner-Whitin tm thy lch trnh sn xut ti u, gim thiu tng
chi ph (Holding + Setup).
2. Lot-for-Lot l cch MRP truyn thng ca vic t hng chnh
xc nhng g l cn thit trong tng thi k (iu ny l ti u nu chi
ph t hng Setup Costs l 0).
3. Phng php EOQ tnh ton EOQ da trn nhu cu trung bnh
(Average Demand) trn ht thy cc giai on v n t hng vi rt
nhiu kch c ny, nhiu ra lnh trang tri cc nhu cu (t hng
nhiu trang tri cc nhu cu).
4. Phng php s lng t hng giai on sn xut (POQ) dch
chuyn EOQ vo n v thi gian (s lng giai on) hn l s lng
n t hng. POQ l chiu di ca thi gian mt n t hng m
EOQ s bao gm, c lm trn n mt s nguyn. V d, nu t l
nhu cu trung bnh l 100 n v mi thi k v EOQ l 20 n v cho
mi n hng, th POQ l 100/20 = 5 giai on.
TRANG 150
PHN MM NH LNG POMQM
5. Phng php bn thi gian cn bng (Part-Period Balancing).

y l mt khm ph ni ting, c s dng rng ri c bao ph
trong nhiu cun sch.
6. Phng php ngi dng xc nh (User defined). Ngi s
dng c th xc nh s lng sn xut.
Nhu cu (Demands) : nhu cu trong tng thi k l c cho. Nhu cu l s
nguyn.
Sn xut (Produce) : ct ny ch c s dng cho cc ty chn c ngi
dng xc nh. Nhp s lng n v c sn xut. Nu mt ty chn khc hn so
vi ty chn ngi dng xc nh c chn, th chng trnh s iu chnh li ct
ny v hin th n nh l u ra.
Cc thng tin bn phi bao gm :
Chi ph tn tr (Holding cost) : chi ph tn tr 1 n v trong 1 giai on c
nhp vo y. Chi ph tn tr phi chi tr i vi hng tn kho cui thi k.
Chi ph thiu hng (Shortage cost) : Chi ph thiu mt n v hng cho mt giai
on c nhp vo y. Cc chi ph thiu ht phi chi tr i vi hng tn kho cui
giai on nu hng tn kho l tiu cc, do thi gian ch (LT) hoc theo ty chn ngi
dng xc nh, n c th cho hng tn kho tr thnh tiu cc (V d, ngi s dng c
th xc nh sn xut l 0 trong tng thi k).
Ch : chng ti thng gi nh rng cc chi ph tn tr v thiu ht phi chi tr
i vi hng tn kho m l trn tay (Inventory On Hand) cui thi k.
Chi ph t hng (Setup cost) : y l chi ph mi hot ng sn xut. N ch phi
chi tr trong giai on m c sn xut tch cc.
Hng tn kho ban u (Initial inventory) : n c th cho php mt tnh hung m
c tn kho u k.
Thi gian ch (Lead time) : iu ny s b p cc yu cu v sn xut n giai
on trc (Xem v d 3).
V D 1 :
MT VN KCH C 6 THI K
(Example 1 : A six-period lot sizing problem)
TRANG 151
PHN MM NH LNG POMQM
Cc gii php cho v d ca chng ta c hin th trong mn hnh trc. Ct

Tip nhn n t hng (Order Receipt) c bt ngun bi chng trnh (cc gi
tr trong ct ny cng chnh l nhu cu Demand nhng l ca vi giai on cng li).
Cc ct ph l ngun gc cha cc thng tin sau :
Hng tn kho (Inventory) : y l s tin ca hng tn kho trn tay (Inventory On
Hand) cui thi k. Trong v d, c 6 n v cn li sau giai on 1, 4 n v cn li
sau giai on 2, v 3 n v trn tay sau giai on 5. Chi ph tn tr phi chi tr i vi
s lng ny.
Chi ph tn tr (Holding cost) : y l chi ph tn tr hng tn kho vo cui thi k
ny. N ch n gin l s lng cc n v trn tay nhn vi chi ph tn tr trn mt
n v, m trong v d ny l $2.
Chi ph t hng (Setup cost) : y l 0 nu sn xut khng xy ra hoc l chi ph
t hng nu sn xut xy ra trong thi gian ny. Trong v d, cc thit lp (cc n
hng tip nhn) xy ra trong giai on 1, 4, v 5, do , chi ph t hng $21 c
lit k trong 3 thi k ny ch khng phi trong 3 giai on khc.
Tng s (Totals) : tng hng tn kho, chi ph tn tr, v chi ph t hng c lit
k di cng ca mi ct. 13 n v c tn tr trong mt thng vi mt chi ph
l $26 (13 n v hng tn kho 6+4+3=13 ; 6*2+4*2+3*2=26$). 3 thit lp (3 n hng
tip nhn) xy ra vi tng chi ph l $63 (3*21=63$).
Tng chi ph (Total cost) : tng ca c chi ph t hng v chi ph tn tr c
hin th gc di bn tri. Tng chi ph trong v d ny l $89 (26+63=89$). Khi
chng ta s dng phng php Wagner-Whitin, th gii php ny l ti u.
V D 2 : S DNG EOQ
(Example 2 : Using the EOQ)

Mt trong nhng la chn t cc n hng l s dng m hnh s lng t
hng kinh t. EOQ c tnh ton da trn nhu cu trung bnh qua cc thi k (trn ht
thy cc giai on). Trong v d, EOQ c da trn t l nhu cu ca 31 n v
mi 6 giai on (31/6 = 5,167). S dng chi ph t hng v chi ph tn tr vi nhu cu
ny to ra mt EOQ l 10 (sau khi lm trn), nh c hin th gn di cng ca
mn hnh. Chng trnh s t mt n t hng cho 10 n v mi ln m hng tn
kho l khng trang tri cc nhu cu. V d, n hng u tin cho 10 n v
c t trong giai on 1. iu ny bao gm cc nhu cu trong giai on 1 v nhu
cu trong giai on 2. Trong giai on 3, chng ta cn mt n hng 10 n v khc.
S dng phng php ny trong v d to ra 4 n t hng (m tng s l 40 n v,
khng phi 31 n v) v tng chi ph l $142.
TRANG 152
PHN MM NH LNG POMQM
Lu rng phng php EOQ c kh nng s t hng nhiu n v hn cn

thit v do c chi ph tn tr cao hn mc cn thit.
V D 3 : S DNG POQ
(Example 3 : Using the POQ)

Chng ti sa i 2 v d trc y ca chng ti bng cch thm mt hng
tn kho ban u l 6 n v v thi gian ch (LT) l 1 tun. Chng ti cng c thay
i phng php thnh POQ.
Mt trong nhng la chn t cc n hng l s dng phng php s lng
t hng thi gian (sn xut). POQ l EOQ nhng th hin trong thi gian hn l trong
cc n v. Trong v d ca chng ti, POQ l 10 n v chia cho t l nhu cu trung
bnh v lm trn, m l 2 thi k (10 / 5,1667 = 2), nh thy trong mn hnh sau
y. Chng trnh s t mt n t hng bao gm tt c 2 giai on (5+2=7;
4+8=12 ; 9+3=12).
Bi v y l mt thi gian ch (LT), mn hnh kt qu bao gm thm mt ct

cho Pht hnh n t hng (Order Release). V d, k hn t hng (Order Due)
vo ngy 18 thng 7 phi c pht hnh vo ngy 11 thng 7 do thi gian ch
ny. S lng t hng l nh nhau m khng cn thi gian ch (tc bng vi s
lng trong cc n hng tip nhn Order Receipt), nhng cc n t hng
c pht hnh trc th do thi gian ch. Ch rng nu chng ta c s
dng thi gian ch 1 tun nhng khng thm vo hng tn kho ban u bao
gm (Cover bao gm) giai on u tin, th s c s thiu ht khng th trnh
khi trong giai on 1.
V D 4 :
T HNG LOT FOR LOT
(Example 4 : Lot-for-lot ordering)

t hng lot-for-lot (khng c hin th) l rt n gin v mt cch ph bin
cho h thng MRP hot ng. S lng nhu cu chnh xc lun lun c t hng.
iu ny l ti u nu khng c chi ph t hng.
TRANG 153
PHN MM NH LNG POMQM
PHN TCH MARKOV

(Markov Analysis)
Mt chui Markov c m t bi mt ma trn chuyn i m cho xc sut i
t trng thi (State) ti trng thi. V d, hy xem xt nhng iu sau y :
State 1
(Trng thi 1)
State 2
State 3
State 1
.7
.1
.2
State 2
.05
.85
.1
State 3
.05
.05
.9
From / To
Nu chng ta trong trng thi 1, c 1 c hi 70% (0,7) m chng ta s c

trng thi 1 ti giai on (Stage) tip theo, 1 c hi 10% (0,1) m chng ta di
chuyn ti trng thi 2, v 20% (0,2) c hi m chng ta di chuyn ti trng thi 3.
C bn, c 2 loi cu hi m cn tr li cho chui Markov. Mt l: chng ta s
u sau mt lng nh cc bc ? Khc l: chng ta s u sau mt lng ln
cc bc ? Thng thng thi gian ny ph thuc vo trng thi m chng ta bt u.
Mn hnh d liu cho v d ny c hin th bn cnh. Ct u tin "ban u"
(Initial) ch ra rng chng ta c mt c hi bnh ng (chia u) bt u trong
bt k 3 trng thi (Xc sut 1 / 3 = 0,3333). Ct ny khng c cha cc xc sut
nh chng ti cho thy trong v d 2. D liu thm vo trn bng d liu s
chuyn i (Number of Transitions) ch ra rng chng ta mun nhn vo kt qu
sau 3 qu trnh chuyn i.
NHNG KT QU
(Results)
Mn hnh kt qu c cha 3 loi khc nhau ca cu tr li.
3-by-3 trn u
bng cha ma trn chuyn i 3 bc (m l c lp ca trng thi bt u).
Dng tip theo cho xc sut m chng ta kt thc trong trng thi 1 hoc 2 hoc 3,
m l mt chc nng ca xc sut trng thi ban u. Dng cui cng cho xc sut
hot ng di hn xc sut trng thi n nh (Steady State Probability) hoc t l
phn trm ca thi gian chng ti chi tiu trong mi trng thi.
TRANG 154
PHN MM NH LNG POMQM
Mn hnh sau y hin th php nhn thng qua 3 qu trnh chuyn i (theo
yu cu trong hp d liu thm trn d liu).
V D 2 :
MT PHN TCH HON THNH (Y )
(Example 2 : A complete analysis)

Xem xt cc chui Markov c hin th bn cnh. Chui bao gm 3 loi khc
nhau ca cc trng thi. Trng thi 1 c hp th (Absorbing) (xc sut 100%).
Trng thi 3 v 4 cng hnh thc khp kn, lp (class) : thng xuyn ti pht
(Recurrent). Trong khi trng thi 2 l thong qua (Transient). Hn na, chng ti
ang ch ra rng lc bt u vn ny chng l 60, 80, 100, v 60 mc trong trng
thi 1, 2, 3, v 4 tng ng (tng s bng 300). Nh quy nh trc y, ct ban
u (Initial) khng c cha xc sut .
TRANG 155
PHN MM NH LNG POMQM
Bng u ra u tin l nh trc, m t hnh vi hot ng lu di. u bng

cha cc xc sut hot ng di hn. Dng s lng kt thc cho thy s lng
d kin (trong ngha thng k) nhiu th no trong s 300 mc ban u (nguyn) s
kt thc trong mi trng thi. Trong v d ny, chng ta bit rng 60 m bt u
trong trng thi 1 s kt thc trong trng thi 1 (100%) v 160 (100 + 60) m bt
u trong trng thi 3 v 4 s kt thc nhng trng thi (chia u 0,5 v 0,5).
80 m bt u trng thi 2, th 28,57% (0,2857) s kt thc trng thi 1,
trong khi nhng trng thi khc cn li s c chia u trn cc trng thi 3
v 4 (0,3571).
Dng di cng l xc sut trng thi n nh (Steady State Probability) tt

c cn phi c hiu nh l iu kin lp (class) khp kn thng xuyn ti pht
(Recurrent) m trng thi trong. V d, lu u tin rng chng khng cng
ti 1. Cc lp (class) ny c xc nh trong mt mn hnh u ra th hai, nh
hin th di y :
Cui cng, c mt mn hnh u ra nhiu hn. Mn hnh ny cha ma trn

Markov thng thng m c to ra khi thc hin mt phn tch chui Markov.
Phn trn cng ma trn l mt phin bn sp xp ca chui Markov ban u
(nguyn). N c sp xp tt c cc trng thi trong cng mt lp thng
xuyn ti pht (Recurrent) th lin k (tip gip) (xem trng thi 3 v 4) v do
m trng thi thong qua (Transient) l cui cng ( l trng thi 2 : 0,2 ;
0,4 ; 0,1 ; 0,3 ).
TRANG 156
PHN MM NH LNG POMQM
Ma trn B l tp hp con ca ma trn ban u ch gm trng thi thong qua

(Transient States).
Ma trn F c cho bi phng trnh :
F= (I-B)-1
Trong I l ma trn nhn dng (Identity Matrix).

Cui cng, ma trn FA l sn phm ca ma trn F v ma trn c hnh
thnh bi cc t bo () m i din i t trng thi thong qua ti bt k trng
thi khng thong qua no (Non-Transient State).
LP K HOCH NHU CU VT LIU

(Material Requirements Planning)
Hoch nh nhu cu vt liu MRP nhiu mn nguyn vt liu
See also : Lot sizing kch c l hng
M hnh hoch nh nhu cu vt liu MRP c s dng xc nh nhu cu
sn xut cho cc hng mc ph thuc.
D LIU
(The Data)
Xem xt v d sau :
TRANG 157
PHN MM NH LNG POMQM
Cc con s trn bn tri ca mi mc cho thy s cc thnh phn ph

(Sub-Components) phi c s dng trong cc thnh phn chnh
(Parent Component), c nhp vo Ct # Per Parent . Cc con s ny l s
lng n v ca cc mt hng ph m dng cho sn xut 1 sn phm chnh ; l s
lng n v trong Parent vt liu, trong 1 Parent sn xut 1 sn phm c nhiu vt
liu vi khi lng n v khc nhau, ngoi ra trong tnh ton cn c kiu l gii
khc, v d nh nhn ln s thy rng cn phi s dng 3c mi c th s
dng 1a, hay dng 2b cn 1e.
Thi gian ch (LT) l 1 tun, ngoi tr cho mc b, c mt thi gian ch l 2
tun.
Khun kh cho MRP c cho bi :
Th nht, s dng trong ha n tht vo ca vt liu, l cc dng chi tit cho
vt liu theo tng ct, bao gm :
+ Cp Level (vt liu ny c s dng trc ri mi n vt liu kia, mc
cp u tin, vt liu no c s dng cui cng th thuc cp 0, cp cui
cng, thc hin cui cng).
+ Thi gian ch Lead Time.
+ S lng n v mt hng # Per Parent ( c gii thch trn).
+ Ect v.v ...
Th hai, s lng cc giai on thi gian Periods (pd1 , pd2 , ...).
Trong mn hnh ca chng ti, m sau y, i din cho v d trn, chng ti
cho thy mt vn vi :
+ 7 dng hi ng qun tr : 7 dng qun l nhm vt liu, 7 mc vt liu.
+ V 8 thi gian : 8 giai on nhu cu (8 tun) Periods , Planning Demand
(pd1, pd2, pd3, ... , pd8) l 8 nhu cu k hoch ca 8 k khc nhau, nh thy
trn cng ca mn hnh, y l mt m-un tt s dng ty chn khng hin th
s 0 (Do not display zero , Display/Hide Zeroes)
t thanh cng c Toolbar hoc
Menu Format .
Tn mc (Item Names) :
tn mt hng c nhp vo trong ct ny. Tn
ging nhau s xut hin trong hn mt dng nu mt hng c s dng bi 2
mc chnh Parent Items (cng 1 mc con c th c trong 2 mc chnh), chng hn
nh mc e trn s , Lu rng nh l mt quy tc, tn l khng quan trng, nhng
TRANG 158
PHN MM NH LNG POMQM
trong MRP th tn l v cng quan trng. Trng hp (trn/di) khng quan trng,
nhng khng gian (khong trng) th quan trng rt nhiu.
Mc cp (Item Level) : cp trong hi ng qun tr tht vo phi c
cho y. Mc khng th t mt cp nhiu hn 1, vo bn di mc k
trn (v d mc a trn bng nhp liu c cp 0, mc b l 1, th mc e ch c
th l 2 ch khng bao gi l 3. Nhng nu trong 1 trng hp khc th n c th l 0
bt u 1 cp khc). Khng s dng m s cp thp (Low Level Codes).
Ngoi ra, xin vui lng lu rng n cho php c nhiu hn mt mc cp 0 (nhiu
hn mt kt thc mc) nh trong v d 2.
Thi gian ch (Lead Time) :
thi gian ch c c mn hng c nhp
vo y. Mc nh l 1.
S lng n v mt hng (Number (#) Per Parent) : s lng cc n v ca
nhm nh (Sub-Assembly) ny cn thit cho thnh phn chnh (Parent) ca n th
c nhp y. Mc nh l 1.
Tn kho trn tay (On-Hand) : tn kho hin ti trn tay vo lc bt u vn
c lit k y. Nu 1 nhm nh (Sub-Assembly) c lit k hai ln, n lm cho
cm gic hng tn kho hin nay ch xut hin mt ln (tc ch nhp 1 ni trong 2 ni
). Tuy nhin, nu n xut hin hai ln, th hng tn kho bt u s l tng s tin
c lit k (tc bng s tin 2 ni c nhp cng li) (xem v d 2).
Nhiu kch thc kch c l hng (Lot Size) : kch thc l hng c th c
quy nh y. Kch c 0 hoc 1 s thc hin t hng l theo l. Nu mt s khc
c t y, tt c cc n t hng cho mc s l nhng l m l bi s
nguyn ca s (xem v d 2).
S lng ti thiu (Minimum Quantity) : n c th xc nh kch thc t hng
ti thiu (xem v d 2).
Nhu cu (Demands) : nhu cu c nhp vo bt k mc no m cc mc
c yu cu (trong v d, nhp t giai on 1 n giai on 8, cc mc c
cp 0 v nm trong tun m n c yu cu).
Bin lai lch trnh Lch trnh tip nhn (Scheduled Receipts) : nu cc n v l
d kin (lch trnh) c giao trong tng lai, chng nn c lit k trong giai on
thi gian (ct) v cc mc (dng) thch hp. (xem v d 2).
V D 1 : MT V D MRP N GIN
(Example 1 : A simple MRP example)

Mt mn hnh d liu mu c biu hin nhng vn xut hin trong minh ha
trc. Cc cp ch ra rng chng ta c mt mc gi l a, m c 2 thnh phn con
(cp 1) c t tn l b v c. Tiu hp phn b c 2 thnh phn con (cp 2)
c t tn l e v f. Tiu hp phn c c 2 phn con tn l d v e. Ch
rng e l tiu hp phn ca c hai b v c.
Nhu cu cho mc kt thc a l 120 n v trong tun 7 v 140 n v trong tun 8.
S lng ca cc thnh phn con dng c cho trong ct s lng n v mt hng
The Number Per Parent (# Per Parent). i vi v d, mc cui cng a bao gm 2
phn con ca b, m ln lt bao gm # Per Parent l 1 e v 2 f. Vo lc bt u
vn , c 0 n v bt k loi hng tn kho trn tay.
TRANG 159
PHN MM NH LNG POMQM
XEM CY SN PHM MRP
(MRP Product Tree Viewer)

MRP c mt kiu xem cy sn phm, nh hnh di y. Mt ha n tht vo
ca vt liu c hin th :
NHNG KT QU
(Results)
Mt phn ca kt qu c hin th trong mn hnh sau y.
Tng nhu cu TOT.REQ (Total Required) : tng s n v yu cu trong mi
tun c lit k trong hng u tin. i vi cc mt hng cui cng, y l lch trnh
nhu cu u vo trn mn hnh d liu. i vi cc mt hng khc, iu ny c tnh
ton.
Tn kho trn tay (On-Hand) : s lng trn tay c lit k y. iu ny bt
u nh c a ra trn mn hnh d liu v c gim theo s cn thit. Mt v d
sau s chng minh hng tn kho trn tay.
D kin nhn Lch trnh tip nhn (Scheduled Receipt) : y l s tin m
c d kin trong mn hnh d liu ban u, l Lng tip nhn theo lch trnh
SchdREC (xem v d 2).
Mng li nhu cu Nhu cu rng (NET REQ) (Net Required) : s tin nhu cu
rng phi l s tin cn thit sau khi hng tn kho trn tay c s dng. Mt ln
na, thnh phn c minh ha lc ht ph Sub-Traction (xem v d 2).
Lng n hng tip nhn theo k hoch PlanREC (Planned Receipt) : y l
s tin m s nhn c. N s l tng t nh nhu cu rng trong nhiu ln,
nhng n cng c th ln hn do kch thc t hng ti thiu v kch c l hng
rt nhiu (xem v d 2).
Lng n hng pht ra theo k hoch ORD REL (Order Release) :
y l
nhu cu rng nhng c b p bi thi gian ch.
TRANG 160
PHN MM NH LNG POMQM
S IN
(Printing)
Chng ti cho thy mt phn ca bn in cho cc vn v l do chnh. Cc bn in
ca u vo l di hnh thc hi khc so vi mn hnh hin th. Ch rng phn mm
in ha n tht vo ca nguyn liu.
Ha n tht vo l bng kt qu ca Ma trn MRP.
Ernest Student ( bin sinh vin Stat 802/MSOM 806 Howard Weiss),Stat 802/MSOM 806,Howard Weiss
M:\Examples\example1.basic.mat
12-15-2004 13:32:20
Module/submodel: Material Requirements Planning (M un/M hnh: lp k hoch nhu cu vt liu)
Problem title: Example 1
(Tiu vn : V d 1)
Indented BOM and Results ---------Indented Bill of Materials
(Lm lm xung BOM v nhng kt qu)

(Lm lm xung Bill (ca) nhng vt cht)
TRANG 161
PHN MM NH LNG POMQM
Item Minimum
ID Quantity
(S lng ID
ti thiu)
a
b
e
f
c
d
e
Leadtime
(thi gian ch)
(LT)
1
2
1
1
1
1
1
Number per
parent
(Parent trung bnh)
On hand
Inventory
(tn kho trong tay)
Lot Size
(Kch c l)
(if > 1)
1
2
1
2
3
5
4
Demands for level 0 items (nhu cu cho mc cp 0)

Item Id = a
Period
Demand
1
0
2
0
3
0
4
0
5
0
6
0
7
120
8
140
Scheduled receipts for all items which are not end (level 0) items (if any) : (Hoch nh nhng
cng thc cho tt c cc tit mc m (th) khng phi l kt thc ( ngang mc 0) Nhng tit mc
(nu c))
a(low level = 0)
<= pd 0
pd1
pd2
pd3
pd4
pd5
pd6
pd7
pd8
------------------------------------------------------------------------------------------------TOT.REQ.
120
140
SchdREC.
ON HAND
NET REQ
120
140
PlanREC.
120
140
ORD REL.
120
140
b(low level = 1)
<= pd 0
pd1
pd2
pd3
pd4
pd5
pd6
pd7
Pd8
------------------------------------------------------------------------------------------------TOT.REQ.
240
280
SchdREC.
ON HAND
NET REQ
240
280
PlanREC.
240
280
ORD REL.
240
280
NHNG TY CHN
(Options)
V d tip theo s chng minh mt s cc tnh nng ca m-un MRP ca chng ti.
Chng ti thay i v d trc ca chng ti nh c hin th tip theo.
TRANG 162
PHN MM NH LNG POMQM
u tin, nhn thy rng chng ti thay i cp cho sn phm d v tiu hp

phn e di n. Mc d l mt mc kt thc vi mt nhu cu l 65 trong giai on 8. Nh
vy e l cp 2 i vi a nhng cp 1 i vi d. Th hai, chng ti cho e
mt hng tn kho ban u l c 10 v 20, chng ti thc s khng nn c c hai nhng
chng ti mun chng minh nhng g s xy ra. Th ba, chng ti c mt d kin nhn
l 800 n v trong giai on 2 cho mc c. Th t, mc f phi c mua hoc c
thc hin rt nhiu m l bi s ca 144 n v. Th nm, mc b phi c mua vi s
lng 300 hoc nhiu hn.
Cc kt qu c th c nhn thy trong mn hnh hin th bn in sau. Chng ti
chnh sa mt s d liu u vo bng cch loi b mt s 0s.
Lisa B. Ernest
P:\Manual\Examples\Example2.mat
02-20-1999
12:00:52
Module/submodel: Material Requirements Planning

Problem title: Example 2
Indented BOM and Results ---------Indented Bill of Materials
Item
Minimum
ID
Lead time
quantity
Number per
On hand
parent
Inventory
Lot Size
(if not lot
for lot)
a
b
300
e
f
c
d
e
1
2
1
2
1
1
1
1
1
1
2
3
5
4
10
144
20
Demands for level 0 items

Item Id = a
Period
Demand
7
120
8
140
Item Id = d
Period
Demand
8
65
Scheduled receipts for all items which are not end (level 0) items (if any)
Item Id = c
Period
2
Receipt
800
TRANG 163
PHN MM NH LNG POMQM
a(low level =
0)
<= pd 0
pd1
pd2
pd3
pd4
pd5
pd6
pd7
pd8
---------------------------------------------------------------------------------TOT.REQ.
120
140
ON HAND
SchdREC.
NET REQ
120
140
PlanREC.
120
140
ORD REL.
120
140
d(low level = 0)
<= pd 0
pd1
pd2
pd3
pd4
pd5
pd6
pd7
pd8
---------------------------------------------------------------------------------TOT.REQ.
65
ON HAND
SchdREC.
NET REQ
65
PlanREC.
65
ORD REL.
65
b(low level = 1)
<= pd 0
pd1
pd2
pd3
pd4
pd5
pd6
pd7
pd8
---------------------------------------------------------------------------------TOT.REQ.
240
280
ON HAND
60
80
80
SchdREC.
NET REQ
240
220
PlanREC.
300
300
ORD REL.
300
300
c(low level = 1)
<= pd 0
pd1
pd2
pd3
pd4
pd5
pd6
pd7
pd8
---------------------------------------------------------------------------------TOT.REQ.
360
420
ON HAND
800
800
800
440
20
20
SchdREC.
800
NET REQ
PlanREC.
ORD REL.
e(low level = 2)
<= pd 0
pd1
pd2
pd3
pd4
pd5
pd6
pd7
pd8
---------------------------------------------------------------------------------TOT.REQ.
300
300
260
ON HAND
10
10
10
10
10
SchdREC.
NET REQ
290
300
260
PlanREC.
290
300
260
ORD REL.
290
300
260
f(low level = 2)
<= pd 0
pd1
pd2
pd3
pd4
pd5
pd6
pd7
pd8
---------------------------------------------------------------------------------TOT.REQ.
600
600
ON HAND
120
96
96
96
SchdREC.
NET REQ
600
480
PlanREC.
720
576
ORD REL.
720
576
Thng bo hng tn kho trn tay cho mc e. N bt u ti 30 v vn cn cho

n khi n l cn thit. Ch rng i vi mc c, 1 lch trnh giao hng n giai on 2
v sau i vo hng tn kho cho n khi n l cn thit. Ch rng i vi mc f
trong giai on 4, 600 n v l cn thit, nhng n hng c t l 720 n v bi
v n phi l mt bi s ca 144. Ch rng b trong giai on 6, s lng nhu cu l
240, nhng 300 n v c t hng v y l kch thc t hng ti thiu.
TRANG 164
PHN MM NH LNG POMQM
PHN TCH MNG

(Networks)
See also : Project Scheduling CPM / PERT
Ba m hnh c sn trong m-un ny :
cy bao trm ti thiu Minimum
Spanning Tree, ng i ngn nht Shortest Path Shortest Route, v lu
lng ti a Maximal Flow. Chng ti s s dng s sau y cho mi trong
ba v d ca chng ti. Trong th t, bt u bt k trong ba m hnh con, n l
cn thit ch ra s lng cc nhnh (Branches). Trong v d ca chng ti, c 14
nhnh. Trong th t vo tng nhnh, nt bt u (Starting Node) v nt kt thc
(Ending Node) phi c cho.
CY KO DI TI THIU
(Minimum Spanning Tree)

Trong cy bao trm ti thiu, chng ti c gng kt ni n nt khc nhau bng
cch s dng 1 vng cung c sn (trong 1 vng cung c nhiu vng cung nh).
Vng cung Arcs c chi ph Cost, v mc tiu Goal l tng chi ph Total Cost
ti thiu. Cc d liu v gii php cho v d ca chng ta xut hin trong mn hnh sau
y :
TRANG 165
PHN MM NH LNG POMQM
D liu l d liu tiu chun ca vng cung, hoc nhnh, th hin nh l t v

ti From and To nt s, v chi ph ca vic s dng vng cung. Trn cc d
liu l mt hp thoi m cho php ngi s dng xc nh s ca nt bt u
(Starting Node Number) hay s ca nt bt u cho s lp i lp li , s ca nt bt
u ca vng cung nh u tin (Starting Node for Iterations). Nu bn n l 0,
s thp nht ca nt s c s dng (tc nt s 0 s c s dng trong hng ng
cc nt bt u, cn i vi hng ng cc nt kt thc th nt s 1 s l nt u tin
s dng, trong v d c 8 nt bt u v 8 nt kt thc, nhng tng cng th c 9 nt).
Tt nhin, tng chi ph l c lp vi nt bt u, nhng vng cung thc t s dng
c th khc trong vn Cy ko di ti thiu.
8 nhnh m nn dng c nh du vi mt Y (xem ct bao gm Include) v
chi ph ti thiu kt ni 9 nt l 178. Mt bng hin th theo th t m cc nhnh
c thm vo c th c hin th nh minh ha trong mn hnh sau :
NG I NGN NHT
(Shortest Path)
Mt v d ng i ngn nht c a ra di y :
TRANG 166
PHN MM NH LNG POMQM
Chng ti mun tm ng i ngn nht v khong cch (Distance) t 1 im n

im khc. Mn hnh d liu hin th minh ha trc. Ch rng n c th xc nh
ngun gc (Origin) v im n (Destination). Nu bn li n l 0, chng trnh
s tm ng i ngn nht t nt s ti thiu ti nt s ti a (tc t nt s 1 ti
nt s 9) trong v d ny.
Trn cc d liu, mng li c th c thit lp l c hng (Directed) hoc v
hng (Undirected). Nu l v hng, khong cch t nt j n nt i c thit
lp ging nh khong cch t nt i nt j. V d, khong cch t nt 2 ti nt 1
c thit lp l 20.
Gii php nh sau :
Bn nhnh nn c bao gm trong ng i ngn nht (Shortest path), to ra

con ng 1-3-6-8-9 , vi tng khong cch l 113. Ngoi ra, chng trnh tnh tng
khong cch ti thiu t mi nt ti mi nt khc nh sau. xem ng i (Path),
thit lp cc gi tr cho s bt u v kt thc trn d liu.
LU LNG TI A
(Maximal Flow)
Trong tnh hung ny, chng ti mun ti a ha dng lu lng (Flow) t bt
u (Source) n kt thc (Sink). Cc con s dc theo (along cng , dc theo)
mi vng cung i din cho nng lc (Capacity) ca n v s th hai th hin
kh nng o ngc (Reverse Capacity) ca n (cng sut theo hng ngc li).
pha trn, ngun ci bt u (Source) v bn ra ci kt thc (Sink) c th
c thit lp. Nu chng c li 0, th The Source l nt vi s thp
nht, v The Sink l nt c s cao nht. Trc khi trnh by gii php ca chng
ti, chng ti nhc nh bn rng i khi nhiu hn mt gii php tn ti. Cng v
vy, c th c nhiu hn mt cch ly c cc gii php. Dng lu lng ti
a l 61, v dng lu lng dc theo cc nhnh c th c nhn thy trong hnh.
TRANG 167
PHN MM NH LNG POMQM
S lp i lp li (Iterations) c cho trong mn hnh sau y. Xin lu rng

ni chung c mt s bc lp i lp li khc nhau m c th c thc hin i
n cng mt dng lu lng ti a.
NNG SUT
(Productivity)
Nng sut c xc nh nh l t l ca u ra ti u vo (c nhiu kiu t
l ny, xem trong v trang 8 cun 1 mn qun tr vn hnh). Phn mm ny cho php
bn tnh ton nng sut cho bt k s lng u vo v cho bt k s lng giai
on thi gian. Phn mm s tnh ton c cc bin php sn xut cho mi u vo
v cng c c nhng thay i trong nng sut cc k (t giai on ti giai on)
cho mi u vo.
Ngoi ra, phn mm cho php to ra mt mu s chung
(Common Denominator) do m bn s kt thc vi mt thc o (Measure)
TRANG 168
PHN MM NH LNG POMQM
nng sut da trn nhiu u vo. Mt mn hnh mu bao gm c d liu v

gii php xut hin bn cnh. Khi to (Initialization) cho vn ny, yu cu
3 u vo (gi cng lao ng Labor hours, vt liu Materials, gi kim tra
Inspection hours) v 2 giai on thi gian.
D LIU
(Data)
$ / n v ($ / Unit) : ct ny c s dng tng hp tt c cc u vo
trong mt thc o c ngha. V vy, chng ti s chuyn i cc u vo c
bn ca chng ti bng cch s dng t l l : 8$ / Hour cho Lao ng (Labor),
$2 / lbs cho vt liu (Materials), v $12 / Hour cho cc chi ph kim tra
(Inspection Cost). V d, trong giai on 1, thc o tng hp l :
8 * 4.000 + 2 * 5.000 + 12 * 1.000 = 54.000
Giai on 1 ; 2 (Period 1 ; 2) : u ra c nhp vo trong dng u tin, v
cc u vo c nhp vo nhng dng cn li i vi mi giai on.
GII PHP
(Solution)
Nng sut (Productivity) : i vi mi u vo, t l u ra ti u vo c
hin th nh nng sut mi thi k. Ngoi ra, mt thc o tng hp c to ra
bng cch s dng cc yu t chuyn i trong ct 1. V vy, nh cp
trn, mu s cho giai on 1 l :
8 * 4.000 + 2 * 5.000 + 12 * 1.000 = 54.000
m sn lng mt nng sut l :
10.000 / 54.000 hoc 1.852.
Thay i nng sut (Productivity Change) :

mt ct c thm vo m
c lin quan n s thay i t giai on ti giai on cho mi thc o nng
sut.
V d, nng sut tng hp gim xung 7,19% t giai on 1 n giai
on 2.
TRANG 169
PHN MM NH LNG POMQM
HOCH NH D N
(Project Scheduling PERT CPM)
M hnh lp k hoch d n c s dng tm thi gian (d kin) hon
thnh d n cho 1 trong 2 :
+ Mng PERT Pert Network : hay cn gi l Mng AOA Activity On Arc
hot ng trn vng cung.
+ Hoc Mng CPM CPM Network : hay cn gi l Mng AON Activity On
Note hot ng trn nt .
i vi c hai mng, hoc 1 hoc 3 vn c tnh thi gian c th c i
din, hoc cc vn c ngha v lch chun xt ma (Standard
Deviations) cho mi hot ng c th c nhp vo.
C 5 m hnh c ph bin. Nhng m hnh ny c th thay i m khng
cn khi ng li bng cch s dng hp phng php.
PERT 1 THI GIAN C TNH V 3 THI GIAN C TNH
(Single Time Estimate and Triple Time Estimate PERT)

Hy xem xt mt d n nh c cho bi s u tin sau y v bng thi gian
sau th .
Task
(Nhim v)
A
B
C
D
E
Start Node
(Nt bt u)
End Node
(Nt kt thc)
1
2
2
3
4
2
3
4
6
6
Optimistic
(Lc quan)
(a)
2
4
10
3
4
Most Likely
(Nhiu kh nng)
(b)
12
5
23
5
7
Pessimistic
(Bi quan)
(c)
25
6
28
7
9
D LIU
(Data)
Mn hnh sau y c cha mt mn hnh d liu Pert ba thi gian c tnh
(Triple Time Estimate PERT) cho v d ca chng ta. Trong i din Pert, mng
c xc nh bng cch a ra cc nt bt u v nt kt thc i vi mi
nhim v. Kiu Mng (Network Type) c a ra bi hp bn tri pha trn d
liu. Trong v d u tin ny, chng ti ang s dng cc nt bt u / nt kt thc
i din cho cc hot ng.
TRANG 170
PHN MM NH LNG POMQM
D liu gm c :
Tn hot ng (Activity Name) : cc hot ng c th c t tn. Trong Pert,
tn khng c s dng, trong khi trong CPM danh sch u tin (Precedence List),
cc tn rt quan trng. Trong Pert, tn "thc" l mt hot ng c cho bng nhn
nt bt u v kt thc ca n.
Nt bt u (Starting Node) :
s ca nt m ti hot ng bt u c
cho y. Chng ti nhc nh bn rng nhng con s trong mt s Pert l
nhn hiu ch khng phi l gi tr s. Ghi nhn l ty . l, cc nt u tin c
th l 1 hoc 2 hoc 90.
Nt kt thc (Ending Node) : s ca nt m ti hot ng kt thc c
cho y. S khng th tng t nh s ca nt bt u. Ngoi ra, 2 hot ng
khng th c cng mt cp s nt bt u v kt thc.
Ngoi ra, Bt cu
(Transitivity) phi c tun theo. l mt li s xy ra nu quy tc bc cu
(Laws of Transitivity) b vi phm, chng hn nh cc cp (1, 2 ; 2, 3 ; 3, 1).
c tnh thi gian (Time Estimate) : trong vn thi gian duy nht (Single
Time), n l cn thit ch cho duy nht mt thi gian c tnh cho mi nhim v.
Thi gian lc quan (Optimistic Time) : iu ny ch xut hin trong ty chn
3 thi gian c tnh (Triple Time Estimate) t menu con.
Nhiu kh nng (Most Likely Time) (thi gian c kh nng hn , thi gian rt
c th) : thi gian ny phi c nhp vo phin bn hoc 1 hoc 3 thi gian
c tnh.
Thi gian bi quan (Pessimistic Time) :
iu ny ch xut hin trong phin
bn 3 thi gian c tnh.
GII PHP
(The Solution)
Mn hnh gii php chnh xc ph thuc vo vic n l vn mt c tnh
hoc ba c tnh. Trong mn hnh sau y, chng ti trnh by mu mt vn ba
c tnh bi v ci ny c cha tt c cc thng tin u ra. Vn mt thi gian
c tnh c t thng tin hn.
TRANG 171
PHN MM NH LNG POMQM
Thi gian (Time) ( t ) : nu phin bn ba thi gian c tnh c s dng,

mt phin bn mt thi gian c tnh c tnh ton v c in cho mi hot
ng. Cng thc c s dng l cng thc truyn thng :
Time = (Opt Time + 4 * Like Time + Pess Time) / 6
Thi gian = (thi gian Opt + 4 * thi gian Like + thi gian Pess) / 6
t = ( a + 4 b + c) / 6
t : ni m (thi gian m), a l thi gian lc quan, b l thi gian nhiu kh nng,
v c l thi gian bi quan.
V d, trong mn hnh, thi gian s dng cho hot
ng t nt 1 n nt 2 l :
( 2 + 4 * 12 + 25 ) / 6 = 75 / 6 = 12.5
Bt u sm Early Start (ES) :
i vi tng hot ng, bt u sm c
s
s (tri)
tnh. V d, khi u cho hot ng t nt 3 n nt 6 l 17,5 ( t = t
+ t)
(xem v trang 31 mn phn tch nh lng trong kinh doanh kinh t lng). Ct c
tn l "Time (thi gian) ( t ) c s dng cho tnh ton ny.
ES = Early Start = The earliest an activity can begin
ES = Bt u sm = mt hot ng sm nht c th bt u
Kt thc sm Early Finish (EF) :
i vi tng hot ng, kt thc sm
n c tnh ton. Trong v d ny, kt thc sm cho hot ng 3-6 l
( tm = tm (phi) t ). Kt thc sm th tt nhin l bt u sm cng thm
gian hot ng. V d, kt thc sm ca 3-6 l khi u sm ca n l
cng thm 5 t ct thi gian (khc cch tnh trong v).
ca
22,5
thi
17,5
EF = Early Finish = ES + Task Time

EF = Kt thc sm = ES + thi gian nhim v
Bt u cui Bt u mun (Late Start) (LS) : i vi tng hot ng, bt
u cui ca n c tnh ton. Trong v d, bt u cui cho cc hot ng 3-6
l 36.
LS = Late Start = LF - Task Time
LS = Start mun = LF - thi gian nhim v
TRANG 172
PHN MM NH LNG POMQM
Kt thc mun kt thc cui (Late Finish) (LF) :

thc cui ca n c tnh ton.
i vi mi hot ng,
kt
LF = Late Finish = The latest an activity can end without delaying the project
LF = Kt thc mun = mt hot ng mun nht c th kt thc m khng cn tr hon d n
Bi than (Slack) (lp khong trng, chng) : vi mi hot ng, lp khong trng
ca n c tnh ton (bng bt u mun Late Start tr i bt u sm Early Start
hoc kt thc mun Late Finish tr i kt thc sm Early Finish). Trong v d,
cc lp khong trng cho hot ng 3-6 l D :
SLACK = LF - EF or LS - ES
41 - 22,5 = 18,5
hoc
36 - 17,5 = 18,5
lch chun (Standard Deviation) : i vi cc m hnh 3 thi gian c tnh,

lch chun ca tng hot ng c lit k. lch chun c cho bng
bi quan tr i lc quan, tt c chia cho 6. Trong v d, lch chun ca 3-6
l ( 7 3 ) / 6 = 67.
SD ( ) = activity standard deviation = (time Pess time Opt) / 6
SD ( ) = lch tiu chun hot ng = (time Pess time Opt) / 6
Thi gian hon thnh d n (Project Completion Time) : thi gian (d kin) m
d n nn c hon thnh l c cho. Trong v d, thi gian ny l 41.
project completion time = the maximum of the early finish times
thi gian hon thnh d n = thi gian kt thc sm ti a
lch tiu chun d n (Project Standard Deviation) :
nu m-un ba thi
gian c tnh c la chn, lch tiu chun d n c in. N c tnh nh
l cn bc hai (Square Root) ca phng sai ca d n, m c tnh nh l tng
ca cc phng sai ca tt c cc hot ng quan trng.
project variance = the sum of the variances of every activity that has slack = 0
phng sai d n = tng cc phng sai ca mi hot ng c chng = 0
Cn thn ! nh gi lch chun qu cao i vi cc d n c nhiu ng
Gantt.
Lu rng ni chung c nhng vn trong vic xc nh phng sai (chnh
lch) Variance ca thi gian hon thnh d n. Ngoi ra, mt s cun sch khc
nhau trong cch tnh ton. Chng trnh ny s nh gi qu cao lch tiu chun
nu c nhiu hn 1 ng i quan trng ng Gantt (Critical Path). Vn bn
ca bn c kh nng khng gii thch phi lm g khi c nhiu hn 1 ng i quan
trng ng Gantt tn ti.
C sn mt bng m hin th cc tnh ton : thi gian ca nhim v, lch
chun, cc chnh lch Variances, nh minh ha trong cc mn hnh sau y :
TRANG 173
PHN MM NH LNG POMQM
N c th hin th biu Gantt cho d n, nh c hin th tip theo :
CPM (DANH SCH MC U TIN)
CPM (Precedence list)

Module ng i quan trng M un ng Gantt (Critical Path Module) c
d liu u vo trong mt thi trang (giao din) gn ging vi m un cn bng
dng lp rp (Assembly Line Balancing Module). Hy xem xt v d c cho
trong bng sau y :
Task
(Nhim v)
design
program
document
test
advertise
(thit k)
(chng trnh)
(ti liu)
(kim tra)
(qung co)
Time
(Thi gian)
25
30
22
10
30
Precedences
(Mc u tin)
design
design
program
design
(thit k)
(thit k)
(chng trnh)
(thit k)
TRANG 174
PHN MM NH LNG POMQM
Mn hnh d liu ban u xut hin nh di y :
Tn nhim v (Task Names) :

nhim v c th c t tn. Thng thng
t tn cc quy c l ng.
l, ch hoa (Uppercase) v ch thng
(Lowercase) khng quan trng nhng khong trng (Spaces) trong mt ci tn
l quan trng.
Thi gian nhim v (Task Times) : thi gian nhim v c nhp vo y.
Mc u tin (Predecessors) (nhim v k trc , phin bn trc , ngi tin
nhim) : mc u tin c lit k y. Nhp vo mt mc u tin ca mi
t bo () bng tnh, vi ln n 7 mc u tin ca mi hot ng. N l
ch nhp mc u tin m ngay trc mt (tc nu c nhiu nhim v k trc
th nhp mi ci mi ct theo cp u tin ca n).
Thay v hin th cc gii php cho vn ny, chng ti cho thy th u tin m
phn mm c th hin th. Trn mn hnh, ng i quan trng ng Gantt
(Critical Path) c hin th trong mu .
TRANG 175
PHN MM NH LNG POMQM
S SP - S VA CHM
(Crashing)
Sau y l mt v d v qun l d n b ri b sp (Crashing). 4 ct d
liu l ct chun cho kiu vn ny, thi gian bnh thng (Normal Time) v chi ph
bnh thng (Normal Cost) cho mi hot ng cng nh l thi gian tai nn thi gian
sp (Crash Time) v chi ph sp (Crash Cost) cho mi hot ng. Thi gian
sp (Crash Time) phi t hn hoc bng thi gian bnh thng (Normal Time),
v chi ph sp (Crash Cost) phi ln hn hoc bng chi ph bnh thng
(Normal Cost).
Kt qu nh sau. Phn mm tm thy thi gian bnh thng (Normal Time) l 16

ngy v thi gian ti thiu (Minimum Time) l 12 ngy. i vi tng hot ng, my
tnh tm thy chi ph sp cho mi giai on (chi ph sp Crash Cost tr i chi
ph bnh thng Normal Cost) chia cho ( thi gian bnh thng Normal Time tr
i thi gian sp Crash Time), m cc hot ng nn c sp v bng
bao nhiu, v t l chi ph ca s sp .
TRANG 176
PHN MM NH LNG POMQM
Mt lch trnh sp ngy vi ngy (day-by-day) l c sn.
D THO NGN SCH - HOCH NH NGN SCH
(Budgeting)
(Cost Budgeting) (Ngn sch chi ph)
Phn mm ny c mt m hnh xc nh s lng tin m s c chi tiu ht
mt vng i ca d n. D liu l chi ph hot ng (Activity Cost) nh c hin th
tip theo. Mt ngn sch bt u sm (Early-Start Budget) v mt ngn sch bt
u mun (Late-Start Budget) c th c tnh ton.
Mn hnh gii php thng xuyn c a ra, nhng hai ci khc cng c sn.
Trong mn hnh k tip, chng ti cho thy mt phn ca ngn sch bt u sm.
TRANG 177
PHN MM NH LNG POMQM
Ngoi ra, th c cha ngn sch bt u sm v bt u mun cho ton b

d n.
PHN PHI BNH THNG - PHN PHI CHUN
(Normal Distribution)
Qun l d n l mt khu vc, ni m cc my tnh (bm tay) phn phi bnh
thng l hu ch nh c hin th trong mn hnh sau y. Trung bnh (Mean)
v lch chun t d n (v d 1) c t ng in vo. Chng ti c mt s ty
chn trong mc ca nhng g m chng ti c th mun tnh ton. V d, chng ta c
th tnh ton xc sut ca s kt thc (hon thnh) trong 50 ngy, hoc mt khong
thi gian t tin (khong tin cy) 95% i vi d n hon thnh. Ngoi ra, chng ta
c th tnh ton bao nhiu ngy cho php 90% chc chn ca s hon thnh
trong thi gian . Chng ti c chn mt khong thi gian tin cy 95%.
TRANG 178
PHN MM NH LNG POMQM
Sau khi nhn nt Tnh (Compute), gii php xut hin nh hnh di y :
Chng ti c 95% t tin rng d n s c hon thnh trong 31-51 ngy.
IU KHIN CHT LNG

(Quality Control)
QUN L CHT LNG
Module ny c 6 khong tin cy khc nhau trong hp phng php, n c th

c s dng cho 3 lnh vc chnh ca kim sot cht lng thng k, chp nhn
ly mu (Acceptance Sampling), biu kim sot (Control Charts), v kh nng x
l (Process Capability). i vi chp nhn ly mu (Acceptance Sampling), c hai :
thuc tnh (Attributes) v cc bin k hoch (Variables Plans) c th c pht trin.
Cc thuc tnh k hoch (Attributes Plans) c s dng khi thc o (Measurement)
l mt kiu o lng khuyt tt (Defective) / khng khuyt tt (Non-Defective), trong
khi cc bin k hoch (Variables Plans) c s dng tham gia mt kt qu
bng s ch khng phi ch n gin l mt p n c / khng (Yes / No). Ngoi
ra, m hnh c th c s dng tnh ton nguy c ri ro (Risk) ca nh sn
xut v ca ngi tiu dng theo mt k hoch ly mu (Sampling Plan) c cho
(nht nh) v / hoc thc hin mt m mu th mt l hng th mt bn v
s b (Crude Plot) ca ng cong iu hnh (hot ng) c trng Operating
Characteristic Curve (OC). i vi biu kim sot (Control Charts), n c th
pht trin bng xp hng (biu ) p (P-Charts) cho t l phn trm khim khuyt
(Percentage Defective), bng xp hng (biu ) x-bar (X-Bar Charts) i vi
trung bnh, hoc bng xp hng c (C-Charts) i vi s lng khuyt tt. Cc mn
hnh cho 3 ty chn u tin l tng t nhau, v mn hnh cho cc biu kim
sot (Control Charts) cng tng t nhau.
TRANG 179
PHN MM NH LNG POMQM
LY MU CHP NHN C
(Acceptance Sampling)
Cc yu t chnh xc trong mn hnh d liu ph thuc vo liu mt k hoch
ly mu (Sampling Plan) thuc tnh (Attributes) hoc k hoch ly mu bin
(Variables) c chn. Trong c hai trng hp, cc loi mn hnh d liu l rt
ging nhau.
Chng ti bt u vi m t ca mn hnh d liu thuc tnh
(Attributes) v trnh by mn hnh d liu bin (Variables) sau.
LY MU THUC TNH
(Attributes Sampling) (find sample plan attributes tm k hoch ly mu thuc tnh)

Cc mc s c ly mu t rt nhiu (t cc l lots) v da trn s lng cc
khuyt tt (number of defects), cc l hoc s c chp nhn hoc b t chi. Mt
k hoch ly mu xc nh s lng cc mc mt hng (number of items) c ly
mu (kch thc mu sample size, n) v s lng ti a cc khuyt tt c cho
php trong mt mu (c, gi tr quan trng critical value).
Mt mn hnh mu bao gm c d liu v gii php xut hin bn cnh :
D LIU
(Data)
Cht lng chp nhn c Acceptable Quality Level (AQL) : i vi ly
mu chp nhn c, cht lng chp nhn c (AQL) phi (nghim chnh ,
ng) ln hn 0 v phi nh hn 1. Gii thch ca 0,0100 l mt AQL ca 1%
khuyt tt.
T l phn trm khuyt tt nhiu dung sai Lot Tolerance Percent Defective
(LTPD) : t l phn trm khuyt tt nhiu dung sai phi c nhp vo. iu ny
c c im tng t nh cc AQL. N phi l gia 0 v 1.
Nguy c ca nh sn xut Producers Risk (ALPHA) : xc sut ca mt li
loi 1 c th c thit lp bng cch s dng hp th xung l mt trong hai : 1%,
hoc 5% trong ly mu thuc tnh. i vi ly mu bin, nhp cnh ny l s,
vi mt gi tr cho php ti a l 0,99.
Nguy c ca ngi tiu dng Consumers Risk (BETA) : xc sut ca mt li
loi 2 c th c thit lp l 1%, 5% hoc 10% i vi ly mu thuc tnh. i vi
ly mu bin, nhp cnh ny l s, vi mt gi tr ti a l 0,1.
TRANG 180
PHN MM NH LNG POMQM
Da trn 4 thit t ny, chng trnh tnh ton kch thc mu v gi tr quan trng,
hoc trong mt s trng hp, cc trng thi (states) m gi tr quan trng l qu ln
(chng trnh khng th tm thy k hoch ly mu nu gi tr quan trng ln hn 49)
Ngoi ra, xc sut thc t (actual probabilities) ca vic (making) li loi 1
type 1 error v li loi 2 type 2 error c tnh ton (xem bn di kt qu).
GII PHP
(Solution)
Mt vn mu v mn hnh gii php xut hin trong mn hnh trc. Trong
v d ny, chng ti ang c gng xc nh k hoch ly mu thch hp khi AQL
c quy nh c th ti 1%, LTPD c quy nh c th mc 5%, Alpha l
5% v Beta l 10%.
Kch thc mu (The Sample Size) : kch thc mu ti thiu m p ng cc
yu cu trn c xc nh v hin th. Trong v d ny, kch thc thch hp l 137.
Gi tr quan trng ti hn (The Critical Value) : s ti a Maximum Number
ca cc n v khuyt tt Defective Units (ly mu thuc tnh) hoc trung bnh
ti a bin Maximum Variable Average (ly mu bin) c hin th. Trong v d
ny, s cho php ti a ca cc khuyt tt Maximum Allowable Number l
trong 82 n v l 3.
Hai gi tr u ra b sung xut hin bn phi, ch ra rng nhng ri ro
thc t Actual Risks khc vi nhng ri ro c th Specified Risks. Chng trnh
c thit k tm kch thc mu ti thiu Minimum Sample Size m p
ng cc yu cu. Cc yu cu c th c gp nhiu hn do tnh cht s nguyn
(do s nguyn t nhin) ca kch thc mu v gi tr quan trng.
Ch : cc tnh ton ca nhng ri ro thc t Actual Risks da trn phn
phi nh thc (Binomial Distribution).
Nguy c ca nh sn xut thc t (Actual Producers Risk) : nguy c ca nh
sn xut u vo l cp cao i vi nguy c ca nh sn xut cho php.
Nguy c ca nh sn xut thc t c th t hn v c hin th. Trong v d ny,
n xy ra l 0,0495 m gn tng t nh l 0,05 m c thit lp nh l
u vo.
Nguy c ca ngi tiu dng thc t (Actual Consumers Risk) : cc ri ro ca
ngi tiu dng u vo l cp cao i vi ri ro cho php. Ri ro ca
ngi tiu dng thc t c th t hn v c hin th. Trong v d ny, n xy
ra l 0,0844 ; m t hn so vi c thit lp l 0,1 m c nhp vo nh
l u vo.
Find Errors / OC Curve tm li / ng cong OC
y l m hnh xc nh cc li khi a ra mt k hoch ly mu. Mt k hoch
ly mu c cho bi kch thc mu (n) v cc quan trng gi tr (c). Cc li c
xc nh ti AQL v LTPD. a ra 4 gi tr n, c, AQL v LTPD, chng trnh s xc
nh ri ro ca sn xut producer's risk = xc sut ca mt li loi 1 type 1 error
v , xc nh ri ro ca ngi tiu dng consumer's risk = xc sut ca mt li
loi 2 type 2 error (). Chng trnh cng c th hin th mt ng cong hot
TRANG 181
PHN MM NH LNG POMQM
ng c trng operating characteristic curve.

y l mt m mu mt bn v
(plot) ca cc xc sut chp nhn c (trn trc y) so vi t l phn trm ca cc
khuyt tt (trn trc x). Hai phin bn khc nhau ca ng cong OC c th c v.
Kt qu :
Kch thc mu v gi tr quan trng c hin th cho ly mu thuc tnh. Bng
c dng tnh ton ny l t thng k k thut ca Bowker v Lieberman,
Prentice-Hall, 1959, trang 462. Bng c thit k trong th t m bo rng c
v s c p ng tt p hn. Chng trnh cng hin th v thc t
da trn mt phn phi nh thc (binomial distribution).
Cc li c tnh ton bng mt phn phi nh thc. iu ny c th khc t mt s
kt qu khc m dng mt phn phi Poisson.
Hn na, cc tnh ton c thc
hin lin quan regard ti kch thc mu, nhng khng c lin quan n kch thc
l lot size. l, mt phn phi nh thc gi nh rng kch thc l l rt ln (v
hn). Xc sut thc t khng ph hp vi chnh xc xc sut c cho i vi nguy c
ca nh sn xut v nguy c ca ngi tiu dng. H nn c t nht gn nh tt (khng
cao).
Mt ng cong hot ng c trng Operating Characteristic Curve (OC)
c th c hin th nh minh ha sau :
ng cong cht lng i ra trung bnh Average Out-going Quality Curve (AOQ)
cng c sn ( chnh l cht lng chp nhn c AQL ).
TRANG 182
PHN MM NH LNG POMQM
V D 2 :
LY MU BIN
(Example 2 : Variables Sampling)

Find sample plan Variables tm k hoch ly mu bin.
Cc mc s c ly mu t cc l v mt o lng s c thc hin. Da trn
cc o lng trung bnh trong mu, cc l hoc s c chp nhn hoc b t chi.
Mt k hoch ly mu xc nh s lng cc mc c ly mu, (kch thc mu
sample size, n) v mc trung bnh ca mu ti a hoc ti thiu c cho php
(gi tr quan trng critical value). Tt c cc xt nghim trong m hnh ny l mt ui
(one-tailed).
K hoch ly mu c thit k p ng cc thng s k thut nht nh. Cc
thng s k thut l u vo ca m hnh ny. Chng bao gm gi tr trung bnh d kin
expected mean (0), gi tr trung bnh thay th alternative mean (1), lch tiu
chun (standard deviation), nguy c ca nh sn xut producers risk, alpha () v
nguy c ca ngi tiu dng consumers risk, beta (). Da trn 5 thit t ny
chng trnh tnh ton kch thc mu (sample size) v gi tr quan trng (critical
value).
Tip theo chng ti trnh by cc d liu v u ra cho mt k hoch ly mu
bin Variables Sampling Plan. Chng ti mun chp nhn rt nhiu nu trung
bnh (Mean) l 200 kg, nhng t chi rt nhiu nu trung bnh l 180 kg. lch
chun (Standard Deviation) ca cc mt hng sn xut l 10 pslong (10kg).
Chng ti ang s dng 5% v 10% cho alpha v beta tng ng. i vi ly
mu bin (Variables Sampling), alpha v beta l s ch khng phi l ci sn
bi hp th xung. V d tip theo s minh ha iu ny r rng hn.
TRANG 183
PHN MM NH LNG POMQM
u ra l rt tng t nh u ra i vi ly mu thuc tnh (Attributes

Sampling). Trong v d ny, chng ta nn ly 3 mc mu v cn nhc chng.
Nu trng s trung bnh (Average Weight) t hn 189.8964 pound, chng ta nn
t chi rt nhiu.
BIU IU KHIN - BIU KIM SOT - BNG XP HNG KIM SOT
(Control Charts)
Cc ty chn th 4, th 5 v th 6 t menu con c s dng pht trin
cc biu kim sot.
Ty chn 4 c s dng khi t l phn trm ca cc
khuyt tt (Percentage of Defects) l la chn quan tm (Interest). Ty chn 5
khi l mt thc o bin (Variable Measurement) v mt biu x-bar
hoc biu phm vi r-bar (Range Chart) (c th l Mean , Range thuc x-bar)
l c yu cu (l bt buc). Ty chn cui cng l i vi s ca khuyt tt
Number of Defects (phn phi nh l mt bin ngu nhin , phn phi ca Poisson
Poisson Random Variable). Trong bt k cc trng hp ny, n l cn thit
ch ra lm th no c nhiu mu.
V D 3 :
BIU QUN RU P - BIU BNG XP HNG P
(Example 3 : A p-bar chart)

Nu s lng mu l 1 th chng trnh s yu cu bn cho ng trung tm
Dng trung tm center line (p-bar). Dng trung tm c nhp vo l t l phn
trm ca cc khuyt tt v do phi gia 0 v 1 (v tt nhin, rt gn vi 0). Da
trn hai mnh thng tin ny, th bng xp hng p-bar s c trnh by.
Nu s lng mu ln hn 1 th chng trnh s yu cu bn nhp s lng
cc khuyt tt trong mi mu. Da trn thng tin ny, chng trnh s tnh ton p-bar,
t l trung bnh ca cc khuyt tt average percentage of defects, lch
chun ca p-bar standard deviation of p-bar, v cc gii hn kim sot trn v
di upper and lower control limits i vi bt k ci no trong 4 mc t cy
va nu (confidence levels).
M-un bt u bng cch yu cu cc con s ca mu. Trong v d 3, m c
hin th trong mn hnh sau y, chng ti in vo mt ct d liu cho thy s ca cc
khuyt tt (Number of Defects) trong 10 mu. Ngoi ra, chng ti c yu cu mt biu
kim sot (Control Chart) 3-sigma pha trn. Pha trn (ti Sample Size) ch
ra rng kch thc mu i vi mi mu ny l 150. Cui cng, bn c th chn
TRANG 184
PHN MM NH LNG POMQM
ng trung tm (Center Line , 0 = Use Mean) bng cch s dng kt hp hp /

thanh cun hoc li n mc 0 trong trng hp m phn mm s s dng trung
bnh (Mean).
Chng trnh tnh ton t l phn trm trung bnh ca cc khuyt tt

(Average Percentage of Defects), m c hin th nh l 3,8% (0,0380). lch
chun (Standard Deviation) ca p-bar c hin th pha trn bn phi nh l
0,0156.
Mt biu kim sot (Control Chart) cng c th c hin th v c
trng by di y :
TRANG 185
PHN MM NH LNG POMQM
V D 4 :
BIU PHM VI V BIU X-BAR
(Example 4 : an x-bar and range chart) (Mean and Range Charts)

Nu s lng mu l 1 th chng trnh s yu cu bn cho ng trung tm v
phm vi. Da trn hai mnh thng tin ny, biu gii hn kim sot x-bar v phm
vi s c trnh by.
Nu s lng mu ln hn 1 th chng trnh s yu cu bn nhp vo kch thc
mu v hoc mt trong hai trung bnh mu v phm vi, hoc d liu th trong mi
mu. Da trn thng tin ny, chng trnh s tnh ton gi tr trung bnh tng th v
phm vi trung bnh v trn v di gii hn kim sot. Gii hn kim sot c tnh
ton da trn cc gi tr trnh (tabled values) cho biu bng xp hng trung
bnh v phm vi.
Sau khi s lng mu c nhp vo, c hai la chn. Hoc l cc d liu th
(Raw Data) c th c nhp vo hoc gi tr trung bnh (Mean) v phm vi (Range)
cho mi mu c th c nhp vo. Chng ti s hin th c hai. Trong v d ny, chng
ti hin th cc d liu v u ra cho bng xp hng (biu ) gi tr trung bnh (x-bar) v
phm vi (r-bar). 6 mu ca 5 mc (mt hng) c thc hin v trng s ca chng
c ghi nhn. Cc mu u tin c mt trng s trung bnh (Average Weight) l
561,9 (pounds, kg) v mt phm vi (Range) l 25,3. Biu kim sot (Control
Charts) c thit lp da trn phm vi (Range) (mt s tc gi thit lp biu kim
sot da trn lch tiu chun ch khng phi l phm vi). Biu trung bnh (Mean)
v phm vi (Range) bn phi c da trn 3 lch chun. Ch rng, thay v thit
lp ng trung tm (Center Line) ca biu trung bnh (Mean Chart) theo trung bnh
tng th, chng ti thit lp mt c im k thut (Specification) l 555 bng cch
s dng thanh cun / hp trn d liu.
TRANG 186
PHN MM NH LNG POMQM
V D 5 : S DNG D LIU TH TRONG BIU X-BAR V BIU PHM VI
(Example 5 : Using raw data in x bar and range charts)

Mn hnh sau y trnh by cc d liu cho mt v d vi d liu th :
Phn mm tnh ton gi tr trung bnh v phm vi cho mi mu v sau tnh ton
biu kim sot.
V D 6 : BIU C
(Example 6 : c-charts)
Cc biu bng xp hng ny c s dng o lng cc khuyt tt cho mi
mc (mi mt hng). M hnh c th c s dng theo hai cch khc nhau ty thuc
vo phn ng ti mn hnh to ra m yu cu s lng mu.
Nu s lng mu l 1 th chng trnh s yu cu bn cho kch thc mu v
tng s khuyt tt c tm thy. Da trn hai mnh thng tin ny, biu bng xp
hng c s c trnh by.
Nu s lng mu ln hn 1 th chng trnh s gi nh mt kch thc mu l 1
mc v yu cu bn nhp vo s lng khuyt tt trong mi mu (ca kch c 1). Da
trn thng tin ny, chng trnh s tnh ton gi tr trung bnh tng th (lambda) v trn
v di gii hn kim sot.
Mn hnh sau y c cha mt mu biu c. S lng mu c nhp vo
theo sau s lng khuyt tt trong mi mu. Chng trnh tnh ton v hin th t l
khuyt tt (4.4), lch tiu chun ca n (2,0976), v cc gii hn kim sot.
TRANG 187
PHN MM NH LNG POMQM
KH NNG QU TRNH
(Process Capability)
i vi kh nng x l, dung sai trn (Upper Tolerances) v di (Lower
Tolerances) cho mt qu trnh phi c thit lp. Ty chn, trung bnh c th c
thit lp. Nu trung bnh khng c thit lp th cc im trung tm (Center Point)
gia dung sai trn v di s c s dng. Cui cng, lch chun phi c
cho. C hai ch s trn v di c tnh ton, v kh nng qu trnh l ti thiu ca
hai ch s ny.
TIN CY
(Reliability)
Cc m-un tin cy s tnh ton tin cy ca h thng n gin. Nu n c
s dng nhiu ln, h thng phc tp c th c pht trin. Module ny c th d
dng c s dng xc nh s lng thch hp phn sao lu d phng ch ch
(standby) ca cc thnh phn. Module ny c 5 m hnh con. Khun kh chung cho 3
ci u tin l ging ht nhau, v khun kh cho 2 ci sau l ging ht nhau.
TRANG 188
PHN MM NH LNG POMQM
Module ny c 5 m hnh con m c th c s dng tnh ton tin cy

ca mt lot cc thnh phn song song ( tin cy ca cc thnh phn song song
parallel trong mt series) (reliability of a series of parallel components).
M hnh chung l nh sau, cc u vo ban u bao gm :
Tiu vn .
S lng cc thnh phn (components) m trong chui (series) v kch
thc ln nht ca bt k thnh phn no trong cc thnh phn ny.
V d , gi s chng ta c mt h thng (system) nh c cho bi s
(diagram) di y :
>X>
>X>
>X>
>X>
>X>
>X
>X>
iu ny i din cho 4 h thng (system) trong series (t tri sang phi) vi
cc thnh phn l 1, 3, 2 v 1. Cc gi tr c nhp vo lc khi to l 4 i vi
s lng thnh phn trong mt lot (series) v l 3 i vi s ln nht trong
song song parallel (s ln nht largest number trong parallel).
( Mt series ni tip c 4 h thng parallel song song, trong c mt
parallel c gi tr ln nht l 3 tc c 3 thnh phn ni tip ) .
Cc u vo i vi bng d liu chnh l xc sut m mi thnh phn s lm
vic. Xc sut m c lit k nh l 0 c b qua.
Xin lu rng m hnh u tin trong s di y c th c gii quyt mt
cch d dng bi v n bao gm 3 thnh phn ni tip nhau (3 serial components)
vi 1 n v ch n gin l bn gc v 1 bn sao lu, phn cui s bao
gm 1 thnh phn ni tip phc tp. N s cn phi c chia thnh 2 vn
POM ring bit trong th t c gii quyt.
TRANG 189
PHN MM NH LNG POMQM
M hnh th 2 v th 3 cho php lit k cc yu t trong mt series duy nht

hoc mt danh sch cc yu t trong parallel.
Cc m hnh th 4 v th 5 c tt c cc yu t ging ht nhau hoc trong
parallel hoc trong series. S lng cc yu t c nhp vo trong hp vn
bn / di chuyn trn d liu.
Kt qu :
Dng in m giu tn pha di cho cc tin cy i vi mi h thng
song song parallel systems. Di , tin cy ca h thng tng th c
tnh ton.
D LIU
(Data)
Khun kh chung cho tin cy c cho bi cc s ca h thng n gin m
trong mt lot trong mt s ri (Series) v s lng ti a ca cc thnh phn trong
bt k h thng n gin no. Bi mt h thng n gin, chng ti nh ngha rng n
l mt tp hp (mt thit lp) ca cc thnh phn song song m khng cn bt k Series
no. Trong v d sau y, chng ti ang thit lp mt h thng vi 4 h thng n gin
trong Series. S lng ln nht ca cc thnh phn trong bt k ci no trong 4 h
thng n gin ny u l 6 ( n = 6 ). ch l mt kiu d liu m cn phi c
nhp.
tin cy thnh phn (Component Reliability) : cc thng tin cn thit l tin
cy ca mi thnh phn. N c s dng tnh ton tin cy ca 1 lot (Series)
song song n gin c i din bi ct.
Ch : y l mt m-un m s dng ty chn khng hin th s 0 s lm
cho cc d liu hin th d c hn.
GII PHP
(Solution)
Mt mn hnh gii php mu cng cha cc d liu c a ra tip theo. Ch
rng cc hng (Row), trong xc sut c nhp vo khng quan trng, nh minh
chng bi thc t rng h thng 1 v 2 c cng tin cy l 99%.
tin cy h thng n gin (Simple System Reliability) : bn di mi h thng

song song (ct), tin cy ca n c trnh by. tin cy r ca cc thnh phn n
song song c cho bi :
r = 1 [ (1 - r1) (1 - r2) ... (1 - rn) ]
TRANG 190
PHN MM NH LNG POMQM
rj l tin cy ca cc thnh phn c nhn th j (jth).
Trong v d, cc thit lp
song song u tin c mt tin cy ca mt thnh phn ca n, l 0,99 cng ng
cho thit lp th 2, th 3 c mt tin cy tng th l 0,999856 ; nh c lit k
di cng ca ct th 3; v th 4 c tin cy l 0,999872
H thng ng tin cy (System Reliability) : tin cy ca h thng tng th c
cho pha di. tin cy tng th l sn phm ca tin cy hng lot c nhn song
song. V d c mt tin cy ca h thng l 0,979834
V D 2 : XC NH S LNG CA BACKUP (SAO LU)
(Example 2 : Determining the number of backups)

C th tnh ton s lng bn sao lu (Backup) cn thit theo th t m bo
tin cy ca h thng (System Reliability) quy nh cho mt h thng song song. V
d, gi s rng tin cy ca mt thnh phn c nhn l 50% v tin cy mong
mun ca h thng l 99%. Sau , bng cch to ra mt bng vi khng c sao lu
(no backups), 1 bn sao lu (1 backup), 2 bn sao lu (2 backup), v.v... s lng
thch hp ca cc bn sao lu c th c tm thy (y l mt phng php iu tra).
i vi tin cy quy nh c th l 50% v 99% chng ta thy t bn di rng s
lng thch hp ca cc thnh phn l 7 tc c 6 bn sao lu (Six Backups).
THNH PHN SONG SONG GING HT NHAU HOC NI TIP HT NHAU
(Identical Parallel or Identical Serial Components)

Ngoi ra, mt m hnh con khc c th c s dng. Cc m hnh con th 4 v
th 5 trong m-un tin cy c th c s dng tnh ton tin cy ca h thng
song song vi cc thnh phn ging ht nhau hoc cc h thng trong mt lot (trong
Series) vi cc thnh phn ging ht nhau.
TRANG 191
PHN MM NH LNG POMQM
Di y, chng ti cho thy mt mn hnh cho cc thnh phn song song ging ht
nhau. Ch c 2 mt hng c nhp vo.
S song song (Number in Parallel) : trong bng iu khin d liu thm pha trn
bng d liu, c mt s kt hp thanh cun / hp vn bn m chng ti t s lng cc
thnh phn. Trong v d ny, chng ti ang ch ra rng c 10 thnh phn ging ht
nhau (1 bn gc v 9 bn sao lu).
tin cy hnh phn (Component Reliability) : bng d liu i hi mt phn
ca thng tin. y l tin cy ca cc thnh phn. Trong v d ny, chng ti c mt
thit t l 0,5 ch ra rng trong s 10 thnh phn song song c 1 tin cy l 50%.
GII PHP
(Solution)
Gii php ch ra rng tin cy tng th l 0,999023 ng vi mn hnh hin th
chi tit hn trong cc mn hnh trc trong ct 10.
S M PHNG
(Simulation)
Cc m hnh m phng c s dng to ra cc gi tr (Value) t phn b
(phn phi) xc sut ri rc hoc cc bng tn s (Frequency). Ln n 10 loi (10
chuyn mc) c th c m phng, v ln n 10.000 s c th c to ra trong mi
th nghim. S lng v t l xut hin ca mi th loi c hin th, v th h ca
nhng con s c th c xem trn mt c s tng bc theo bc (step-by-step).
Bn c th m phng phn phi tn s (frequency distributions), phn phi xc
sut (probability distributions). u vo ban u l :
Tiu vn .
S lng chuyn mc th loi categories (ln n 10).
to ra mt vn m phng, n l cn thit cung cp s lng danh mc cho
d liu. Trong mn hnh sau y, chng ti cho thy mt mn hnh vi d liu v gii
php cho mt m phng ca 10 chuyn mc.
TRANG 192
PHN MM NH LNG POMQM
Cc yu t d liu l :
S lng th nghim (The Number of Trials) : y l s lng cc s ngu nhin
c to ra. Ln n 10.000 th nghim c th c to ra.
Ht ging (Seed) : khi s dng m phng, mt ht ging i vi s pht sinh ngu
nhin (Random Number Generator) phi c cho. Ht ging mc nh trong my
tnh l 0. Nu bn s dng cng mt ht ging hoc hai ln dng hoc ct, cng mt tp
hp (mt thit lp) ca cc s ngu nhin s c to ra. Ni cch khc, chy cc th
nghim khc nhau, bn phi thit lp li qu trnh th h s ngu nhin (s pht sinh
ngu nhin) bng cch thay i ht ging.
Pha trn bng d liu, hp phng php cho php bn la chn liu cc s ngu
nhin (random numbers) c to ra bi chng trnh hoc c ly t vn bn ca
bn (nu bn s dng mt cun sch gio khoa Render hoc Taylor). C cng mt
hp d liu b sung i vi s th nghim (number of trials) v khc l i vi mt
ht ging seed (hoc s dng hoc s ct). Bng cch thay i ht ging, bn c
th c hot ng khc ca m phng (simulation). Nu bn li ht ging, kt
qu s cng nh vy.
Kt qu :
Chng trnh s tnh ton v hin th tng tn s (total frequency) v quy m
(scale) tt c mi th ph hp.
Ct xc sut (Probability) chuyn i cc tn s (Frequencies) thnh cc
tn s tng i (Relative Frequencies) theo :
Prob (Probability) = Frequency / Total Frequency
Ct xc sut tch ly (cumulative probability) tch ly tng hot ng. iu
ny c s dng quyt nh trong th loi (category) m mt quan st
(observation) trt b ri rt ng (falls).
Ct gi tr * tn s (value * frequency) c s dng tnh ton gi tr k
vng gi tr d kin (expected value).
TRANG 193
PHN MM NH LNG POMQM
Nhng ln xut hin cc bin c (occurrences) tr khp khng khp (tallies)

vi tng s cc bin c i vi th loi (category) m t m phng (simulation)
ca chnh n.
Bin c tch ly (cumulative occurrences) tch ly tng hot ng ca cc
bin c (occurrences).
T l th hin cc bin c c chia bi tng s cc th nghim (total
number of trials).
Ch : i vi Heizer / Render, Taylor hoc Render / Stair / Hanna l nhng
ngi dng phng php th h s ngu nhin sau y l c sn :
Phng php to s ngu nhin (Random Number Generation Method) : c hai
cch c bn m cc s ngu nhin c th c to ra. N c th c cc phn mm to
ra cc s ngu nhin v sau chuyn i chng sang cc tn s mong mun (Desired
Frequencies), hoc n c th s dng cc s ngu nhin t mt bng trong mt cun
sch.
Gi tr (Value) : cc gi tr cho cc bin c a ra y. Trong v d, chng l
t 1 n 10, nhng chng c th thit lp (tp hp) bt k gi tr no. Chng c s
dng cho vic tnh ton gi tr k vng gi tr d kin (Expected Value).
Th loi tn s tn s chuyn mc (Category frequencies) : cc tn s cho mi
th loi c nhp vo y. y phi l khng m (Nonnegative) nhng khng cn
phi l s nguyn (Integer), cng khng lm cho chng cn phi tng hp bt c iu g
c bit (chng hn nh 1 hoc 100), khi chng trnh s tng cng ct ny v quy m
kt qu.
Trn bng d liu chnh, mi th loi (category) nhp vo gi tr ca th loi
(ty chn) v nhp vo cc tn s (frequency). Cc tn s khng c tng hp ti
1 hoc 100 nh l chng s c iu chnh da trn tng ca chng bi
chng trnh.
V D : M PHNG NG VAI MT BNG TN S
(Example : Simulating a frequency table)

Trong mn hnh trc, chng ti hin th 10 loi vn (th loi) v gii php ca
n. pha trn (Number of Trials), n c th c nhn thy rng chng ti yu cu
cho 50 th nghim, vi cc my tnh to ra cc s ngu nhin v ht ging ang l 3.
Gii php bao gm sau y :
Tng s (Total) : y l tng s ca ct tn s (Frequency), v nh cp
trc khi c s dng m rng quy m (Scaling). Trong trng hp ny, chng ti
s chia tn s bng 39 trong th t xc nh tn s tng i (Relative Frequencies)
hoc xc sut (Probabilities).
Xc sut (Probability) : ct ny i din cho tn s quy m (Scaled Frequency)
mi th loi c cho bi tn s (Frequency) chia cho tng tn s (Total Frequency).
V d, loi 2 c mt tn s tng i l 8 chia cho 39, hay 20,51%.
Xc sut tch ly (Cumulative Probability) : xc sut tch ly l cn thit
chuyn i cc s ngu nhin ng nht thng nht (Uniform Random Number) t
my tnh hoc mt cun sch ti tn s tng i thch hp (Appropriate Relative
Frequency). Xc sut tch ly ch n gin l cng dn cc xc sut. V d, xc sut
tch ly cho th loi 3 l : 0,0256 + 0,2051 + 0,0769 = 0,3077.
TRANG 194
PHN MM NH LNG POMQM
Gi tr * Tn s (Value * Frequency) : ct ny c s dng tnh ton trung

bnh trng s (Weighted Average) hoc gi tr d kin (Expected Value) ca tn s
phn phi (Frequency Distribution). Trong v d ny, tng ct l 5,2051 ; m l
trung bnh c trng s ca ct 2 hoc gi tr d kin ca phn phi.
Nhng ln xut hin nhng bin c (Occurrences) : y l m s ln th loi
ny c to ra. Cc bin c c nhn (Individual Occurrences) c th c nhn thy
bng cch hin th lch s. Trong th nghim ny, th loi 4 c to ra 3 ln.
T l phn trm (Percentages) : y l cc bin c (Occurrences) chia cho tng
s cc th nghim (Number of Trials). V d, 3 bin c ca th loi 4 chim 6% trong
tng s 50 th nghim.
Bin c * Gi tr (Occurrences * Value) : ct ny c s dng tnh ton bnh
qun (trung bnh) trng s ca phn phi tn s m phng (Simulated Frequency
Distribution). Trong v d ny, tng ct l 281, m c chia bng 50 hot ng
sn lng (50 bin c) 1 trung bnh trng s l 5,62.
Mt danh sch ca 50 s c nhn c th c hin th.
Cc s thng nht u tin c to ra l 0,37 v iu ny ng vo gia khong

0,3077 v 0,4103 ; tch ly cho nhm (th loi) 4, do , loi 4 c chn. S ngu
nhin c to ra th hai l 0,5337 v iu ny nm trong khong 0,4615 v 0,5897 ;
do , loi 6 c ch nh.
TRANG 195
PHN MM NH LNG POMQM
CC S LIU THNG K
(Statistics)
Cc module thng k c s dng tnh ton gi tr trung bnh (Mean), hoc gi
tr d kin (Expected Value) hoc trung bnh trng s (Weighted Average) ca d liu,
d liu nhm (grouped data) v lch tiu chun (Standard Deviation) ca mt
mu (Sample) hoc dn s (Population) hoc mt bng tn s (Frequency Table)
hoc mt phn phi xc sut (Probability Distribution), cc tnh ton phn phi chun
(normal distribution). Ngoi ra, my tnh phn phi chun c th c thc hin
bng cch s dng m-un ny. Cng c my tnh phn phi bnh thng (chun),
c hin th trong Qun l d n (Project Management) phn thc hin cc tnh ton
tng t nh m hnh ny. N c mt thit k u vo tt hn mt cht (bi v n
khng b gii hn l mt bng) nhng n khng th lu cc tp tin nh m-un ny c
th.
Cc u vo ban u l s lng cc gi tr (number of values) v loi d liu
(type of data). i vi mt danh sch cc d liu, iu ny to ra mt bng vi
mt ct i vi d liu nhp cnh, trong khi i vi mt bng tn s (frequency)
hay mt bng xc sut (probability), iu ny to ra mt bng vi hai ct s. Ct u
tin cha cc gi tr (x), trong khi ct th hai cha cc tn s hoc trng s
(weights) hoc xc sut .
M hnh ny cng hu ch cho vic tnh ton s lng s c (breakdowns) d
kin (expected) trong bo tr (Maintenance) v tin cy (Reliability).
Khi to ra mt thit lp d liu bn s c yu cu di gc bn tri ca mn
hnh sng to v kiu thit lp d liu m bn mun. Chng ti s hin th v d cho mi
kiu.
TRANG 196
PHN MM NH LNG POMQM
V D 1 :
TNH TON THNG K TRN D LIU TI TH
(Example 1 : Computing statistics on raw data)

Mt mn hnh mu m bao gm mt danh sch 10 mc (mt hng) v cc gii php
xut hin di y.
Gi tr (Value) : ct u tin cha cc gi tr s (xi).
Hai ct tip theo hin th cc tnh ton m c s dng cho phng sai chnh
lch (Variance) v lch chun (Standard Deviation). Ct cui cng hin th cc
d liu theo th t sp xp.
Cc kt qu bao gm, trung bnh (Mean), trung bnh khong gia (Median),
ch gi tr ln nht ca X (Mode), dn s chia bi n (Population) v mu
chia bi -1 (Sample),
phng sai chnh lch (Variances), v lch chun
(Standard Deviations), ti thiu (Minimum), ti a (Maximum), v phm vi (Range).
C cng mt th c sn v mt biu m c th c tnh ton cho d liu.
V D 2 :
TN S
(Example 2 : Frequencies)
Trong v d di y, chng ti c nhp vo d liu c nhm.
TRANG 197
PHN MM NH LNG POMQM
Trung im hoc gi tr (Midpoint or Value) : y l gi tr c s dng cho

tnh ton.
Tn s hoc Xc sut (Frequency or Probability) : cc tn s cho mi th loi
c nhp vo y. y phi l khng m nhng khng cn phi l s nguyn, cng
khng lm chng cn phi tng hp bt c iu g c bit (chng hn nh 1 hoc 100),
khi chng trnh s tng cng ct ny v quy m kt qu.
Tng s (Total) : y l tng s ca ct tn s, v nh cp trc y, c
s dng m rng quy m.
T l phn trm (Percent) : ct ny i din cho tn s quy m (Scaled Frequency)
cho mi th loi, c cho bi tn s chia cho tng tn s.
Gi tr * Tn s (Value * Frequency) : ct ny c s dng tnh ton trung
bnh trng s (Weighted Average) hoc gi tr d kin (Expected Value) ca phn phi
tn s (Frequency Distribution) c cho nht nh. Trong v d ny, tng ct l
122.216 m chng ti chia bng s quan st Number of Observations (1,508)
ly c gi tr trung bnh (Mean) l 81,0451.
xi-xbar : trong th t tnh ton lch tiu chun, chng ta cn tnh ton
gi tr xi tr i x-bar .
xi-xbar^2 : gi tr trc ( trn) c bnh phng.
(x-xbar^2) * f i : cc gi tr bnh phng c tnh theo xc sut v tng kt .
TNH TON S LIU THNG K CHO MT PHN PHI XC SUT
(Computing statistics for a probability distribution)

C hai d liu v kt qu l trn mn hnh kt qu di y.
TRANG 198
PHN MM NH LNG POMQM
Gi tr (Value) : y l gi tr c s dng cho tnh ton.

Xc sut (Probability) : cc xc sut cho mi th loi c nhp vo y. y
phi l khng m v phi tng hp ti 1.
Tng s (Total) : y l tng s ca ct xc sut v tt hn l 1 (v hn 1 l toi).
Tch ly (Cumulative) : cc xc sut tch ly c trnh by. Xc sut tch ly ch
n gin l tng ca cc xc sut. V d, xc sut tch ly cho gi tr 3 l :
0,4 + 0,25 + 0,15 = 0,8
Gi tr * Xc sut (Value * probability) : ct ny c s dng tnh ton trung
bnh trng s (Weighted Average) hoc gi tr d kin (Expected Value) ca phn
phi tn s (Frequency Distribution) c cho nht nh. Trong v d ny, tng
ct l 2,3 ; m l trung bnh trng s ca 2 ct hoc l gi tr d kin hoc
phn phi trung bnh (Mean of the Distribution).
k mu : tnh ton lch chun (Standard Deviation), chng ta cn phi tnh
ton gi tr xi tr i x-bar .
k - mu ^ 2 : gi tr trc ( trn) c bnh phng.
cc gi tr bnh phng c tnh theo xc sut v tng kt.
Phng sai chnh lch (Variance) cho d liu ny l 2,11
(k - mu ^ 2) * p(x) :
PHN PHI BNH THNG CHUN
(The Normal Distribution)

Bn cn ch ra trn mn hnh sng to liu bn mun tnh ton s ngt
(CutOffs) (CutOff) (Cut-Off) cho mt xc sut hoc tnh ton xc sut cho mt
s ngt hoc ngt .
TRANG 199
PHN MM NH LNG POMQM
Trong v d qun l d n ca chng ti, chng ti tnh ton s ngt

(Cutoffs) cho mt xc sut 95%, v vy trong v d ny, chng ti s tnh ton
xc sut cho Cutoffs. Cc d liu v kt qu xut hin trong mn hnh kt qu.
Mt ln na, mt th l c sn.
TRANG 200
PHN MM NH LNG POMQM
M HNH VN TI
(Transportation)
See also : Linear Programming , Assignment
Module ny c s dng gii quyt vn vn chuyn vn ti.
Tt nhin, module ny c th c s dng gii quyt cc vn khc nh
vn : chuyn nhng phn cng cng vic (Assignment) v cc vn k
hoch sn xut (Production Planning).
Ch : m un k hoch tng hp (Aggregate Planning) c cha mt ty chn
m hnh vn ti.
D LIU
(Data)
Vn giao thng vn ti cu trc theo s lng ngun gc (Origins) ca vn
v s lng im n (Destinations).
Hm mc tiu (Objective Function) : trong khi ti thiu ha l mc tiu thng
thng trong giao thng vn ti, th hoc l ti thiu hoc l ti a c th c la
chn ti thi im m cc thit lp d liu c to ra, nh thng l mn hnh chnh
sa, thng qua hp mc tiu (Objective Box) trn thit lp d liu.
Lu : hng gi (dummy rows) hoc ct gi (dummy columns) khng cn
phi c bao gm. Chng trnh s lm iu ny cho bn.
Hy xem xt v d sau y. Mn hnh d liu ban u ca chng ti i vi vn
mu 5-by-6 ny nh sau :
TRANG 201
PHN MM NH LNG POMQM
Ch rng mt nt Bc (Step) xut hin trn thanh cng c.

Mc tiu (Objective) : hm mc tiu c th c thay i trong phng php la
chn thng thng.
Chi ph vn chuyn (Shipping Costs) :
cc phn thng tin chnh l chi ph vn
chuyn t mi ngun gc (Origin) ti mi im n (Destination).
Ch : nu bn nhp vo mt X cho mt th mt chi ph vn chuyn ln
($9999/Unit) s c t trong m s loi b hiu qu khi xem xt ca
gii php (bi ton cm).
Ngun cung cp (Supplies) : ct pha xa bn phi cha cung cp (Supply) ti
mi ngun gc (Origin).
Nhu cu (Demands) : dng nhu cu cha nhu cu ti mi im n.
Phng php bt u (Starting Method) :
4 ty chn c sn trong hp
phng php th xung. Chng l :
1. Any Starting Method
(the software actually uses Vogels approximation method)
Bt k phng php no (phn mm thc s s dng phng php xp x ca Vogel)
(tc s dng phng php VAM di).
2. Northwest Corner Method : Phng php gc Ty Bc.
3. Vogels Approximation Method (VAM) : Phng php xp x ca Vogel.
4. Minimum Cost Method.
Phng php chi ph ti thiu (cn c gi l phng php trc quan).
Bn c th quay tr li hp phng php ny v thay i phng php bt u nh
thng l nh bn thch m lm n rt d dng chy cc k thut khc nhau trn
cng d liu thit lp. Tt nhin, gii php cui cng s lun nh nhau (tr khi c
nhiu gii php).
Mn hnh d liu cha mt hp ty chn thit lp mc tiu (Objective).
Thng tin
quan trng chnh ch yu giao dch vi chi ph vn chuyn (Shipping Cost) t mi gc
(Origin) ti mi im n (Destination), ngun cung cp vt t (Supplies) v
nhu cu (Demands).
Ty chn cc bc (Step) hot ng trong m-un ny :
m-un giao thng vn ti
cho php bn bc xuyn qua s lp i lp li (Iterations). Bn c th chn chp nhn
cc c chn bi phn mm (mt iu vi li ch cn bin ln nht largest marginal
benefit) hoc chn mt khc. Nu bn chn cc th s lp i lp li c th l
ngc tr li (Backwards) hoc chuyn tip (Forwards).
Ch : nu c nhng gii
php thay th ti u cho mt vn th phn mm s pht hnh mt tin nhn cho bit
iu ny.
thc s nhn thy cc gii php khc nhau, bn phi s dng ty chn
bc (Stepping) v cho php cc vi chi ph cn bin (Marginal Cost) l 0 nhp
vo.
Kt qu trong cc ca s khc :
u ra vn chuyn ban u bao gm cc l hng (Shipments) c thc hin.
Thm cc ca s c th c m ra hin th :
Chi ph cn bin ca cc khng s dng.
Vn ban u (Original).
S lp i lp li (Iterations).
Chi ph vn chuyn do ti mi .
TRANG 202
PHN MM NH LNG POMQM
Cc l hng trong mt danh sch ch khng phi l trong mt bng.
Chi ph ti u (Optimal Cost) tt nhin l c lp ca phng php ban u,

nh l lch trnh vn chuyn ti u khi khng c gii php thay th.
GII PHP
(Solution)
Mt gii php cho vn mu sau. Mn hnh gii php chnh cho thy cc l
hng (Shipments) m c thc hin v cha tng chi ph (Total Cost) gc trn
bn tri. Nu mt dng hoc mt ct gi cn c thm vo, n s xut hin
trong bng ny.
Tng chi ph hoc li nhun (Total Cost or Profit) : tng chi ph hoc li nhun
xut hin gc trn bn tri.
CHI PH BIN
(Marginal Costs)
Mt bng chi ph cn bin l c sn.
CC BC
(Stepping)
Chng ti xem xt cc vn tng t nhng thay i phng php gii php
ti gc Ty Bc (Northwest Corner). Bng u tin xut hin nh di y :
TRANG 203
PHN MM NH LNG POMQM
Ch rng mt s cc con s km theo trong du ngoc n trong khi nhng

s khc th khng (trn mn hnh cng hin th trong hai mu sc khc nhau). Cc s
khng cn mt du hiu i din cho cc l hng. Trong khi cc con s vi mt
du hiu i din cho chi ph cn bin (Marginal Costs) l cc con s c gi tr
tuyt i bng ngoc n, chi ph cn bin ln nht (gi tr tuyt i) l |-98|
trong Jenkintown ti Dummy (m l hin hnh c chn bi phn mm).
Cng lu rng tng chi ph m l $31.087, c hin th pha trn ca bng.
Bn khng c s dng ngh nhp liu bi phn mm. Bn c th s dng
cc phm hng thay i nhp liu.
Lp i lp li qu trnh ny hn 5 ln mang li cho chng ta mn hnh hin th bn
cnh. Trong mn hnh ny, c mt tin nhn sau chi ph ch ra rng gii php l ti u v
chng ta cn nhn Finish. Tt c mi th sau ny th cng nh trc nu chng ta
nhn mt phm nhiu hn mt ln, l, chng ta c th hin th cc l hng, chi ph cn
bin, hoc c hai trong mt bng.
Mt gii php ti u c cho bi bc (Stepping) mt ln na.
TRANG 204
PHN MM NH LNG POMQM
DNG CH I - I HNG
(Waiting Lines)
C nhiu tnh hung dng ch (Waiting Line) khc nhau m c m t trong sch
gio khoa POM-QM. Chng ti xem xt cc m hnh chun, l m hnh xp hng
Queueing giai on duy nht (Single-Phase Queueing Models), m khng cho php
phn hi (FeedBack), cc lt n hng lot, dch v hng lot, Balking hoc
Reneging. M hnh loi ny c m t bng mt k hiu tiu chun gi l k hiu ca
Kendall, mc d nhiu sch gio khoa trnh k hiu rt ph bin ny.
Mt s m hnh xp hng (Queueing Models) cho php xc nh chi ph trung bnh
(Average Cost) hot ng vn hnh mt h thng xp hng ni m chi ph l
tng ca chi ph lao ng (Labor Costs) v chi ph ch i (Waiting Costs) nh
i ngc vi hoc thi gian h thng (System Time) s lng trong h thng
(Number in System) hoc thi gian ch i (Waiting Time) s lng ch i
(Number Waiting).
D LIU
(Data)
Khun kh cho cc tuyn dng ch (Waiting Lines) ph thuc vo m hnh c
th c s dng. Chng ti xem xt 9 m hnh, v cc m hnh ny c th c s
dng vi hoc khng cn chi ph (Costs). Ni chung, cc d liu chnh xc cn thit
s thay i nh thay i m hnh. Cc m hnh c la chn ti bt u.
C 9 m hnh c sn. Mt s m hnh l trng hp c bit ca cc m hnh khc.
c bit, tt c cc m hnh my ch duy nht (Single-Server Models) l trng hp
c bit ca nhiu m hnh my ch tng ng. Cc m hnh c lit k di y vi
b danh ca chng. Tt c cc m hnh u gi nh mt qu trnh n Poisson.
M/M/1 - Exponential Service Times, 1 Server.
(a.k.a. the single server model)
M/M/1 - Thi gian dch v theo cp s nhn, vi ch c 1 my ch.
(cn gi l m hnh my ch duy nht)
M/D/1 - Constant Service Times, 1 server.
(a.k.a. the constant service model)
M/D/1 - Thi gian phc v c nh, vi ch c 1 my ch.
(cn gi l m hnh dch v khng i, dch v lin tc).
M/G/1 - General Service Times, 1 server.
M/G/1 - Thi gian dch v tng hp, vi ch c 1 my ch.
M/Ek/1 - Erlang-k Service Times, 1 server.
M/Ek/1 - Thi gian dch v Erlang-k , vi ch c 1 my ch.
( hoc cng l m hnh dch v ni chung General )
TRANG 205
PHN MM NH LNG POMQM
M/M/s - Exponential Service Times, 1 or More Servers.

(a.k.a. the multiple server model)
M/M/s - Thi gian dch v theo cp s nhn, vi 1 hoc nhiu my ch.
(cn gi l m hnh nhiu my ch)
M/M/1 with a finite queue (or finite system) size.
M/M/1 vi mt kch thc dng ch i hu hn (finite queue).
(hoc h thng hu hn finite system, vi ch c 1 my ch)
(v vi cc dch v theo cp s nhn exponential service )
M/M/s with a finite queue (or finite system) size.
M/M/s vi mt kch thc dng ch i hu hn (finite queue).
(hoc h thng hu hn finite system, vi nhiu my ch)
M/M/1 with a finite population.
M/M/1 vi mt dn s hu hn.
(hoc h thng hu hn finite system, vi ch c 1 my ch)
M/M/s with a finite population.
M/M/s vi mt dn s hu hn.
(hoc h thng hu hn finite system, vi nhiu my ch)
Tham s u tin trong k hiu dng ch Qu trnh n (Arrival Process).
M l vit tt cho Memorylessness, c ngha l mt qu trnh n Poisson.
Tham s th hai cp n Qu trnh dch v (Aervice Process). M mt ln
na ng cho Memoryless c ngha l thi gian dch v (Service Times) theo phn
phi m theo cp s nhn (Exponential Distribution).
D l vit tt ca xc nh (Deterministic), c s dng khi dch v khng i
(service times are constant), lun lun ging nhau.
G l vit tt ca ni chung (General).
V Ek l vit tt ca phn phi Erlang-k (Erlang-k Distribution).
Tham s th ba l s lng my ch number of servers (s) ( cn gi
l knh Channels ).
Lu rng s c th c thit lp ti
quyt m hnh M/M/1.
trong m hnh M/M/s
gii
i vi mi m hnh, c 2 mc m l u vo tiu chun :

T l n (lambda).
Tc (t l) dch v (mu).
TRANG 206
PHN MM NH LNG POMQM
Xin vui lng thng bo rng y l t l (khng phi thi gian) v rng n v
thi gian trong t l (gi, pht, v.v...) phi ging nhau i vi t l n v t l dch
v. Bt k u vo b sung no i vi cc m hnh c m t di y :
M hnh knh duy nht single channel model (M/M/1) : khng c thng tin
b sung no c yu cu.
M hnh thi gian dch v khng i constant service time model (M/D/1) :
khng c thng tin b sung no c yu cu.
M hnh thi gian dch v tng hp general service time model (M/G/1) :
lch chun standard deviation ca thi gian dch v c yu cu. Lu rng
iu ny phi cng n v thi gian cng nh c s dng cho t l n v t l
dch v. Ngoi ra, xin lu rng t l dch v ch khng phi l thi gian c
s dng.
M hnh thi gian dch v Erlang Erlang Service Time Model (M/Ek/1) : gi tr
ca k i vi phn phi Erlang-k Erlang-k distribution phi c cho.
M hnh nhiu my ch (knh) multiple server (channel) model (M/M/s) : s
lng my ch (gii hn nhiu nht l 30) phi c cho.
M hnh h thng / dng xp hng i hu hn Finite Queue / System Models
(M/M/1 v M/M/s) :
s lng khch hng ti a c cho php trong h thng
System (khng phi l dng xp hng ch i Queue) phi c cho.
M hnh dn s hu hn finite population models : t l n c hiu nh l
t l n ring bit. V d, nu mi ngi trong s 5 khch hng yu cu mt ln
dch v mi 8 gi trong ngy th nhp vo 0,125 (1/8). Cc u ra s hin th t l
n tng th (t l m c hiu lc). Quy m kch c dn s population size phi
c cho.
i vi cc m hnh ny, n c th thc hin mt phn tch chi ph (cost
analysis), u vo i vi cc chi ph l chi ph mi thi gian (costs per time) i
vi mi my ch (Server) v chi ph mi thi gian ang c khch hng ch i hoc
ang c trong h thng (System).
Kt qu :
u ra xp hng ch i chun bao gm nhng iu sau y :
My ch s dng mc trung bnh average server utilization l t l phn trm
ca thi gian m mi my ch ang bn rn trn trung bnh (bn rn mc trung bnh).
S lng trung bnh trong dng ch i (average number in the queue) l s
lng nhng ngi ang ch i trn trung bnh (s lng ngi ch mc trung
bnh). iu ny khng bao gm nhng khch hng ang c phc v.
S lng trung bnh trong trong h thng (average number in the system) l s
ngi hin din trong h thng trn trung bnh (s lng ngi hin din mc trung
bnh). iu ny bao gm nhng khch hng ang c phc v v nhng
ngi ang ch i.
Thi gian trung bnh trong dng ch i (average time in the queue) l s tin
trung bnh ca thi gian m mi khch hng ch i. n v thi gian (giy, pht, gi)
tng t nh c cho i vi t l n v t l dch v.
TRANG 207
PHN MM NH LNG POMQM
Thi gian trung bnh trong h thng (average time in the system) l thi gian
trung bnh Mean cho c hai dng ch i v dch v. n v thi gian tng t
nh kch thc (dimension) trong t l n v t l dch v.
i vi h thng nht nh, khng phi tt c cc lt n c th nhp vo h
thng. T l n hiu qu (effective arrival rate) l t l m ti nhng khch
hng c nhp vo h thng. Di y l xc sut (t l phn trm ca thi
gian) m h thng b y v rng cc khch hng khng th c nhp vo.
Chi ph ch i (waiting costs) c th tnh thm thi gian ch (waiting time)
hoc thm thi gian h thng (system time). C hai u c hin th i vi cc
m hnh chi ph.
Kt qu trong cc ca s khc :
i vi tt c cc m hnh, ngoi tr cc m hnh dch v khng i (constant
service models), phn phi xc sut (probability distribution) i vi s lng
khch hng trong h thng l c sn. 3 ct xc sut c th c lit k cho mt s
m hnh. Cc ct ny l xc sut m trnh by chnh xc khch hng k. Xc sut
m khch hng k hoc khch hng t hn c trnh by v xc sut m nghim
tc (strictly) hn l khch hng k c trnh by. Xc sut cng c th c hin
th nh l mt th.
D LIU
(Data)
Mt mn hnh d liu mu s xut hin tip theo.
T l n ( ) ( Arrival Rate Lambda ) :

mi h thng xp hng phi
c mt t l khch n. Con s ny l mt t l, m c ngha l mt n v
thi gian (gi, ngy, ...) c lin quan vi t l n. iu ny l rt quan trng bi
v cc n v thi gian phi ph hp vi n v thi gian ca cc tham s tip theo.
T l dch v ( ) ( Service Rate mu ) : s lng c nhp vo l t l
m ti khch hng tin hnh my ch ring. Lu rng y l mt t l. l,
n ph bin bit thi gian dch v. Nhng thi gian ny phi c chuyn i
ti mt t l, v n v thi gian ca t l ny phi ph hp vi n v thi
gian ca t l n.
TRANG 208
PHN MM NH LNG POMQM
S lng my ch (Number of Servers) : gi tr ti thiu v gi tr mc nh

i vi s lng my ch l 1.
C cc thng s u vo khc i vi cc m hnh khc m s c gii thch
trong cc v d.
n v thi gian (Time Unit) :
c mt hp th xung cho cc n v thi gian.
iu ny phc v hai mc ch. Mt l nhc nh bn rng t l n v t l dch v
c hai u phi c da trn cng mt n v thi gian. Th hai, nu bn chn
gi, th mn hnh hin th u ra s hin th "pht" v "giy". Nu khng, mn hnh
hin th u ra s hin th " 60 * thi gian tr li .
V D 1 :
M HNH M/M/1
(Example 1 : The M/M/1 model)

Khch hng n vi mt t l 26 ngi mi gi theo mt qu trnh n Poisson.
C mt my ch, ngi phc v khch hng trong mt thi gian trung bnh
(Average Time) l 2 pht theo mt phn phi m (cp s nhn).
Mn hnh u ra cho h thng ny sau y. Ch rng t l n c nhp vo
l 26, nh c cho trong bo co vn . Thi gian phc v (Service Time)
l 2 pht phi c chuyn i sang mt t l l 30 ngi mi gi.
S dng my ch trung bnh (Average Server Utilization) :

y l t l phn
trm ca thi gian m mi my ch bn rn trn trung bnh. Trong v d, mt my
ch bn rn 87% thi gian
( t l thi gian bn rn ca ngi phc v, mc trung
bnh, mc chung cho tt c cc nhn vin phc v ) .
S trung bnh trong xp hng trong hng i (trong dng i) (Average Number
in The Queue Line) : y l s lng trung bnh khch hng m l ngi trong
h thng ch i dch v. l, h cha c bt u dch v ca h. Trong v d,
c 5,63 khch hng ch i, trn trung bnh
( s lng xp hng ch i, mc
trung bnh ) .
S lng khch hng trung bnh trong h thng (Average Number of Customers
in The System) : y l s lng trung bnh khch hng m l ngi hoc trong
dng hoc ang c phc v. Trong v d, c 6,5 khch hng trong h thng, trn
trung bnh ( s lng tt c khch hng ang c, mc trung bnh ) .
TRANG 209
PHN MM NH LNG POMQM
Thi gian trung bnh trong xp hng (dng i) (Average Time in The Queue
Line) :
y l thi gian trung bnh m mt khch hng dnh ch i trc khi
dch v bt u. n v thi gian l tng t nh ca t l n v t l dch v.
Trong v d, n l 0,2167 gi ( thi gian xp hng ch, mc trung bnh ) .
Thi gian trung bnh trong h thng (Average Time in The System) : y l thi
gian trung bnh m mt khch hng dnh ch i v bt u dch v. Trong v d n l
0,25 gi ( tt c thi gian ang c, mc trung bnh ) .
Nhiu ln chng ti mun chuyn i thi gian ch i trung bnh (Average
Waiting Times) v thi gian h thng trung bnh (Average System Times) t gi
sang pht, t pht sang giy. Thi gian trung bnh s c nhn vi 60 hoc 3600,
v cu tr li s hin th bn cnh mc trung bnh ban u. Cc con s c th hin
tng t nh thi gian nhng vi mt n v pht, khi thi gian ban u l trong vi gi.
Chng ta c th lit k xc sut (t l phn trm ca thi gian) ca chnh xc khch
hng th k trong h thng, xc sut tch ly ca k hoc bt u khch hng t hn
trong h thng v xc sut khng tch ly (Decumulative) ca nghim chnh hn khch
hng k trong h thng.
Mn hnh s xut hin nh sau. V d, xc sut m chnh xc 3 khch hng trong
h thng l 0,0868 ; trong khi xc sut m 3 hoc khch hng t hn trong h thng
l 0,4358. Xc sut m (nghim chnh) hn l 3 khch hng trong h thng l 0,5642.
Lu rng cc xc sut ny l c sn cho tt c cc m hnh m c thi gian phc v
theo cp s nhn (Memoryless, thi gian dch v theo phn phi m).
TRANG 210
PHN MM NH LNG POMQM
V D 2 :
M HNH M/D/1
(Example 2 : The M/D/1 model)

Chng ti c li cc d liu tng t nh v d trc, nhng c thay i m hnh
v gii quyt vn . Mn hnh gii php sau :
Cc nh dng u ra l nh nhau. Bi v m hnh c thay i, mt s kt qu

c i. c bit, s lng khch hng trong dng l 2,8167 ch khng phi
l 5,63 t h thng M/M/1 (s trong dng v thi gian trong dng trong mt h thng
M/D/1 th lun lun l mt na chng trong mt h thng M/M/1). Xc sut khng c
sn khi thi gian dch v khng theo cp s nhn.
V D 3 :
M HNH M/G/1
(Example 3 : The M/G/1 model)

Trong m hnh ny, thi gian dch v c th c bt k phn phi no. Cc u vo
n thng xuyn th khng ch l t l dch v trung bnh nhng cng l lch
tiu chun ca thi gian dch v. Mn hnh sau y cha tt c cc thng tin cho v d
ny. Ch rng c thm mt dng cho u vo. u ra l tng t. Trong v d, t
l trung bnh vn cn 30 khch hng mi gi, nh lc trc, nhng lch tiu chun
thi gian dch v l 0,05 gi hoc 3 pht.
Tt c cc phn phi dch v l mt trng hp c bit ca phn phi chung. Mt

lch chun ca 1 / t l sn lng phn phi theo cp s nhn. V d, khi t l dch
v l 30, nu lch tiu chun ca thi gian dch v l 1 / 30 = 0,03333 ; th m
hnh c mt phn phi thi gian dch v theo cp s nhn.
TRANG 211
PHN MM NH LNG POMQM
iu ny c hin th trong mn hnh trc. Ch rng cu tr li ging ht

chng trong v d 1 ngoi tr khng lm trn Round-off (khi chng ta s dng 0,0333
ch khng phi chnh xc l 1 / 30th).
Mt lch chun ca 0 s mang li sn sinh , nng sut (Yield) m hnh thi
gian phc v khng i (M/D/1). iu ny c hin th bn cnh. So snh kt qu vi
v d 2, m hin th trong m hnh M/D/1.
V D 4 :
M HNH M/Ek/1
(Example 4 : The M/Ek/1 model)

Mt phn phi thi gian dch v c sn l phn phi Erlang-k. Mn hnh di y
trin lm (th hin) m hnh M/Ek/1 v gii php. Ch khc bit trong u vo m
gi tr cho k phi c a ra (ch khng phi l khng c gi tr hoc mt lch tiu
chun).
TRANG 212
PHN MM NH LNG POMQM
Khi k l mt, nh trong mn hnh sau y, th chng ta c mt phn phi m. So

snh kt qu vi v d u tin ca chng ta.
V D 5 :
XP HNG DNG CH I M/M/s
(Example 5 : The M/M/s Queue)

Cc cu hi c bn nht trong xp hng l nhng g s xy ra nu s lng my
ch c tng ln. Trong mn hnh di y, chng ti cho thy u ra cho tnh hnh
ban u, ngoi tr vi 2 my ch. Thi gian ch i by gi l 0,0077 gi ch khng
phi l 0,217 gi trong m t ban u. kim tra li v d ban u, bn c th s
dng m hnh M/M/s v nhp vo 1 my ch.
V D 6 :
H THNG M/M/1 VI MT DNG CH I HU HN
(Example 6 : The M/M/1 system with a finite queue)

Trong h thng ny, s lng khng gian ch i (Number of Waiting Spaces) l
hu hn. V d in hnh l mt h thng in thoi. Dng u vo c thm vo m
hnh ny l kch thc h thng ti a cho php. Ch rng chng ta ni h thng
khng ch i. Trong v d sau y, chng ta c ch ra rng nhiu nht l 2 khch hng
c th c trong h thng. iu ny c ngha rng khng c nhiu hn 1 ngi c th
ang ch i ngi th hai v ang c phc v (y l mt dng in thoi duy
nht vi cuc gi ang ch i. Nu c 2 my ch, n s c ngha l khng 1 ngi
no c th phi ch i. Hy cn thn khi xem xt kch thc h thng so vi
Versus (vs) kch thc khu vc ang ch i.
TRANG 213
PHN MM NH LNG POMQM
Ch : m hnh ny c gi l mt xp hng dng ch i hu hn

(finite queue), nhng n l kch thc h thng (System Size), khng phi kch thc
dng i (Queue Size), m c nhp vo chng trnh.
Bi v kch thc h thng c gii hn, c th l cc khch hng s n h
thng, nhng b chn lc nhp vo. V vy, chng ti xc nh hiu qu t l n
nh l s lng khch hng thc t nhng ngi m c nhp vo lu tr ch
khng phi l n lu tr. Hn na, u ra hin th t l phn trm ca thi gian (xc
sut) m h thng b y.
Trong v d, ch c 71% khch hng hin th ln nhp vo h thng, cc khch

hng hin th ln ti mt t l l 26 ngi mi gi, nhng hiu qu t l n l
18,539 ngi mi gi. Khi chng ta hin th cc xc sut nh sau, chng ta thy rng
28,69% l thi gian h thng b y (k = 2). l, 28,69% thi gian khi mt cuc
gi in thoi lm n nhn c mt tn hiu bn.
V D 7 :
H THNG M/M/1 VI MT DN S HU HN
(Example 7 : The M/M/1 system with a finite population)

Thng thng, chng ti gi nh rng dn s l v hn. Trong mn hnh sau y,
chng ti ang trng by mt dn s 13 khch hng tim nng, mi lt ang n l
mt t l 2 ln mi gi (cho mt mng li tim nng t l n l 26, nh trong v d
trc). y l t l n khi h ang khng trong h thng. Tuy nhin, t u ra, n
c th c nhn thy rng trung bnh mi khch hng l 0,088 gi mi ln anh ta
hoc c ta n. Hiu qu t l n l 1 lt n mi ln mi gi, s trung bnh l 13
nhng ngi m khng c trong h thng. Trong v d, hiu qu t l n ch l 22,1
khch hng mi gi (ch khng phi tim nng l 26 lt n mi gi). Nu dch v
tt hn, th cc khch hng c th n thng xuyn hn. Mn hnh bao gm xc
TRANG 214
PHN MM NH LNG POMQM
sut m mt khch hng ch i (y khng phi l xc sut m tt c cc my ch b

bn, khi t l n khc nhau ty thuc vo s lng trong h thng.
Ch : trong m hnh ny, t l n c nhp vo chng trnh l t l n i
vi mt khch hng ring l. Trong nhiu sch gio khoa, thi gian gia nhng lt n
c cho. Thi gian ny phi c chuyn i ti t l n. V d, n c th l
trung bnh mi 30 pht c 5 khch hng hin th ln. iu ny phi c chuyn i
sang mt t l l 60 / 30 = 2 mi gi (mi khch hng). Chng trnh s t ng iu
chnh s lng khch hng. Ch rng chng ta nhp vo s 2 nh l t l n. N
hp dn nhp 2 * 5 = 10, nhng iu ny l khng chnh xc !
V D 8 :
DNG CH I M/M/s VI CHI PH
(Example 8 : The M/M/s queue with costs)

Mn hnh k tip cha mt v d vi chi ph (Costs). Chi ph khch hng c th
phi chi tr (charged against) hoc thi gian mt khch hng chi tiu trong h
thng hoc ch phi chi tr cho thi gian ch i. Chng ta tnh (charge) $2 cho
mi gi khch hng ch i. iu ny mang li mt tng chi ph (Total Cost)
l ($2 * 6,5 khch hng) trong h thng cng vi (plus) 4$/gi chi ph lao ng
(Labor Cost) cho mt tng chi ph h thng (Total System Cost) l $17 mi gi
(dng di cng trong bng). Ngoi ra, chng ta c th tnh ph (charged against)
thi gian mt khch hng ch i. Trong trng hp ny, chng ta c 5,633 khch
hng ch i, trung bnh nhn $2, cho mt tng s ph (Subtotal) l $11,26
m chng ta thm 4$ my ch, ph mang li (nng sut) l 15,27$ ; nh c
hin th trong dng th hai t bn di.
TRANG 215
PHN MM NH LNG POMQM
CNG VIC O LNG

(Work Measurement)
Module ny c th c s dng cho 3 lnh vc chnh ca cng vic o lng :
thi gian nghin cu, tnh ton kch thc mu cho thi gian nghin cu, v cng vic
ly mu.
THI GIAN NGHIN CU
(Time Study)
Mt mn hnh mu m bao gm cc d liu xut hin bn cnh. Qu trnh ca
chng ta bao gm 3 yu t v chng ta c thc hin 5 quan st ca mi yu t.
D LIU
(Data)
nh gi hiu sut nh gi s thc hin (Performance Rating) : i vi mi
phn t (mi yu t), nh gi hiu qu hiu sut ca n phi c cho.
Thi gian bnh thng (Normal Time) s c tnh ton nh l thi gian trung bnh
(Average Time) nhn vi nh gi hiu sut (Performance Rating).
Cc quan st (Observations) :
thi gian quan st cho mi yu t phi c
nhp vo. Trong mt s trng hp, cc quan st s b xu (quan st bn ngoi).
TRANG 216
PHN MM NH LNG POMQM
Trong th t loi tr chng t tnh ton, nhp vo mt s 0, nh trong trng

hp quan st 2 i vi yu t 2.
Yu t tr cp ph cp (Allowance Factor) :
yu t ph cp tng th
(Overall Allowance Factor) l c cho. Yu t ph cp iu chnh thi gian cui
cng i vi tng s ca tt c 3 thi gian bnh thng (Normal Times).
GII PHP
(Solution)
Mn hnh gii php cho v d ca chng ti xut hin di y.
Trung bnh (Average) :
trung bnh cho mi yu t c tnh ton. Ch rng
trung bnh cho yu t 1 v 3 c thc hin trn ht thy 5 gi tr , nhng trung bnh
cho yu t 2 c thc hin trn ht thy 4 gi tr khi quan st 2 c cho nh l 0
v iu ny khng bao gm trong qu trnh trung bnh (Averaging Process).
lch chun (Standard Deviation) :
lch chun cho mi yu t c tnh
ton, mc d n khng c s dng cho bt k tnh ton xa hn no trong m hnh
con ny.
Thi gian bnh thng (Normal time) :
thi gian bnh thng c tnh ton
bng cch nhn mc trung bnh ca cc quan st (Average of The Observations)
vi nh gi hiu sut (Performance Rating) cho yu t .
Thi gian x l bnh thng (Normal Processing Time) : thi gian x l bnh
thng l tng s thi gian bnh thng.
Thi gian chun (Standard time) : thi gian tiu chun c tnh ton theo mt
trong hai cch, ty thuc vo sch gio khoa. Mt s tc gi s dng :
Standard Time = Normal Processing Time * ( 1 + Allowance Factor )
Thi gian chun = thi gian x l bnh thng * ( 1 + Yu t cho php )
Trong khi nhng ngi khc s dng :
Standard Time = Normal Processing Time / ( 1 Allowance Factor )
Thi gian chun = thi gian x l bnh thng / ( 1 Yu t cho php )
Nu bn ang s dng sch gio khoa Prentice Hall th cng thc thch hp nn
c s dng. Nu khng, xin vui lng kim tra tr gip, thng tin ngi dng
thng nht rng phn mm c lit k nh l s dng sch gio khoa sa i.
TRANG 217
PHN MM NH LNG POMQM
V D 2 :
TNH TON KCH THC MU
(Example 2 : Computing the sample size)

Chng ti trnh by d liu cho v d th hai ca chng ti di y :
u vo l tng t thi gian nghin cu (Time Study) trn, nhng mc tiu

th khc nhau. Chng ti mun tm kch thc mu ti thiu l 99,45% tin cy v
kt qu ca chng ti. u vo cho m hnh con nh sau :
Mc chnh xc (Accuracy Level) :
chng ta mun kt qu tn tr ca
chng ta trong t l bao nhiu phn trm? V d, i vi yu t 2, chng ta mun
95,45% tin cy m kt qu ca chng ta l trong 1% thi gian thc (True Time).
Cc quan st (Observations) : iu ny tng t nh trn. Thi gian quan st
i vi mi yu t phi c nhp vo. Trong mt s trng hp, cc quan st s
l xu t (quan st bn ngoi). Trong th t loi tr chng t cc tnh ton,
nhp vo mt s 0, nh trong trng hp quan st 2 i vi yu t 2.
S tin cy (Confidence) : 6 la chn v mc tin cy (Confidence Level)
c trnh by trong hp th xung trn cc d liu.
u ra xut hin bn di.
Kch thc mu (Sample Sizes) cho 3 yu t
tng ng l 20 ; 297 ; v 3. Ni chung, iu ny c ngha rng chng ta s
dng ln nht v c 297 quan st (Observations) i vi mi yu t.
V D 3 :
CNG VIC LY MU
(Example 3 : Work Sampling)

Mt v d ca c u vo v u ra i vi vic ly mu xut hin di y :
TRANG 218
PHN MM NH LNG POMQM
T l (Proportion) : y l t l c tnh ca thi gian c chi tiu trong

nhim v.
Mc chnh xc (Accuracy Level) :
iu ny l tng t nh mc chnh
xc trn. chng ta mun kt qu tn tr ca chng ta trong t l bao nhiu
phn trm? V d, chng ta mun 99,73% tin cy rng kt qu ca chng ta
l trong 5% t l thc (True Proportion).
S tin cy (Confidence) : 6 la chn v mc tin cy (Confidence Level)
c trnh by trong hp th xung trn cc d liu.
Kt qu ch n gin l kch thc mu. Trong trng hp ny, chng ta phi
ly 756 mu n v thi gian (Time Units).
MY TNH PHN PHI CHUN

Normal Distribution Calculator
(MY TNH BM TAY RT HU CH I VI VN NY)
Hnh thc biu mu ny c th c s dng trong hai cch khc nhau. Ty chn
c bn nht l cho php phn mm thc hin cc tnh ton. Ty chn th hai hin th
mt bng phn phi bnh thng (phn phi chun). Cc ty chn ny c iu khin
bng nt lnh th hai pha trn cng ca biu mu. Chng ti gii thch cc ty chn
tnh ton di y.
tng bc (step by step) hng dn nhp cnh d liu, nhp vo nt khun
mt hnh phc.
TRANG 219
PHN MM NH LNG POMQM
i vi bt k vn no trong hai m t phn phi phi c cho. Mt phi l

trung bnh (Mean) v khc l mt trong hai hoc lch chun (Standard Deviation)
hoc phng sai chnh lch (Variance). i vi vn 1, nhp vo nt ty chn v ri
nhp vo gi tr trn dng (Line) bn c chn (vn khc s c tnh ton bi
chng trnh).
Khi thc hin tnh ton, c hai cch m n c th c thc hin. Bn c th hoc
cho mt xc sut (Probability) v c chng trnh xc nh gi tr ct ngt (Cutoff)
hoc bn c th cho gi tr ct ngt (Cutoff) v c chng trnh xc nh xc sut.
Pha trn bn tri cha cc khung m c s dng la chn khi hai la chn ny
c chn.
TRANG 220
PHN MM NH LNG POMQM
TNH TON CC CUTOFF C CHO XC SUT

Compute cutoffs given probability
Di ty chn ny, bn phi ch ra cho d n l mt ui (One-tailed) hoc 2 ui
(Two-tailed).
Trong additon (Probability to the Right of the tail , Probability
between tails), nhp vo xc sut mong mun (Desired Probability). Xc sut chun
Standard Probabilities (99%, 95%, 90%, 10%, 5% v 1%) c th c nhp bng
cch nhn vo nt thch hp. Cc gi tr khc c cho bi thanh cun. Chng trnh
s lit k gi tr ct ngt (Cutoff Value) (s) v hin th mt phn phi chun vi
cc gi tr ny.
TNH TON XC SUT C CHO CC CUTOFF
Compute probability given cutoffs
Trong trng hp ny bn phi ch ra cho d n l mt (One-tailed) hoc 2 ui
(Two-tailed), cho cc cutoffs v chng trnh s cho cc xc sut trong 2 hoc 3 khu
vc c xc nh bi cc cutoffs v hin th mt phn phi chun vi cc gi tr ny.
TNH TON CUTOFF
Computing cutoffs
Computing cutoffs (one-tailed)
Tnh ton CutOff (1 ui)
Gi s chng ta c mt phn phi bnh thng (chun) vi trung bnh (Mean) 23
v lch chun l 2.4 v chng ta mun tnh ton mt cutoff vi 10% (0,1) trong
ui (Tail) bn phi (1 ui) (One-tailed). Thit lp my tnh nh sau :
TRANG 221
PHN MM NH LNG POMQM
Cc kt qu xut hin di y.
KHONG TIN CY
Confidence Interval
Confidence Interval (two-tailed)
Tnh ton khong tin cy (2 ui)
Gi s chng ta mun tm mt khong tin cy 95% (Confidence Interval) cho
mt phn phi vi trung bnh (Mean) l 23 v lch chun (Standard Deviation)
l 2,4
Thit lp my tnh nh sau :
TRANG 222
PHN MM NH LNG POMQM
Cc kt qu s xut hin di dng ha nh sau :
TNH TON XC SUT - 1 UI

Computing probabilities - 1 tailed
Computing probabilities given a cutoff or cutoffs (One tailed)
Tnh ton xc sut c cho 1 Cutoff hoc cc Cutoff (1 ui)
Gi s chng ta c mt phn phi chun vi trung bnh 23 v lch chun l 2.4
v chng ti mun tm xc sut l mt gi tr di 21.
TRANG 223
PHN MM NH LNG POMQM
Kt qu nh sau :
TNH TON XC SUT - 2 UI

Computing probabilities - 2 tailed
Computing probabilities given a cutoff or cutoffs (Two tailed)
Tnh ton xc sut c cho 1 Cutoff hoc cc Cutoff (2 ui)
Gi s chng ta c mt phn phi chun vi trung bnh 23 v lch chun l 2.4
v chng ti mun tm xc sut l mt gi tr gia 20 v 24.
TRANG 224
PHN MM NH LNG POMQM
Cc kt qu c a ra di y :
TRANG 225
PHN MM NH LNG POMQM
PH LC RUT THA
(Appendices)
PH LC A
TY BIN CHO SCH GIO KHOA
(Appendix A. Customization due to textbook)
MODULE
Decision Analysis.
Phn tch quyt nh.
Forecasting
D bo.
Inventory.
Kim k - Qun l hng d tr.
Job shop scheduling.

iu cng vic phn xng.
Linear programming.
Quy hoch tuyn tnh.
Location.
V tr - a im.
Materials Requirements Planning.
Hoch nh nhu cu vt liu MRP.
Quality control.
Qun l cht lng.
Simulation.
M phng.
Waiting Line.
Dng ch i (xp hng ch i).
Work measurement.
Cng vic o lng.
CUSTOMIZATION
(TY BIN)
Tn dng Hurwicz khng bao gm

trong tt c cc sch gio khoa.
Bao gm giai on 1 (Period 1) trong li
tnh ton (Error Computation) i vi phng
php n nh theo cp s nhn (Exponential
Smoothing Methods).
Tnh ton n nh theo cp s nhn vi
m hnh xu hng (Trend Model) thay i bi
sch gio khoa.
EOQ vi m hnh thiu hng (Shortages)
khng bao gm trong tt c cc sch gio khoa.
M hnh d tr an ton (Safety Stock)
i vi phn phi chun (Normal Distribution)
thay i bi sch gio khoa.
Tn phng php.
Ct s hot ng (Number of Operations)
khng bao gm trong tt c cc sch gio khoa.
Hot cnh Simplex hin th .
Tn m hnh.
Bng hin th (th t ca cc dng).
M hnh ly mu chp nhn c
(Acceptance Sampling Model) khng bao gm
trong tt c cc sch gio khoa.
Bng s ngu nhin.
M hnh sn c v tn, k hiu.
Tnh ton thi gian tiu chun (Standard
Time) khc nhau bi sch gio khoa.
TRANG 226
PHN MM NH LNG POMQM
PH LC B
GI HU CH CHO M UN
(Appendix B. Useful hints for modules)
MODULE
Aggregate Planning.
Hoch nh tng hp.
HELPFUL HINTS (GI C CH)

y l mt m hnh m n c th hu ch
s dng hng thng, nh l ty chn tn dng
(Row Name) trn mn hnh to ra, ch khng phi
l tn mc nh l giai on 1, giai on 2, v.v
Ngoi ra, nt copy xung (copy down) rt hu
ch cho vic nhp vo nng lc khng i
(Constant Capacities). s dng m hnh
con vn ti (Transportation Submodel) cho
vic lp k hoch tng hp, th cc chi ph (Costs)
c th khng khc nhau t giai on ti giai on.
Nu cc chi ph khc nhau, bn phi thit lp
m hnh chnh n bng cch s dng m hnh
giao thng vn ti (Transportation Model) (m
hnh m).
Assembly Line Balancing.

Cn bng dy chuyn.
Hy chc chn n v thi gian (Time

Unit) cho cc nhim v c thit lp ng cch.
Assignment.
Phn cng cng vic.
Nhp x c mt chi ph ln (9999) t

trong ngn cn vic phn cng t lc bt
u thc hin.
Breakeven.
Phn tch ha vn.
Vn vi ty chn 2 v doanh thu

(Revenue) ch n gin l iu chnh doanh
thu nh l mt ty chn th 3.
Decision Tables.
Phn tch quyt nh (dng bng).
S dng "=" trong dng xc sut

(Probability) thit lp tt c cc xc sut
nh nhau trong cy quyt nh. Lu rng trong
m hnh lu kho (Inventory) mt giai on, Li
nhun (Profits) trn n v vt qu (Excess
Units), hoc n v thiu ht hng (Shorted
Units) c th l tiu cc, l, mt s mt mt.
Forecasting.
D bo.
Li tiu chun (Standard Error) c tnh ton

bng cch s dng n - 2 trong mu s.
Integer & mixed integer

programming.
Quy hoch nguyn.
N khng cn thit bao gm cc hn ch

khng tiu cc Non-negativity Restrictions
(v d, X > = 0) khi m s lng hn ch
(Number of Constraints). di cng bn tri
c mt hp th xung m c th c s dng
thit lp tt c cc bin (Variables) ti cng loi.
TRANG 227
PHN MM NH LNG POMQM
Inventory.
Qun l hng d tr.
Chi ph tn tr trong m hnh da trn EOQ

c th c nhp vo nh l mt s hoc nh l
mt t l phn trm. Nhp cnh 0,30 c ngha
l 30 cent trong khi nhp cnh 30% c ngha
l 30% ca chi ph n v (Unit Cost).
Linear programming.
Quy hoch tuyn tnh.
N khng cn thit bao gm cc hn ch

khng tiu cc (v d, X > = 0) khi m s
lng hn ch. y l mt trong hai m-un
m n c th bc xuyn qua cc th tc gii
php.
Material Requirements Planning MRP.

Hoch nh nhu cu vt liu MRP.
Kch p chut vo bng d liu s hin th

cy sn phm MRP. Ngoi ra, nt khng hin
th 0s c th rt hu ch trong m-un ny.
Quality.
Qun l cht lng.
i vi biu kim sot (Control Charts),

bn c th s dng trung bnh (Average) nh
l dng trung tm ng trung tm (Center
Line) hoc thit lp ng trung tm ca
chnh bn.
Statistics.
Cc s liu thng k.
M-un ny bao gm mt m hnh con

tnh ton
phn phi chun (Normal
Distribution). Cc tnh ton tng t nhau c
th c thc hin vi cng c phn phi chun
(thanh cng c hoc cc dng c menu chnh)
m c mt giao din ngi dng khc nhau (tt
hn).
Transportation.
Giao thng vn ti.
Nhp x c mt chi ph ln (9999) t

trong ngn cn cc n v c vn
chuyn (being shipped) t mc n ch. y
l mt trong hai m-un m n c th bc
xuyn qua cc th tc gii php.
Waiting.
Dng ch i (xp hng ch i).
C hai : cc lt n (Arrivals) v dch

v (Service) th c cho bi t l ch
khng phi l thi gian ln. Hy chc chn
rng n v thi gian (Time Unit) i vi t l
n (Arrival Rate) v t l dch v (Service
Rate) l nh nhau.
TRANG 228

03. POM-QM. Hướng Dẫn Sử Dụng Tổng Quát Bằng Tiếng Việt

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

03. POM-QM. Hướng Dẫn Sử Dụng Tổng Quát Bằng Tiếng Việt

Uploaded by

Copyright:

Available Formats

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

POM - QM FOR WINDOWS

Version 3.41 Build 108 20/09/2010

PHN MM QUN TR KINH DOANH POM-QM V3.0

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

SINH VIN THC HIN : TRN ANH T

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

00. Overview ..................................................

Tng quan ...................................................... 44

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

d s dng to ra ci cy quyt nh. Ngoi ra, chng ta thm mt m hnh mi

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

vo mn nh to thnh vn gip m t nhng ty chn m (th) sn c. Nhng

SINH VIN THC HIN : TRN ANH T

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

Cheryl v Ru Steve. S Gy m Madeline (ca) Trng i hc Trng thi Utah cung

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

Bn s tm thy phn mm (th) rt d s dng v nhng c tnh sau :

SINH VIN THC HIN : TRN ANH T

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

S THC HIN SCH GIO KHOA THEO YU CU KHCH HNG

(Textbook customization Ty bin ti sch gio khoa)

(Hardware and Software Requirements)

SINH VIN THC HIN : TRN ANH T

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

(Typographic Conventions in this Manual)

(Installing the Software)

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

(Installing and Running on a Network)

(The Program Group)

S Gip sn sng t bn trong chng trnh, nhng nu bn mun c thng tin

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

Nhm chng trnh cha ng mt biu tng ch nh Prentice lm Cng vo

KHI NG CHNG TRNH

(Starting the Program)

SINH VIN THC HIN : TRN ANH T

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

(The Main Screen)

SINH VIN THC HIN : TRN ANH T

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

Xin ch , nn trong gia (ca) mn nh. (Ci) ny c vin dn nh mt ng

nh (ca) mn nh l thanh tiu Windows chun cho ca s. (ti) s bt u

SINH VIN THC HIN : TRN ANH T

PHN MM NH LNG POMQM

LP QUN TR KINH DOANH

bn di thanh tiu l mt qun ru m cha ng Thc n Chnh. Qun

di thc n l mt thanh cng c chun (cng c gi l mt qun ru nt

di thanh cng c chun l mt thanh cng c khun dng. Thanh cng c ny

C mt thanh cng c na, v s nh v (v tr) mc nh (ca) n (ti) y (ca)