A MISNOMER IN THE TERMS PREDECESSOR AND SUCCESSOR IN SCHEDULING by Engr. Md Ariff Bin Md Thayoob, PMP e-mail: ariffthayoob.pmi@gmail.com 1.

0 INTRODUCTION

A
2.0

feature in using critical path method (CPM) based scheduling softwares is the determination of predecessor and successor activities. This article shall present why the terms predecessor and successor are misnomers in their literal meaning in the context of scheduling and the alternative terms described hereunder are more appropriate. The author assumes that the reader has basic knowledge in the use of scheduling softwares such as Primavera or Microsoft Project (MS Project). LOGIC LINKS

In scheduling, there are four possible types of logic links (dependency links, dependency types or logical relationships are synonymous terms) between two related activities, depending on whether their respective start or finish dates are related. They are summarised in table below. Logic Link 1. 2. 3. 4. Finish to Start (FS) Start to Finish (SF) Start to Start (SS) Finish to Finish (FF) Meaning Predecessors activity finish date determines the successors activity start date Predecessors activity start date determines successors activity finish date Predecessors activity start date determines successors activity start date Predecessors activity finish date determines successors activity finish date

By convention, the first term of the logic link i.e. the Finish or Start before the to refers to or represents the predecessor activity while the second term i.e. after the to refers to the successor activity. For example in SF relationship, the start or S represents the predecessor activity whilst the finish or F part relates to the successor activity. Further, by convention in Gantt Chart presentation form (the common presentation format in scheduling softwares), an arrow is drawn from the predecessor activity bar to the successor activity bar as illustrated in Figure 1. 3.0 CHOOSING THE PREDECESSOR AND SUCCESSOR TASKS

Now the question that begs the answer is, which, amongst a pair of activities shall be the predecessor and successor activity. Is the activity that starts earlier amongst the pair of linked activities the predecessor activity (and the linked activity that starts later the successor activity)? Everyday usage of the terms predecessor and successor may suggests so but in scheduling, this is not always true regardless of which tasks actually comes first in time. A more appropriate terminology, as shall be illustrated vide the examples that follows hereunder, are the terms driver and dependent task for the terms predecessor and successor

Page 1 of 3

respectively and as shown in table below as aid-memoir (the terms task and activity are synonymous). NORMAL TERM Predecessor activity Successor activity MORE APPROPRIATE TERM Driver activity Dependent activity

This is because the terms predecessor and successor are appropriate and were coined when the task dependency were envisioned to be of the FS type only i.e. the predecessor tasks comes before the successor tasks. However, as you shall see later in this article, the terms are not appropriate for more sophisticated or less common links, for e.g. SF relationships. For illustration purposes, a simple project which is to lay floor tiles on a concrete floor is adopted. The project shall consist of four activities as listed below in a typical sequence of such works. 1. Construct bare reinforced concrete floor (Activity A). 2. Procure floor tiles (Activity B). 3. Lay floor tiles on the casted floor (Activity C). Further, to simplify the illustration of the subject topic of this article, no leads or lags shall be considered in the logic links. Three scenarios related to the project shall be considered. Scenario 1: This may perhaps be the common task linkages scenario i.e. all are of the type FS relationship as illustrated in Figure 1 for Scenario 1 using the scheduling software Microsoft Project and presented in Gantt chart format. The project start date and activity durations in the illustration are arbitrarily set. Notice that in this scenario, the activities are listed in MS Project in start date order. The identification of predecessor and successor activities are straight forward as all the task dependency relationships are of the type FS. Scenario 2 & 3: Now consider Scenario 2 as shown in Figure 1 where the tiles shall be procured just in time for laying the tiles and no earlier. In other words if the construction of the bare concrete floor is delayed, the purchase of the tiles shall be delayed too as shown in Scenario 3 in Figure 1. This is known as Just in Time (JIT) Scheduling or As Late As Possible Scheduling. The advantage of JIT management practice in this instance is that it shall obviate unnecessary tie up of cash and associated storage costs. Thus in this scenario, the start date of Activity C drives or determines the finish date of Activity B (i.e. the finish date of Activity B is dependent on the start date of Activity C) so much so that if the start of Activity C is delayed, the finish of Activity B is delayed. From definition of task dependency relationships outlined above, the task dependency relationship between Activity B and C is FS. Further, guided by the alternative terms above i.e. driver and dependent activity, it may be easier to comprehend that the predecessor activity for the Activity B and C pair in this case is the latter activity (Activity C) while the successor activity is the former activity (Activity B) even though Activity C (the predecessor) comes after Activity B (the successor). In other words, the S part refers to Activity C whilst the F part refers to Activity B. The reader shall also note that as a result of the above JIT decision, Activity A and C are now directly linked (by FS relationship) as shown in Figure 1 for Scenario 2 & 3. Page 2 of 3

Further, the direction of the arrow joining the Gantt bars for Activity B & C still follows the normal convention, and, going by the actual definition of the terms predecessor and successor activity mentioned above, the resulting listing order of the activities in MS Project is not in start date chronological order. Table below summarises, compare and contrasts Scenario 1 & 2 (as reflected in Figure 1) Scenario 1 The finish date of Activity B determines or drives the start date of Activity C (FS relationship) Or The start date of Activity C is dependent on or determined by the finish date of Activity B (FS relationship) Predecessor / Driver Activity Successor / dependent activity The activity that starts earlier Activity B (i.e. associates with the F part of the FS relationship) Activity C (i.e. associates with the S part of the FS relationship) The predecessor activity i.e. Activity B. Scenario 2 The start date of Activity C determines or drives the finish date of Activity B (SF relationship) Or The finish date of Activity B is dependent on or determined by the start date of Activity C (SF relationship) Activity C (i.e. associates with the S part of the SF relationship) Activity B (i.e. associates with the F part of the SF relationship) The successor activity i.e. Activity C!!!

Dependency Relationship Between Activity B &C

An important corollary from the above arguments with regards to definition of predecessor and successor activity is that the list of activities in the Name field in MS Project (or Activity Name field in Primavera) does not necessarily follow chronological start date order but rather driver/dependent (or predecessor/successor) order. 4.0 CONCLUSION

This article highlights the discrepancy in the common or normal definition of the literal meaning of the terms predecessor and successor activity. Its use is limited or adequate for simple FS relationships when describing dependency links between activities. The more appropriate term suggested is driver and successor activity in lieu of the above two earlier terms respectively. This is illustrated vide three scenarios for a sample project that has been scheduled using MS Project as shown in Figure 1. A corollary derived from the above arguments is that the order of listing the activities in the appropriate field in scheduling softwares does not necessarily follow the starting date chronological order of the activities but rather from the driver/predecessor of the activity logic links considerations.

Page 3 of 3