Chng 3. QL Thi gian.

CHNG 3. Qun l Thi gian D n

Mc ch.
Hiu c tm quan trng ca vic qun l thi gian d n Hiu c cc Qui trnh Qun l Thi gian Hiu c cc Phng php dng QL Thi gian: CPM (Critical Path Method), PERT (Program Evaluation and Review Technique). M t cch dng phn mm trong qun l thi gian d n

3.1. Tm quan trng ca vic qun l thi gian Kt thc d n ng hn l mt trong nhng thch thc ln nht Thi gian qu hn trung bnh l 222% (theo bo co ca CHAOS nm 1995; c ci tin ln 163% vo nm 2001 Thi gian c linh hot b nht; n tri qua bt k iu g xy ra Cc vn lch biu l l do chnh dn n xung t trong d n, c bit l trong na sau ca d n 3.2. Cc Qui trnh QL Thi gian DA. Qun l thi gian d n gm nhng qui trnh bo m hon tt d n ng hn. Nhng qui trnh ny gm: Xc nh cc hot ng Sp th t cc hot ng c lng thi gian cho mi hot ng Pht trin lch biu iu khin lch biu 3.2.1.

Xc nh cc hot ng.
Lch biu d n bt ngun t ti liu khi ng d n o Bn tuyn b d n c cha ngy bt u v kt thc, cng vi thng tin v ngn sch o Tuyn b phm vi v WBS gip xc nh cn phi lm nhng g Xc nh hot ng i hi pht trin WBS chi tit hn cng vi nhng li gii thch hiu c tt c nhng vic cn lm, nhm c c cc c lng ph hp vi thc t

3.2.2.

Sp th t cc hot ng.
Xem xt cc hot ng v xc nh quan h ph thuc o Ph thuc bt buc: c hu do bn cht cng vic. o Ph thuc xc nh bi nhm d n. o Ph thuc lin quan gia cc hot ng bn trong d n v bn ngoi d n

Dng Phng php CPM (Critical Path Method) xc nh cc quan h

ph thuc.
25

Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

Chng 3. QL Thi gian.

3.2.3.

c lng thi gian cho mi hot ng.

oc lng thi gian cho mi hot ng, ty theo hng tip cn s c cc c lng khc nhau. o CPM : thi gian mi cng vic l thi gian xc nh, cho php thc hin c cng vic . o PERT: tnh thi gian mong mun (k vng) ca thi gian thun li (lc quan), thi gian khng thun li (bi quan) v thi gian trung bnh thc hin c cng vic . Lp Bng phn tch CPM (PERT) v xc nh ng ti hn (biu din bng s GANTT) v xc nh thi gian hon thnh c d n.

3.2.4.

3.3.

Pht trin lch biu. To c Lch biu ph hp. 3.2.5. iu khin lch biu.
Kim tra lch biu so vi thc t S dng k hoch phng h bt trc Khng lp k hoch cho mi ngi lm vic 100% kh nng vo mi thi im T chc cc bui hp tin vi cc bn lin quan, v Tht r rng, trung tht khi bn v cc vn lin quan n lch biu

3.4.

Dng Phn mm MP Qun l Thi gian. Xem chi tit trong Phu lc A. Cu hi.

1. Gii thch ti sao lch biu (schedule) thng gy nhiu xung t (conflict) trong cc d n. 2. Ti sao vic xc nh cc hot ng l bc u tin trong qun l thi gian d n? 3. Ti sao phi xc nh tun t cc cng vic trong d n? 4. Gii thch s khc bit gia c lng thi gian cho cng vic v c lng n lc thc hin cng vic. 5. Gii thch cc khi nim sau y: biu Gantt, ng dn ti hn.

3.5.

Bi tp.

Di y l bng d liu cho mt d n nh. Thi gian c tnh bng ngy, mng gm cc nt t 1 n 9.
Hot ng A B C D E F G H I J K Nt xut pht 1 2 2 2 3 4 5 6 6 7 8 Nt kt thc 2 3 4 5 6 6 7 8 7 8 9 Thi gian 2 2 3 4 2 3 6 2 5 1 2

a. V biu mng AOA cho d n ny. b. Xc nh tt c cc ng dn v tnh chiu di ca mi ng c. Xc nh ng dn ti hn v chiu di ca n d. Thi gian ngn nht c th hon tt d n l bao lu?
Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

26

Chng 3. QL Thi gian.

T KHA - KEY TERMS.

o HAT NG (ACTIVITY) (cn c gi l nhim v) Tp hp cc cng vic, thng thng c c do WBS, c thi gian d kin, chi ph, v ngun ti nguyn yu cu cho mi cng vic (an element of work, normally found on the WBS, that has an expected duration, cost, and resource requirements; also called task). o XC NH HAT NG (ACTIVITY DEFINITION) Xc nh cc cng vic m d n phi han thnh (identifying the specific activities that the project team members and stakeholders must perform to produce the project deliverables) o C LNG THI GIAN HAT NG (ACTIVITY DURATION ESTIMATING) c lng thi gian cn han thnh cho mi cng vic (estimating the number of work periods that are needed to complete individual activities). o AoA (ACTIVITY-ON-ARROW) hay Phng php S cung (ADM=arrow diagramming method) S dng th c hng biu din dy hat ng trong mi cng vic c biu din bng mt cung, cn nt (nh) l ch s kin (a network diagramming technique in which activities are represented by arrows and connected at points called nodes to illustrate the sequence of activities). o DY HAT NG (ACTIVITY SEQUENCING) Xc nh lin h gia cc cng vic ca d n (identifying and documenting the relationships between project activities). o MC (BASELINE DATES) Lch biu c hach nh cho cc hat ng trong s GANTT (the planned schedule dates for activities in a Gantt chart) o B m (BUFFER) Thi gian thm vo han tt mt nhim v (cng vic), cng thm vo mt c tnh d phng cho nhiu nhn t khc nhau (additional time to complete a task, added to an estimate to account for various factors). o RT NGN (CRASHING) Mt k thut dng nn (rt ngn) lch biu vi chi ph tng bc t nht (a technique for making cost and schedule tradeoffs to obtain the greatest amount of schedule compression for the least incremental cost). o ng ti hn (CRITICAL PATH) Dy cc cng vic in s mng xc nh thi gian han thnh sm nht ca d n. cng l ng di nht trong mng v c t nht thi gian tr (the series of activities in a network diagram that determines the earliest completion of the project. It is the longest path through the network diagram and has the least amount of slack or float). o CPM (CRITICAL PATH METHOD or critical path analysis) K thut mng dng c tnh tng thi gian thc hin d n (a project network analysis technique used to predict total project duration). o S ph thuc (DEPENDENCY) Mi quan h (the sequencing of project activities or tasks; also called a relationship). o S ph thuc kn o (DISCRETIONARY DEPENDENCIES) dy cng vic c s dng rt cn thn, v c kh nng lm tr lch biu (sequencing of project activities or tasks defined by the project team and used with care since they may limit later scheduling). o HAT NG O (GI) (DUMMY ACTIVITIES) Cng vic khng c thi gian thc hin v ngun ti nguyn, c s dng biu din mi quan h logic gia hai cng vic trong so AoA (activities with no duration and no resources used to show a logical relationship between two activities in the arrow diagramming method of project network diagrams). o THI GIAN HAN THNH (DURATION) lng thi gian tht s lm vic ca mt cng vic (the actual amount of time worked on an activity plus elapsed time). o EF (EARLY FINISH DATE) Thi gian sm nht ca mt cng vic c th kt thc. (the earliest possible time an activity can finish based on the project network logic) o ES (EARLY START DATE) Thi gian sm nht ca mt cng vic c th bt u (the earliest possible time an activity can start based on the project network logic). o PH THUC BN NGAI (EXTERNAL DEPENDENCIES) dy cng vic lin quan n quan h cc hat ng ca d n v ngai d n (sequencing of project activities or tasks that involve relationships between project and non-project activities). o Theo di vt nhanh (FAST TRACKING) Mt k thut nn lch biu cho cc hat ng chng tro hay lm song hnh (a schedule compression technique in which you do activities in parallel that you would normally do in sequence).
Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

27

Chng 3. QL Thi gian. o PH THUC FF (FINISH-TO-FINISH DEPENDENCY) Quan h trn S mng t mt cng vic phi kt thc n mt cng vic c th kt thc (a relationship on a network diagram where the from activity must be finished before the to activity can be finished). o PH THUC FS (FINISH-TO-START DEPENDENCY) Quan h trn S mng t mt cng vic phi kt thc n mt cng vic c th bt u (a relationship on a project network diagram where the from activity must be finished before the to activity can be started). o a i tip (FORWARD PASS) Mt k thut S mng cho php Xc nh thi im bt u v kt thc sm nht cho cc hat ng (a network diagramming technique that determines the early start and early finish dates for each activities). o THI GIAN C TR [FREE SLACK (free float)] (the amount of time an activity can be delayed without delaying the early start of any immediately following activities). o S (CHART) GANTT nh dng chun cho vic trnh by thng tin lch biu cho php hin th thi gian bt u, thi gian kt thc trong mt nh dng xp lch (a standard format for displaying project schedule information by listing project activities and their corresponding start and finish dates in a calendar format). o LF (LATE FINISH DATE) Thi gian mun nht ca mt cng vic c th kt thc the latest possible time an activity can be completed without delaying the project finish date. o LS (LATE START DATE) Thi gian mun nht ca mt cng vic c th bt u (the latest possible time an activity may begin without delaying the project finish date. o S ph thuc bt buc (MANDATORY DEPENDENCIES) Xp dy cc hat ng gn kt vi bn cht ca cng vic (sequencing of project activities or tasks that are inherent in the nature of the work being done on the project). o Ct mc (MILESTONE) Mt s kin/bin c c ngha trong mt d n m thi gian bng 0 (a significant event on a project with zero duration). o nh lut (LAW) MURPHY Nu c ci g sai hng, th n c th ny sinh (if something can go wrong, it will). o S MNG (NETWORK DIAGRAM) a schematic display of the logical relationships or sequencing of project activities. o nh lut (LAW) PARKINSON Cng vic phnh ra lp y thi gian cho php (work expands to fill the time allowed) o c lng theo PERT c cho bi cng thc:

OP T + 4 x ML 6

T + PS T

o o o

o o

Trong : OP = Thi gian thun li (lc quan). ML = Thi gian ph hp (c kh nng) PS = Thi gian khng thun li (bi quan) PERT (PROGRAM EVALUATION AND REVIEW TECHNIQUE) K thut mng c tnh thi gian khi c s khng chc chn v c tnh thi gian ca mI cng vic (a project network analysis technique used to estimate project duration when there is a high degree of uncertainty with the individual activity duration estimates). Thi gian QL d n (PROJECT TIME MANAGEMENT) (the processes required to ensure timely completion of a project). IU KHIN LVH BIU (SCHEDULE CONTROL) (controlling and managing changes to the project schedule). Trin khai Lch biu (SCHEDULE DEVELOPMENT) Phn tch dy cc cng vic, c lng thi gian v ngun ti nguyn yu cu to mt lch biu (analyzing activity sequences, activity duration estimates, and resource requirements to create the project schedule). TR (SLACK) lng thi gian ca hat ng d n c th tr (cn gi l thi gian tri ni) (the amount of time a project activity may be delayed without delaying a succeeding activity or the project finish date; also called float) START-TO-FINISH DEPENDENCY Quan h trn S mng t mt cng vic khng th bt u n mt cng vic phi kt thc (a relationship on a project network diagram where the from activity cannot start before the to activity is finished)

Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

28

Chng 3. QL Thi gian. o START-TO-START DEPENDENCY Quan h trn S mng t mt cng vic khng th bt u n mt cng vic bt u (a relationship in which the from activity cannot start until the to activity starts). o TR TAN PHN (TOTAL SLACK) (total float) Thi hn cho mt hat ng c th b tr m khng lm tr n ngy kt thc d n (the amount of time an activity may be delayed from its early start without delaying the planned project finish date).

N TP
t ch ci ca cm t thch hp k vo cc m t nh s di y: A. B. C. D. E. F. G. H. I. J. K. L. M. N. O. P. a i tip (forward pass) Theo di vt nhanh (fast tracking) S ph thuc bt buc (mandatory dependency) S ph thuc kn o (discretionary dependency) Nn (Rt ngn) (crashing) S Mng D n (project network diagram) S Gantt. PERT CPM Bng ct mc/Bo co ct mc chnh (milestone chart/report) (Ct) mc (chnh) (milestone) tr tan phn (total slack) Lch biu theo chui ti hn (critical chain scheduling) nh lut Murphy nh lut Parkinson B m (buffer)

Xp dy cc hat ng gn kt vi bn cht ca cng vic. Mt k thut dng nn (rt ngn) lch biu vi chi ph tng bc t nht. Xc nh thi im bt u v kt thc sm nht cho cc hat ng. Xem xt cc rng buc v ti nguyn khi xc nh thi gian thc hin d n. Cng vic phnh ra lp y thi gian cho php. Nu c ci g sai hng, th n c th ny sinh. Thi hn cho mt hat ng c th b tr m khng lm tr n ngy kt thc d n. ____8. Mt s kin/bin c c ngha trong mt d n m thi gian bng 0. ____9. Cc hat ng chng tro hay lm song hnh nn lch biu. ____10. K thut mng c tnh thi gian khi c s khng chc chn v c tnh thi gian ca mI cng vic. ____11. K thut mng dng c tnh tng thi gian thc hin d n. ____12. Trnh by thng tin cp cao v lch biu, thng cho cp trng. ____13. nh dng chun cho vic trnh by thng tin lch biu cho php hin th thi gian bt u, thi gian kt thc trong mt nh dng xp lch. ____14. Trnh by s cc quan h logic ca cc hat ng ca d n. ____15. Thi gian thm vo han tt mt nhim v (cng vic), cng thm vo mt c tnh d phng cho nhiu nhn t khc nhau.
Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

____1. ____2. ____3. ____4. ____5. ____6. ____7.

29

Chng 3. QL Thi gian.

PHU LUC: Phng php CPM.

Phng phap CPM thc hien theo quy trnh sau :
1. 2. 3. 4. Lap s o mang. Tnh ng ti han. Tnh chi ph rut ngan tren 1 tuan (1 n v thi gian) cho moi cong viec cua mang. Chon cong viec tren ng ti han vi chi ph rut ngan nho nhat. Rut ngan toi a cong viec nay. 5. Kiem tra e chac chan ng ti han rut ngan van con la ng ti han. Neu ng ti han van con la ng dai nhat qua mang. Tr lai bc 5. Neu khong tm ng ti han mi va quay lai bc 5.

Ta xet th du sau. Xet mot cong trnh trong o co tat ca 13 cong viec c thc hien trong bang sau: Cong viec TGBT TGRN CPBT CPRN Cong viec trc A 6 4 200 210 B 10 7 500 650 C 10 8 450 500 D 12 11 750 780 A, B E 4 3 150 160 B F 2 1 70 75 C G 9 6 800 900 C H 5 3 170 200 B, E I 8 6 560 600 B, E, C, F J 2 1 300 345 B, E, H K 10 7 720 750 A, B, D L 3 1 90 100 B, E, C, F, H, I, J M 9 6 620 650 C, G TGBT: Thi gian bnh thng CPBT: Chi ph bnh thng TGRN: Thi gian rut ngan CPRN: Chi ph rut ngan n v tnh. Thi gian: tuan Chi ph: trieu ong Vi th du tren, cac bc trong qui trnh c thc hien nh sau :
1. LAP S O MANG. Phan hoach cac cong viec theo tng MC va xac nh cac cong viec phai lam ngay trc o cho moi cong viec. Cac cong viec trong toan bo cong trnh c phan hoach theo tng nac theo nguyen tac: cac cong viec torng cung mot MC khong co quan he trc sau vi nhau va co cong viec trc nam mot MC trc. Trong moi cot cac cong viec khong co viec trc hp thanh mot nac (co dau - ).
30

Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

Chng 3. QL Thi gian.

Cong viec A B C D E F G H I J K L M

Cong viec trc A, B B C C B, E B, E, C, F B, E, H A, B, D B, E, C, F, H, I, J C, G

Cong viec trc A, B B V V E E, F H D

E E, F E, H D E, F, H, I, J, G

H H, I, J -

J -

Ta co cac nac: N0 = {A, B, C}, N1 = {D, E, F, G},

N2 = {H, I, K, M}, N3 = {J},

N4 = {L}

Ta co bieu dien moi cong viec bang nh hay bang cung. ay chon bieu dien cong viec la cung Moi nh bieu dien mot s kien, s kien la ni cham dt mot cong viec trc va bat au mot cong viec tiep theo.

Cac cong viec c xep t trai sang phai, co ghi thi gian thc hien. Neu mot cong viec co hai cong viec trc trc tiep cung nac th phai noi hai cong viec o bang mot cong viec ao, co thi gian thc hien bang khong. Th du, D co hai cong viec trc trc tiep A, B cung nac nen noi A, B bang mot cong viec ao (mui ten cham).
2. TNH NG TI HAN. 2.1. Lap bang phantch sau: Phan tch CPM Thi gian hoan ES LS thanh

Hoat ong -

EF

LF

LS-ES

Thi gian thanh cong trnh = Tong chi ph = Trong o: ES (Earliest Start) = Thi gian sm nhat cua mot cong viec co the bat au. EF (Earliest Finish) = Thi gian sm nhat e mot cong viec co the ket thuc. LS (Latest Start) = Thi gian muon nhat cua mot cong viec co the bat au. LF (Latest Finish) = Thi gian muon nhat e mot cong viec co the ket thuc. EF va LS c cho bi cong thc: EF = ES + thi gian hoan thanh LS = LF thi gian hoan thanh Thi gian hoan thanh cong trnh = Max {EF cua tat ca cong viec} Tong chi ph = Tong tat ca chi ph cua moi cong viec.
Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

31

Chng 3. QL Thi gian.

Chu y: - ES cua cong viec nac 0 bang 0 - ES cua 1 cong viec = max {EF cua moi cong viec trc trc tiep} - LF cua cong viec cuoi cung = Thi gian hoan thanh cong trnh. - LF cua 1 cong viec trc trc tiep = min {LS cong viec i sau} Vi th du tren, ta tnh c: Phan tch CPM Hoat ong Thi gian hoan thanh ES LS EF LF LS-ES 4 10 6 4 0 6 A 10 10 10 10 0 10 B 4 14 10 4 0 10 C 0 10 10 10 10 0 C (ao) 0 22 22 10 10 12 D 7 21 14 17 10 4 E 9 21 12 19 10 2 F 4 23 19 14 10 9 G 7 21 14 21 14 0 G (ao) 8 27 19 22 14 5 H 7 29 22 21 14 8 I 8 29 21 27 19 2 J 0 32 32 22 22 10 K 7 32 25 29 22 3 L 4 32 28 23 19 9 M Thi gian thanh cong trnh = 32 Tong chi ph = 5380 Chu y. C va G la hai cong viec ao. 2.2. CH RA ONG TI HAN. ng ti han la ng noi nhng cong viec ti han. Cong viec ti han la nhng viec ma khong cho phep tre, v tre se anh hng en viec tre han cua ca cong trnh. Nh vay, theo nh ngha, ta co Cong viec ti han la cong viec ma LS ES = 0 Theo th du tren ng ti han la CP # 1: B D K. 3. TNH CHI PH RUT NGAN TREN MOT N V THI GIAN (1 tuan). Chi ph nay c tnh theo cong thc: Chi ph rut ngan/1 tuan=(CPRNCPBT)/(TGBT TGRN) ( ay gia s chi ph rut ngan la tuyen tnh).
Cong viec TGBT
6 10 10 12 4 2 9 5 8 2 10 3 9

TGRN
4 7 8 11 3 1 6 3 6 1 7 1 6

CPBT
200 500 450 750 150 70 800 170 560 300 720 90 620

CPRN
210 650 500 780 160 75 900 200 600 345 750 100 650

Chi ph rut ngan n v

(210 200) / (6 4) = 5 (650 500) / (10 7) = 50 (500 450) / (10 8) = 25 (780 750) / (12 11) = 30 (160 150) / (4 3) = 10 (75 70) / (2 1) = 5 (900 800) / (9 6) = 33.3 (200 170) / (5 3) = 15 (600 560) / (8 6) = 20 (345 300) / (2 1) = 45 (750 720) / (10 7) = 10 (100 90) / (3 1) = 5 (650 620) / (9 6) = 10

A B C D E F G H I J K L M Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

32

Chng 3. QL Thi gian.

4. CHON CONG VIEC TREN ONG TI HAN VI CHI PH RUT NGAN NHO NHAT.

Theo th du tren ng ti han la CP # 1 : B - D K Rut ngan tren ng ti han: Cong viec B rut ngan 3 tuan. Thi gian hoan thanh mi = 7 va chi ph tang = 50 x 3 = 150 Cong viec D rut ngan 1 tuan Thi gian hoan thanh mi = 11 va chi ph tang = 30 x 1 = 30 Cong viec K rut ngan 3 tuan Thi gian hoan thanh mi = 7 va chi ph tang = 10 x 3 = 30 Lap bang phan tch e kiem tra ng ti han ta co:
Hoat ong
A B C C (ao) D E F G G (ao) H I J K L M

Thi gian hoan thanh

6 7 10 0 11 4 2 9 0 5 8 2 7 3 9

Phan tch CPM ES LS

0 0 0 7 7 7 10 10 11 11 12 16 18 20 19 4 3 0 10 10 13 15 10 17 18 17 23 21 25 19 6 7 10 7 18 11 12 19 11 16 20 18 25 23 28

EF
10 10 10 10 21 17 17 19 17 23 25 25 28 28 28

LF
4 3 0 3 3 6 5 0 6 7 5 7 3 3 0

LS-ES

Thi gian thanh cong trnh = 28

Tong chi ph = 5590

ng ti han la CP # 1 : C - G - M ng ti han cu b mat, viec rut ngan tren cha phai la toi u. Ta chon mot cong viec khac e rut ngan, th du chon M ta co: Cong viec B rut ngan 3 tuan. Thi gian hoan thanh mi = 7 va chi ph tang = 50 x 3 = 150 Cong viec D rut ngan 1 tuan Thi gian hoan thanh mi = 11 va chi ph tang = 30 x 1 = 30 Cong viec K rut ngan 3 tuan Thi gian hoan thanh mi = 7 va chi ph tang = 10 x 3 = 30 Cong viec M rut ngan 3 tuan Thi gian hoan thanh mi = 6 va chi ph tang = 10 x 3 = 30
Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

33

Chng 3. QL Thi gian.

Lap lai bang phan tch e kiem tra ng ti han, ta co:

Phan tch CPM Hoat ong Thi gian hoan thanh ES LS 4 0 6 A 3 0 7 B 0 0 10 C 10 7 0 C (ao) 10 7 11 D 13 7 4 E 15 10 2 F 10 10 9 G 17 11 0 G (ao) 18 11 5 H 17 12 8 I 23 16 2 J 21 18 7 K 25 20 3 L 19 19 6 M Thi gian thanh cong trnh = 25

EF LF LS-ES 1 7 6 0 7 7 0 10 10 0 7 7 0 18 18 3 14 11 2 14 12 0 19 19 3 14 11 4 20 16 2 22 20 4 22 18 0 25 25 2 25 23 0 25 25 Tong chi ph = 5620

ng ti han la CP # 1 : B C D G K M. ng ti han cu khong b mat. Vay viec rut ngan tren la toi u, ta khong the rut ngan thi han hoan thanh cong trnh c na. Chu y. Trong trng hp mang kha ln, e tranh mat nhieu thi gian trong viec kiem tra ng ti han rut ngan toi u, ta a bai toan ve mo hnh quy hoach tuyen tnh e giai.

Trng M Dung www.fit.hcmuns.edu.vn/~tmdung Mail= tmdung@fit.hcmuns.edu.vn

34