NETWORK SCHEDULING TECHNIQUES
description
Transcript of NETWORK SCHEDULING TECHNIQUES
![Page 1: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/1.jpg)
04/21/23 1
NETWORK SCHEDULING TECHNIQUES
![Page 2: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/2.jpg)
04/21/23 2
Network DiagramsPMI defines the scheduling process as:
“the identification of the project objectives and the ordered activity necessary to complete the project including the identification of resource types and quantities required.”
Project scheduling defines the network logic for all activities that must either precede or succeed other tasks from the beginning of the project until its completion.
![Page 3: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/3.jpg)
04/21/23 3
Network DiagramsProvide a basis for planning and how to use the resourcesIdentify the critical path and project completion timeIdentify where slacks (float) areReveal interdependencies of activitiesAid in risk analysis (what-if analysis)
![Page 4: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/4.jpg)
04/21/23 4
Network Diagrams
Show interdependence
Facilitate communication
Help schedule resources
Identify critical
activities
Determine project completion
Show start & finish dates
![Page 5: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/5.jpg)
04/21/23 5
Network Scheduling TechniquesNetwork scheduling techniques provide a logical process to consider the order in which the project activities should occur.The primary methods for developing project activity networks are:
Program Evaluation and Review Technique (PERT)Critical Path Method (CPM) – Also called Arrow Diagram Method (ADM)Precedence Diagram Method (PDM)
![Page 6: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/6.jpg)
04/21/23 6
Network Scheduling TechniquesThere are two ways to show the network:
Activity-On-Node (AON) – nodes represent the activitiesActivity-On-Arch (AOA) – archs represent the activities
AON is easier, and it used in commercial software.
![Page 7: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/7.jpg)
04/21/23 7
AOA vs. AON
activities on arc
C
ED
B F
E
C
DB F
activities on node
![Page 8: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/8.jpg)
04/21/23 8
PERT/CPM
PERT was developed in the late 1950s in collaboration between the US Navy, Booz-Allen Hamilton and Lockeed Corporation for the creation of the Polaris missile program.CPM was developed at the same time by DuPont.Over the years the differences between PERT and CPM have blurred, so it is common to refer these techniques as just PERT/CPM.
![Page 9: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/9.jpg)
04/21/23 9
Precedence Diagramming Method (PDM)
PERT/CPM networks do not allow for leads and lags between two activities; i.e. a preceding activity must be completely finished before the start of the successor activity.Precedence Diagramming Method (PDM) allows these leads and lags.Most project management software systems use PDM and show interrelationships on bar charts.
![Page 10: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/10.jpg)
04/21/23 10
Precedence Networkin a Gannt Chart
TASKS 1 2 3 4 5
4
MONTHS AFTER GO-AHEAD
3
2
1
5
![Page 11: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/11.jpg)
04/21/23 11
Network Development Rules All activities must be linked to each otherNetwork diagrams flow from left to rightAn activity cannot begin until all preceding connected activities have been completedEach activity should have a unique identifier (number, letter, code, etc.)Looping is not permittedIt is common to start from a single beginning and finish on a single ending node
![Page 12: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/12.jpg)
04/21/23 12
Steps in Creating the NetworkDefine the project and all of its significant activitiesDevelop the relationship among activitiesDecide which activities must precede othersDraw the network connecting all of the activitiesCompute the longest path which is the critical pathCalculate activity slacks (float)Use the network to help plan, schedule, and control the project
![Page 13: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/13.jpg)
04/21/23 13
Node Labels Nodes representing activities should be labeled with the following information:
IdentifierDescriptionDurationEarly Start TimeEarly Finish TimeLate Start TimeLate Finish TimeFloat
![Page 14: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/14.jpg)
04/21/23 14
Node Labels
Early Start
Activity Float Activity Descriptor
Late Start
ID Number
Activity Duration
Late Finish
Early Finish
![Page 15: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/15.jpg)
04/21/23 15
Node Labels Early Start (ES) – Earliest possible date an activity can start based on the network logic and any schedule constraints.Early Finish (EF) = ES + DurLate Start (LS) – Latest possible date an activity may begin without delaying a specified milestone (usually project finish date).Late Finish (LF) = LS + Dur
![Page 16: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/16.jpg)
04/21/23 16
Project Scheduling Terms
• Successors
• Predecessors
• Network diagram
• Serial activities
• Concurrent activities
ED
C
B
A F
• Merge activities
• Burst activities
• Node
• Path
• Critical Path
![Page 17: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/17.jpg)
04/21/23 17
Project Scheduling ActivitiesSerial activities flow from one to the nextConcurrent activities are accomplished at the same timeMerge activities have two or more immediate predecessorBurst activities have two or more successor activities
![Page 18: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/18.jpg)
04/21/23 18
Serial Activities
![Page 19: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/19.jpg)
04/21/23 19
Parallel Activities
![Page 20: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/20.jpg)
04/21/23 20
Merge Activities
Activity A
Activity B
Activity C
Activity D
![Page 21: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/21.jpg)
04/21/23 21
Burst Activities
Activity C
Activity B
Activity A
Activity D
![Page 22: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/22.jpg)
04/21/23 22
Example
Activity Description Predecessors DurationA Contract signing None 5B Questionnaire design A 5C Target market ID A 6D Survey sample B, C 13E Develop presentation B 6F Analyze results D 4G Demographic analysis C 9H Presentation to client E, F, G 2
![Page 23: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/23.jpg)
04/21/23 23
Example
A Contract
5
C Market ID
6
B Design
5
G Demog.
9
EDev. Present.
6
D Survey
13
F Analysis
4
H Present
2
![Page 24: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/24.jpg)
04/21/23 24
ExamplePath One: A-B-E-H = 18 weeksPath Two: A-B-D-F-H = 29 weeksPath Three: A-C-D-F-H = 30 weeksPath Four: A-C-G-H = 22 weeks
Path three is the critical path
![Page 25: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/25.jpg)
04/21/23 25
Forward PassForward pass determines the earliest times (ES) each activity can begin and the earliest it can be completed (EF).There are three steps for applying the forward pass:
Add all activity times along each path as we move through the network (ES + Dur = EF)Carry the EF time to the activity nodes immediately succeeding the recently completed node. That EF becomes the ES of the next node, unless the succeeding node is a merge pointAt a merge point, the largest preceding EF becomes the ES for that node (because the earliest the successor can begin is when all preceding activities have been completed)
![Page 26: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/26.jpg)
04/21/23 26
Forward Pass
0 A 5Contract
5
5 B 10Design
5
5 C 11Market ID
6
11 D 24Survey
13
11 G 20Demog.
9
24 F 28Analysis
4
10 E 16Dev. Present
6
28 H 30Present
2
Activity D is a merge point for B and CActivity H is a merge point for E, F, and G
![Page 27: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/27.jpg)
04/21/23 27
Backward PassThe goal of the backward pass is to determine each activity's Late Start (LS) and Late Finish (LF) times.There are three steps for applying the backward pass:
Subtract activity times along each path through the network (LF – Dur = LS).Carry back the LS time to the activity nodes immediately preceding the successor node. That LS becomes the LF of the next node, unless the preceding node is a burst point.In the case of a burst point, the smallest succeeding LS becomes the LF for that node (because the latest the predecessor can finish is when any one of the successor activities should start)
![Page 28: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/28.jpg)
04/21/23 28
Backward Pass
0 A 5Contract
0 5 5
5 B 10Design
6 5 11
5 C 11Market ID
5 6 11
11 D 24Survey
11 13 24
11 G 20Demograph.
19 9 28
24 F 28Analysis
24 4 28
10 E 16Dev. Present 22 6 28
28 H 30Presentation
28 2 30
Activities A, B, and C are burst points
![Page 29: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/29.jpg)
04/21/23 29
Slack Time (Float)Since there exists only one path through the network that is the longest, the other paths must either be equal or shorter.Therefore, there are activities that can be completed before the time when they are actually needed.The time between the scheduled completion date and the required date to meet critical path is referred as the slack time.The activities on the critical path have zero slack time.
![Page 30: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/30.jpg)
04/21/23 30
Slack Time (Float) The use of slack time provides better resource scheduling.It is also used as warning sign i.e. if available slack begins to decrease then activity is taking longer than anticipated.Slack time is equal to:
LS – ES or LF – EFActivities on the critical path have 0 slack; i.e. any delay in these activities will delay the project completion.
![Page 31: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/31.jpg)
04/21/23 31
Complete Activity Network
0 A 50 Contract
0 5 5
5 B 101 Design6 5 11
5 C 110 Market ID
5 6 11
11 D 240 Survey
11 13 24
11 G 208 Demograph.19 9 28
24 F 280 Analysis24 4 28
10 E 1612 Dev. Present
22 6 28
28 H 30 0 Presentation
28 2 30
![Page 32: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/32.jpg)
04/21/23 32
Reducing the Critical Path Eliminate tasks on the Critical Path Convert serial paths to parallel when possible Overlap sequential tasks Shorten the duration on critical path tasks Shorten
early taskslongest taskseasiest taskstasks that cost the least to speed up
![Page 33: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/33.jpg)
04/21/23 33
Lag Lag is the time between Early Start or Early Finish of one activity and Early Start and Early Finish on another activity.For example, in a Finish-to-Start dependency with a 10-day lag, the successor activity cannot start until 10 days after the predecessor activity has finished.Lags are not the same as slacks. Lags are between activities whereas slacks are within activities.
![Page 34: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/34.jpg)
04/21/23 34
Finish to Start Lag• Most common type of sequencing
• Shown on the line joining the modes– Added during forward pass– Subtracted during backward pass
0 A 6Spec Design
6
6 B 11Design Check
5
15 C 22Blueprinting
7
Lag 4
This lag is not
the same as
activity slack
![Page 35: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/35.jpg)
04/21/23 35
LeadLead allows an acceleration of the successor activity. We can expedite the schedule by not waiting a preceding activity to be completely finished before starting its successor. For example, in a Finish-to-Start dependency with a 10-day lead, the successor activity can start 10 days before the predecessor activity has finished.
![Page 36: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/36.jpg)
04/21/23 36
Laddering Activities
Project ABC can be completed more efficiently if subtasks are used (Fast Tracking)
A(3) B(6) C(9) ABC=18 days
Laddered ABC=12 days
A1(1) A2(1) A3(1)
B1(2) B2(2) B3(2)
C1(3) C2(3) C3(3)
![Page 37: NETWORK SCHEDULING TECHNIQUES](https://reader033.fdocuments.net/reader033/viewer/2022061612/568150bd550346895dbedc5a/html5/thumbnails/37.jpg)
04/21/23 37
Hammock Activities
Used as summaries for subsets of activities
0 A 5
0 5 5
5 B15
5 1015
15 C 18
15 3 18
0 Hammock 18
0 18 18
Useful with a complex project or one that has
a shared budget