University of technology civil engineering

Precedence diagram method

‫تخطيط الشبكات بطريقة األسبقيات‬

Muhammed abdulhussein kadhim

Structure brunch
4th stage

2019-2020
1-1 Introduction:
Although the birth of Precedence Diagramming Method (PDM) is not as
radiant as of CPM or PERT, but it is definitely the prevailing scheduling
technique of our times. This popularity is due to its modeling flexibility
over other techniques and the easy-to-understand mathematical model
behind the technique. However, even this technique has its own limita-
tions; modeling overlapping activities in a proper way seems to be a
never-ending debate. The reason of this can be found in the
fundamentals of PDM technique; the four precedence relationships that
form connections between the end-points of the activities, and the
activities that are assumed to be continuous with constant production
speed. These fundamentals of PDM have their own consequences to
scheduling practice; it is more and more apparent among professionals
that activity overlapping in PDM cannot be modeled adequately.
Different solutions were proposed for solving this problem from the
application of negative lag, through the combination of SS and FF
relations to the fragmentation of activities. All these solutions have their
shortcomings. Probably the fragmentation technique has led to the
development of point-to-point type of relation that can connect any
arbitrary points of the dependent activities. The objective of this paper is
to analyze the pros and cons of different solutions that are used for
modeling overlapped activities, then to show how newly defined point-
to-point relations can be used for this purpose. Algorithms that handles
point-to-point relations with minimal and maximal lags are also
presented. The main finding of the paper is that newly developed point-
to-point relations are better from theoretical and practical point of view
than the solutions based on traditional precedence relationships, but
they still cannot provide theoretically perfect solution for overlapping.
This paper is the fully extended version of a paper building on the results
already presented on the Creative Construction Conference (1).
1-2 Types of Precedence Diagramming Method
Relationships:
The significant output in the Sequence Activities process is the Network
Diagram. Amidst the sequence activities process, the activities that are
explained in the define activities process is sequenced as specific
activities that rely upon another. While the network diagram shows the
project activities and presents the interrelationships of activities, the
Precedence Diagramming Method (PDM) is the most widely-recognized
strategy to draw network diagrams. So it is normal for certain affiliates
and dependencies between the activities in Precedence Diagramming
Method. With the precedence diagramming method, four types of
relationships are used in the activities to complete the network diagram
of a project. They are(2):

o Finish-to-Start (FS) : This is the most common dependency type

used between activities. If an activity cannot start before a
predecessor activity finishes, then a finish-to-start dependency
must be between these activities. For instance, in a construction
project, you cannot paint the building before you complete the
construction. In a software project, you cannot start testing of a
screen before it is developed. These are examples of finish-to-
start dependencies of the activities in Precedence Diagramming
Method.
o Start-to-Start (SS): This type of dependency shows that two
activities will start together. For instance, in a construction
project, building the mainframe of the construction will start with
the procurement of materials. In this case, these activities will be
shown as start-to-start dependent in the network diagram.
o Finish-to-Finish (FF): This type of dependency shows that two
activities in a project will finish together. For instance, in a
software project, during tests, bugs will be found regarding the
developed software. And these bugs will be fixed by the software
developers. But after that, the testing team must re-check
whether the bug is really fixed. Therefore, testing and bug fix
activities are an example for finish-to-finish type of dependency in
Precedence Diagramming Method.
o Start-to-Finish (SF): In this type of dependency, Activity B can
finish only after Activity A starts. These types of relationships can
be used in just-in-time supply chain materials for example. Let’s
 assume that you are working in a car manufacturing company and
in your assembly line, you are using an electrical component for
the cars which is provided by a supplier. And let’s say, there are
100 components in your warehouse. But, you have a threshold
that if this number of components falls below 20, a new order
should be placed to the supplier of the electronic component. In
this case, there is a Start-to-finish dependency between the
remaining number of electronic components in the warehouse
and placing a new order.

1-3 Types of Dependencies in Precedence Diagramming

Method :
o Mandatory Dependency is known as hard logic is an integral part
of the work. For instance, if you’re working on a project, you
cannot test a screen that is yet to be developed entirely in the
project. Consequently, in this case, there is a mandatory
dependency between the development and testing of the
screen(3).
o Discretionary Dependency also referred to as preferential or soft
logic is controlled by the project team and can be changed to
abbreviate the project. In this technique, activities stay the same,
yet, the order changes(3).
o External Dependency comes from outside of the project — for
instance, a government regulation expected to finish before
proceeding with the outstanding of the project activities(3).
o Internal dependency is a method that involves a precedence
relationship between project activities. For instance, if there are
activities appointed to a member of the project team, he can't
begin to work on that until the previous project finishes even
though there is not a mandatory dependency(3).
1-4 Example:
A part of precedence network as shown below find
1- The total float for activity B , A?
2- Critical path for this part?
3- Free float for critical path ?
4- Free float for E ,J ?
5- Draw this part in arrow network ?

Solution:
(1) The total float for activity B , A

T.F for A = 0 because it is first activity

T.F for B = T.Fi = min {lag (ij) + T.Fj}

0 + 3= 3
T.F for B = min { 2 + 7 = 9
0 + 2 =2

Take T.F for B = 2

(2) The Critical path for this part

C.P is A-C-F-J
(3) The Free float for critical path

The F.F for A and C and F and J is zero because the critical has no .
. total float or free float

(4) Free float for E ,J

F.F = min lag

F.F for E = 3

F.F for J = 0

(5) The arrow network

1-5 Discussion:
The total float for A, is zero because A is the beginning activity and the
total float for activity B is 2 because we choose the minimum total float

The critical path of the part is A-C-F-J because these activities have
(T.F=0) and the lag (F.F) is zero for these activities

The free float for activity E is equal to minimum lag so it is (3) and for J is
zero.

For arrow diagram as we use damp activity from B to C because E

depend on C and B and D depend on just B, also we add damp activity
from E to G because G depend on D and E and we add damp activity
from F to E because H and I depend on E and J depend on just F.
References:
(1) History and Some Latest Developments of Precedence Diagramming Method '
b reported by Miklós Hajdu

(2) invensis global learning service (web site) ghghghghghghghghgghhgytutitutujtjtj

h https://www.invensislearning.com/articles/pmp/precedence-diagramming-method

(3) master of project academy (web site) jyuyyirjhohiuhiuhiuhkpkpokpkokiojoj

hhjhhttps://blog.masterofproject.com/precedence-diagramming-method/