Q.1 What is the difference between Total Float and the Free Float?

Total float is the amount of time that a schedule activity can be delayed from its early start date
without delaying the project end date or violating any schedule constraints.

The free float is the amount of time that a schedule activity can be delayed without delaying the
early start date of any subsequent schedule activities.

In determining the amount of float in a task, you need to look at both types of float.
NOTE: Free float can ONLY occur when two or more activities share a common successor, or in
other words, when activities converge on a Network Diagram.

Q.2 What is the difference between Progress Over rite and Retain Logic in scheduling
process?

These are two primary means/choices of handling out-of-sequence progress (types of logic to
use to schedule progressed activities). These two choices are just what they imply; either
retaining the original sequencing logic, or allowing progress to override the old sequencing logic.

Out-of-sequence work is when work begins on an activity prior to the completion of its
predecessor activities. This definition assumes the activities have a finish-to-start relationship
without any lag or lead time.

Progress Override

Selecting Progress Override will treat the activity with out-of-sequence progress as if it has no
predecessors so it can continue without being affected by its incomplete predecessors.

Its important to reiterate that this option essentially ignores the network logic affecting this activity
since it treats it as if it has no predecessors. The report identifying out-of-sequence work will still
indicate activities that are out of sequence, but will reflect the selection of Progress Override.

Retained Logic

Selection of the Retained Logic option will allow the affected activity to start early, but schedule its
completion in accordance with the network logic. The activity will not be allowed to complete until
all its predecessors are completed, and the original duration is satisfied.

The selection sample below illustrates how the Primavera software sets forth those options.




Q.3 What is the difference between Activity % Complete, Duration % Complete, Physical %
Complete and Unit % Complete?



Q.3 How to deal with Baseline and get Variance?

This will be answered soon.


Q.4 What is the Longest Path & Critical Path?
&
Q.5 What is the Longest Path & Critical Activities?


CRITICAL PATH is the longest continuous chain of activities (may be more than one path)
which establishes the minimum overall project duration. A slippage or delay in completion of any
activity by one time period will extend final completion correspondingly. The critical path by
definition has no float.

LONGEST PATH (LP) is the longest continuous path of activities through a project, which
controls project early completion. It is possible for otherwise defined critical path activities to not
be on the longest path and longest path activities to not show calculated critical float. The longest
path analysis is unaffected by activity calendars. The longest path is determined by the string of
activities, relationships, and lags that push the project to its latest, early finish date. The longest
path is calculated by first performing a CPM forward pass to determine driving relationships and
the projects latest, early finish date. The activity (or activities) with the latest, early finish dates
are then identified and all predecessor driving relationships traced back to the project start date.
These activities constitute the projects longest path. The longest path depends upon
relationships driving the timing of activity starts, thus use of constraints and resource leveling can
interrupt and invalidate longest path analysis. Use of interruptible activities can also result in false
longest path indications. For complete accuracy, longest path analysis should take place absent
of constraints, resource leveling, and/or interruptible activities.

Q.6 How many types of Relationships?

See attachment: Relationship Types.pdf

Q. 7 How many types of Constraints?

See attachment: p5 Notes.pdf