tassawarshahzad2
1,259 views
21 slides
Nov 20, 2019
Slide 1 of 21
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
About This Presentation
this presentation cover all about project network planing
Size: 407.92 KB
Language: en
Added: Nov 20, 2019
Slides: 21 pages
Slide Content
Presentation Topic: Project network
Group Members: Economic and social benefits Arslan (48) Zeshan (13R) Tassawar (51) Abu baker (10)
Presentation contents Project network Definition of project Network Diagram Network Planning methods Basic Building blocks of Network What is project network Approaches of project network Project Networks Rules
Project: project is a group or combination of activities that must be executed in a certain fixed order before entire task is completed The projects are non-repetitive large tasks
Real time example for a project Project : Make a school Get location Get information about area Get Finance Get approval Get capital These are the basic activities we need to complete for accomplishment of project.
Network Diagram Network: Network is a graphical representation of a project operations and it is composed of several activities and events which are inter-related. Network consists of: Event Activity
Network Planning methods Methods used for network planning are: CPM PERT Managing a project with network planning methods involves four steps : Describing the project. Diagramming the Network. Estimating time of completion. Monitoring project progress.
CPM CPM means “critical path method”. It is a network technique used to evaluate the project. If the activity times are deterministic then critical path method can be used as a systematic method. CPM evaluates project by determining critical path in the network
Critical event: The events with zero slack Critical path is the longest path in the network from the starting event to ending event Critical path defines minimum time required to complete the project In network diagram critical path is represented with double arrows Critical path consist: Critical activity: The activities with zero total float Critical Path Critical Path
PERT PERT means project (or) program Evaluation & Review Technique. When activity times are probabilistic, PERT is an effective tool for evaluate project. PERT is associated with 3 time estimates Optimistic Time ( to ) Pessimistic Time ( tP ) Most likely Time ( tm)
Activity Times in PERT Optimistic Time: ( To ) It is the minimum time that is required to complete an activity when every resource is available Most likely Time: (Tm) This is the time required for the completion of activity under normal conditions. Pessimistic Time: ( Tp ) The most time that is required to complete activity when every resource is not available
Basic Building blocks of Network Activity: Activity is a recognizable part of the project which consume time and resources for its completion. In network diagram “ARROW” represents activity Critical activity Dummy activity Event : An event represents the accomplishment of some task. In a network diagram, beginning and ending of an activity represented by an event. In network diagram “NODE” represents event. Merge event Burst event
What is project network A project network is a graph depicting the sequence in which a project's terminal elements are to be completed by showing terminal elements and their dependencies. It is always drawn from left to right to reflect project chronology.
Approaches of project network Activity-on-Arrow (AOA): Uses an arrow to depict an activity Activity-on-Node (AON): Uses a node to depict an activity
Activity on Arrow (AOR) Activities are shown by Arrow Length of Arrow may show relative time to complete tasks Task A Task B Task C Task D Task E Nodes show where activities end and begin in sequence. The starting node for an activity is the activity’s “ i -node,” the ending node is the “j-node Each project has a starting “ i -node” and ending “ jnode ”
Activity on Node (AON) Activities are show in nodes or boxes Task C is a predecessor to Task E and a successor to Task A Project Has a Start and an End Arrow show dependencies. Task D can’t start until both Task A and B have completed Task A Task B Task C Task D Task E End Start
Project Networks Task Task Task Task Task Task A B C D E F
Project Networks Rules Networks typically flow from left to right. An activity cannot begin until all of its preceding activities are complete. Arrows indicate precedence and can cross over each other . Identify each activity with a unique identifier; this identifier must increment (1.2.3, A,B,C, etc.) as the network proceeds. Looping is not allowed. Conditional statements are not allowed. Use start and stop nodes.
Time-Related Task Properties DR = Duration ES = Early Start EF = Early Finish LS = Late Start LF = Late Finish SL = Slack or Float