10
Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis with backward scanning and crashing We now use a more formal process to work out float times and the critical path. Along with the informal rules and techniques already developed, we need to define two more rules that must be followed in order to successfully complete a critical path analysis of the network. Rule 1. Two nodes can be connected directly by a maximum of one edge. Rule 2. An activity must be represented by exactly one edge. Backward scanning Backward scanning starts at the end node and moves backward through the network subtracting the time of each edge from the earliest start time of each succeeding node. When two or more paths are followed back to the same node the smallest such difference is recorded. The results of each backward scanning step yield the latest start time for each activity. Latest start time is the latest time an activity can start without delaying the project. Earliest finish time (EFT) for an activity is equal to the earliest start time (EST) of the activity plus its duration.

Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Embed Size (px)

Citation preview

Page 1: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

1

August 01, 2012

Jul 22­10:52 AM

Critical path analysis with backward scanning and crashingWe now use a more formal process to work out float times and the critical path.Along with the informal rules and techniques already developed, we need to define two more rules that must be followed in order to successfully complete a critical path analysis of the network.

Rule 1. Two nodes can be connected directly by a maximum of one edge. Rule 2. An activity must be represented by exactly one edge.

Backward scanningBackward scanning starts at the end node and moves backward through the network subtracting the time of each edge from the earliest start time of each succeeding node. When two or more paths are followed back to the same node the smallest such difference is recorded. The results of each backward scanning step yield the latest start time for each activity. Latest start time is the latest time an activity can start without delaying the project.

Earliest finish time (EFT) for an activity is equal to the earliest start time (EST) of the activity plus its duration.

Page 2: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

2

August 01, 2012

Jul 22­11:21 AM

Page 3: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

3

August 01, 2012

Jul 22­11:30 AM

Page 4: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

4

August 01, 2012

Jul 24­8:35 AM

Page 5: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

5

August 01, 2012

Jul 22­11:47 AM

Dummy activities

Page 6: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

6

August 01, 2012

Jul 22­12:10 PM

Page 7: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

7

August 01, 2012

Jul 25­11:31 AM

Page 8: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

8

August 01, 2012

Jul 31­2:22 PM

Page 9: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

9

August 01, 2012

Jul 31­2:51 PM

Page 10: Critical path analysis with backward scanning and … · Critical path analysis with backward scanning and crashing.notebook 1 August 01, 2012 Jul 2210:52 AM Critical path analysis

Critical path analysis with backward scanning and crashing.notebook

10

August 01, 2012

Aug 1­10:58 AM

from the calculator