chapter 3 : MANAGING PROJECT.
PROJECT
Is an interrelated set of activities that has definite starting and ending point and the result in unique product or services. for example is building construction and introducing a new product.
-PROJECT ORGANIZATION
this is to make sure that program can run smoothly on day by day basis while new project will
successfully completed.
PROJECT MANAGEMENT TECHNIQUES
There are two technique which is PROGRAM EVALUATION AND REVIEW TECHNIQUE(PERT) and the CRITICAL PATH METHOD(CPM). They were both developed to help managers schedule, monitor and control large complex project.
-PERT and CPM NETWORK METHOD
there are three : 1) ACTIVITY- the smallest unit of work effort consuming both time and resources
that the project manager can schedule and control.
2)PRECEDENCE RELATIONSHIP- A sequencing constraint between interrelated
activities by which one activity cannot start
until a preceding activity has been completed.
3)SCHEDULE- A plan that sets priorities, determines start and finish times, and
allocates resources to accomplish the activities.
- NETWORK DIAGRAM AND APPROACHES
there are two approaches for drawing a project network. which is ACTIVITY ON NODE (AON)
and ACTIVITY ON ARROW(AOA). for AON it is a network diagram in which node designated
activities. While for AOA means a network diagram in which arrow designate activities. furthermore,
CRITICAL PATH is about the computed longest time path(s) through a network.
example of AOA
example of AON
okay, now we gonna talk about how to find a slack time. slack time is the length of time an activity can be delayed without delaying the entire project. here the calculation how to calculate the slack time. this is very easy to understand.
SLACK = LS - ES // SLACK = LF - EF
example of slack time calculation |
lastly, in PERT they employ a probability distribution based on three time estimates for each activity , as follows :
1) optimistic time (a) = the best activity completion time that could be obtained in a PERT network.
2) pessimistic time (b) = the worst activity time that could be expected in a PERT network.
3) most likely time (m)= the most probable time to complete an activity in a PERT network.
No comments:
Post a Comment