25

Network Scheduling
by PERT/CPM

"Every modem corporation has channels of communication along which lines,

from foot to crown, reports flow up and vetoes down"

25:1. INTRODUCTION
Network Scheduling is a technique used for planning and scheduling large projects in the fields of
construction, maintenance fabrication, purchasing, computer system installation, research and
development designs, etc. The technique is a method of minimizing trouble spots, such as, production
bottlenecks, delays and interruptions, by determining critical factors and coordinating various parts of
overall job.
There are two basic planning and control techniques that utilize a network to complete a
pre-determined project or schedule. These are: Program Evaluation and Review Technique (PERT);
and the Critical Path Method (CPM). Several variations of these have also been developed, one such
important variation being the Review Analysis of Multiple Projects (RAMP) which is useful for
guiding the 'activities' of several projects at one time.

25:2. NETWORK: BASIC COMPONENTS

A etwork is a graphic representation of a project's operations and is composed of activities and
events that must be completed to reach the end objective of a project, showing the planning sequence
or their accomplishments, their dependence and inter-relationships. The basic components of a
network are
Activity. An activity is a task, or item of work to be done, that consumes time, effort, money or
ouner resources. It lies between two events, called the 'preceding' and 'succeeding' ones. An activity
8
represented by an arrow with its head indicating the sequence in which the events are to occur.
Vent. An event represent the start (beginning) or completion (end) of some activity and as such
COnsumes no time. It has no time duration and does not consume any resources. An event is nothing
eoode and is generally represented on the network by a circle, rectangle, hexagon or some other
Scomelric
shape. An event is not complete until all the activities flowing into it are completed.
nties are identified by the numbers of their starting (tail or initial) event and ending (head, or
)event. An arrow (i, ) extended between two events; tlhe tail event i represents the start of
4Cvity and the head event i, represents the completion of the activity as shown below:

Activity
O- -O
Starting Event Completion Event
 764
OPERATIONS RESEARCH
of more than one activity is called ameroge event. \i
An event representing the joint completion it is called a burst event
initiation of more than one activity,
an event represents the joint
into the following three categories
The activities can be further classified
which must be completed before
one o r more other
er acti.
activities
I. Predecessor activity. An activity
start is known as predecessor activity.
or more of other actii
started immediately after one ities
2. Successor activity. An activity which
are completed is known as successor activity.
resource and time is na
not consume either any
3. Dummny activity. An activity which does own
is depicted by dotted line in the network diagram.
as dummy activity. A dummy activity
to represent the given precedence
Remark. A dummy activity in the network is added only more parallel activities in a
and is needed when (a) two or
relationships among activities of the project have some (but not all) of their
two or more activities
project have same head and tail events, or (b)
immediate predecessor activities in common.

Succeeding Event
Preceding Event
Successor Activity
Node Node
B
Predecessor Activity A Activity Node
D u m m y Activity

C
Succeeding Event

Fig. 25.1
dotted line in the network diagram as shown above.
A dummy activity is depicted by a

25:3. LOGICAL SEQUENCING

All the projects consist of certain activities that can begin only after certain others are completed.In
another
fact, the entire project may be considered as a series of activities which may begin only after
are called
activity or activities are completed. In a network schedule, these types of relationships A
constraints and are represented by inequalities. For example, A < B will indicate that the activity
must be completed before the start of the activity B.
For example, a project of laying a pipeline consists ofthe the activities: trenching, laying pipe
and welding of pipe.
In logical sequencing. following three types of errors are most common while drawing a network
diagram as
1. Looping. If an activity were represented as going back in time, a closed loop would occur
shown in Fig. 25.2

AO C

Fig. 25.2. Closed loop

A closed loop would
produce an endless cycle in computer programmes without a u dence
for detection or identification of the cycle. This situation can be avoided by checking the prece
relationship of the activities and by numbering them in a logical order. Thus one property o
correctly constructed network diagram is that it is "non-cyclic".
NETWORK
SCHEDULING BY PERTICPM 765
Dangling. No activity should end without being joined to the end event. If it is not so, a
m activity is introduced in order to maintain the continuity of the system. Such end-events other
the end of the project as a whole are called dangling events.

D C
Dangling
Dummy
O-
Fig. 25.3. Dangling
In the above network, activity D leads to dangling. A dummy activity is therefore introduced to
avoid this dangling.
3. Dependency relationships. When two chains of activities have a common event. w holly or
partly independent of each other, a dummy activity is used to establish proper logical relationships.
Given below are the two cases of dependency relationships
C is dependent upon both A and B.
(i) Activity
() Activity D is dependent upon A alone.

Dummy
B
D
(a) (b)
A (c)
Fig. 25.4
From the above three figures, we observe that Fig. 25.4(a) is clearly wrong since it shows D as
dependent upon not only A but also B which is not desired. Fig. 25.4(b) is also wrong since A has
been shown twice and thus contravenes the fundamental axioms of network that there must be one
arrow for each activity. The way out to this dilema is the representation by means of a dummy
Fig. 25.4(c) shows that C is dependent upon both A and B (via dummy) whereas D is
activity.
dependent upon just A.

25:4. RULES OF NETWORK CONSTRUCTION

F the construction of a network, generally, the following rules are followed
ror

. Each activity is represented by one and only one arrow.

2. Each activity must be identified by its starting and end node which implies that
two activities should not be identified by the same completion events, and
7)activities must be represented either by their symbols or by the corresponding ordered pair of
Starting-completion events.
3. are numbered to identify an activity uniquely. Tail (starting point) should be lower
Nodes
a n the
head node (end point) of an actuvity.
node

activity; however than

vit maywcen any pair of nodes, there should be one and only one more one

ivity emanate from and terminate to a node.

766
OPERATIONS RESEARrARCH
S. Arrows should be kept straight and not curved or bent.
6. The logical sequence (or inter-relationship) between activities must follow the fo
)An event cannot occur until all the incoming activities into it have been completed rules
(ii) An activity cannot start unless all the preceding activities on which it depends, hae
completed. ave been
(ii) Dummy activities should only be introduced if absolutely necessary.

Numbering the Events

After the network is drawn in a logical sequence, assigned a number. The numha:
every event 1s

sequence must be such so as to reflect the flow of the network. In event numbering, the followin
rules should be observed wing
(a) Event numbers should be unique.
(6) Event numbering should be carried out on a sequential basis from left to right.
(c) The initial event which has all outgoing arrows with no incoming arrow is numbered 0 or 1.
(d) The head of an arrow should always bear a number higher than the one assigned at the tail of
the arrow.
(e) Gaps should be left in the sequence of event numbering to accommodate subsequent inclusion
of activities, if necessary.
Remark. The above procedure of assigning numbers to various events of a network is known as
Fulkerson's Rule.
Illustration. A television is manufactured in six steps, labelled A through F. Because of its size
and complexity, the television is produced one at a time. The production control manager thinks tha
nerwork scheduling techniques might be useful in planning future production. He recorded the
following information:
A is the first step and precedes B and C,
Cprecedes D and E,
F follows E and D is successor of F,
B follows D and precedes E.
(a) Draw an activity-on-node diagram for the production manager.
(b) On checking with the records, the production manager corrects his last note to read, "DB
predecessor of F". Draw a new diagram for the revised network incorporating this new change.
(c) After pondering over the network and rechecking8 from the records, it was found that Bwa
really a predecessor ofD rather than vice versa. Draw a revised network incorporating this nev
change.
(d) Draw an arrow-diagram representation of the network in part (c). How many ummy
activities did you use in your network?
Solution. (a) (i) A is the first step which precedes B and C.
(i) C precedes D and E.

Fig. 25.5 Fig. 25.6

 TWORK SCHEDULING BY PERT/CPM

767
(ii) F follows E and D and is the successor of F:

Fig. 25.7
i) Now, since B follows D and precedes E, the
below:
complete network drawing is shown in Fig. 25.8

Fig. 25.8
Evidently. this network contains a cycle as shown in Fig. 25.9 below

- -
Fig. 25.9
(b) Revised network when D is a predecessor of F is as follows

Fig. 25.10
(c) Revised network when D is a predecessor of F and B is a predecessor of D is given below

Fig. 25.11
(a) The arrow diagram of the network presented in part («) can be represented as

3 D
0-A
C
-Dummy Activity

Fig. 25.12
The vents of the diagram are numbered such that their ascending order indicates the direction of
progress in the
project.
 768 OPERATIONS RESEARCH
25:5. CONCURRENT ACTIVITIES

Activities discussed so far are discrete in nature. But in practice, they may not always be disera
they may be done in part allowing the subsequent activities to commence before the precedinge te, i.e.,
is fully completed. Activities of this kind are to be frequently encountered in batch productian
example, a batch of 50 spindles is to be processed on two machines, obviously it is not neces for
essary
process all the items of the batch on the first machine and then transfer these to the next machi
few items processed on the first machine may be transferred to the second machine before comnlet
of the entire batch on the first machine. Such simultaneous or concurrent activities are
to h
encountered in sewage work; e.g., trenching, laying pipe, welding pipe, and back filling; all going n
simultaneously with suitable lags on construction work.
Illustration. A batch of four
axles is to be processed on the following three machines in
this
sequence : Lathe (L), Milling (M), Grinding (G).
Instead of first working these four axles on Lathe, then on Milling and finally on
Grinding in
sequence, it is desired to process the first axle on the Lathe and as and when it is processed, it is
taken up on Milling and the second axle on the Lathe, and so on. In other words, each
of the three
activities L M and G have been quartered for the sake of concurrent operations.
You are required to draw the network.
Solution. The dependency relationships are sorted out hereunder
Quartered activity Preceded by Quartered activity Preceded by
Li None M3 Lg, M2
L Li M4 L4. M3
Ls L G M
La La G2 M2, G
M L G3 M3. G2
M2 L2. M G4 Ma. G3
Using the above relationships, the resulting network is shown in Fig. 25.13

2
La
M

G Ma
- G2 G 13 GA
Fig. 25.13
Note. The concurrent activities so drawn are known as ladders in the network jargon.
A M
25:6. CRITICAL PATH ANALYSIS
hepurpose of analysisis to find the critical path, i.e., the sequence of activities with the longest
uration, and to find the float associated with each non-critical activity. This helps in checking actual
rOgress against the scheduled duration of the project. To achieve this objective, we carry out the
pecial computations that produce the following information
a)Total duration needed for the completion of the project.
0) Categorization of the activities of the project as being critical or non-critical.
 772
OPERATIONS RESEARCH
is said to be critical, if the delay
in its start will fu
Anactivity in a network diagram scheduling slack, so tha dela
non-critical activity allows
some
the project completion time. A
time of the activity may be
advanced or delayed within
limits without affecting the comnla
ompletion standate
of the entire project.
the following factors should be known
To accomplish the above-mentioned objectives, pare
project scheduling :
activity, i.e., the time by
which an activity must begin and tha
(i) Time schedule for each time
before which it is completed.
well earlier finish and latest finish of each activity
(ii) Earlier and latest start time as
as

time associated with each activity.

(ii) Float for each activity, i.e., the spare
network.
(iv) Critical activities and critical path for the
For the purpose of calculating various times of events and activities, the following terms shall hbe
used in critical path calculations
Earliest time of event i
E = occurrence

Latest time of event j

L= occurrence

Duration of activity (i, j)

The critical path calculations are done in the following two ways

(a) (b) Backward Pass Calculations.

Forward Pass Calculations, and
Forward Pass Caleulations. We start from the initial node (event 1) with starting time of the
order of node number and
project as zero. Proceed through the network visiting nodes in an increasing
end at the final node of the network. At each node, we calculate earliest start and finish times for each
be summarized as
activity by considering F; as the earliest occurrence of node i. The method may
follows
Step 1. Set E = 0; i = 1 (initial node)

Step activity that begins at node i as

2. Set the earliest start time for each

ES E: for all activities (i. ) that start at node i.

=

the
Step 3. Compute the earliest finish time of each activity that begins at nodei by adding
earliest start time of the activity to the duration of the activity. Thus
EF ES +y =
E, +

Step 4. Move on to next node, say node j (j> ) and compute the earliest
E max EFG) = max {E; + y l .
occurrence for
node j, using
for all immediate predecessor activities.
Step 5. If j = n (final node), then the earliest finish time for the project is given by
E max {EF} = max {E,-1 + 4ij.

Backward Pass Calculations. We start from the final (last) node (event) n of the netwo
proceed through the network visiting nodes in the decreasing order of node numbers and ena at
initial node 1. At each node, we calculate the least finish and start times for each activny o
considering L, as the latest occurrence of node j. The method may be summarized below
Step 1. L, = E,: for j =n.

Step 2. Set the latest finish time of each activity that ends at node j as

LFiy Lj the
Step3. Compute the latest occurrence times of all activities ending at j by subtractung
duration of each activity from the latest finish time of the activity. Thus
 HEDULING
NETWORK SCHE BY PERT/CPM
773
Proceed backward to the node in the
sequence, that decrease j by
occurrence
time of node i (i< ) using
1. Also compute the
latest

L min {LS}
=
=

min {L ijB. -

immediate successor activities.

for all
Step 5. If j = 1 (initial node), then
L =
min {LS;} =min {L2 -

tijB
ased on the above calculations, an
activity (i, j) will be critical if it satisfies the
conditions
following
E =L and E = ly
()
(ii) E-E = L - Li =ij
An activity that does not satisfy the above conditions is termed as non-critical.
Critical Path. The critical activities of a network that constitute an uninterrupted path which
spans the entire network from start to finish is known as critical path.

Float (or Slack) of an Activity and Event

The float of an activity is the amount of time by which it is possible to delay its completion time
without affecting the total project completion time.
1. Event loat. The float (also called 'slack') of an event is the difference between its latest time
(L)and its earliest time (E). Thatis
Event float = LË - E;

It is a measure of how much later than expected a particular event could occur without delaying
the completion of the entire project.
2. Activity float. As mentioned earlier, it is the float (or slack) in the activity time estimates.
There are mainly three types of activity floats as discussed below
) Total float. The total float of an activity represents the amount of time by which an activity
can be delayed without delay in the project completion date. In other words, it refers to the amount
of the free time associated with an activity which can be used before, during or after the performance
of this activity. Total float is the positive difference between the earliest finish time and the latest
finish time, or the positive difference between the earliest start time and the latest start time of an
activity depending upon which way it is defined.
Thus, for each activity (i. j), the total float values are computed as follows
tal float (TF) = L, - (E; + i ) = LFy - EF

(j - i) - E = LSj - ES

(i) Free float. Free float is that portion of the total float wihin which an activity can be
manipulated without affecting the float of subsequent activities. It is computed for an activity by
Subtracting the head event slack from its total float. The free float indicates the value by which an
activity in question can be delayed without causing any delay in its immediate successor activities.
Free float values for each activity (i. ) are computed as follows
Free float (FF) = (E, - E) - 4j

= E - (E ti) = min. {ESj} - EF i <).

for
( dependent float. It is that portion of the total float within which an activity
can be delayed
floats of the preceding activities. It is computed by subtracting the tail event
slaccWithout
slack from the affecting
freee float of the activity. If the result is negative, it is taken as zero.
774 OPERATIONS RESEARCA
Independent float values for each activity (i, j}) are computed as follows
Independent float (F) (E - L)
= -

or
IF =
FFj (slack of event i)
Illustration. Consider the following activity of certain network

E 20 19
E2 = 39

L380- 2 57

Here
Total Float =
L2 -

(E +12) = 57 -

(20+ 19) = 18
Free Float =
E2 (E -

+ 12) = 39 (20 + 19) = 0

IndependentFloat = E - (Ly + l12) 39 (38 + 19) = - 18

(iv) Interfering float. Utilization of the float of an activity can affect the float of subsequent
activities in the network. Thus, interfering float can be defined as that
part of the total float which
causes a reduction in the float of the successor activities. In other
words, it can be defined as the
difference between the latest finish time of the activity under consideration and the earliest start time
of the following activity, orzero, whichever is larger. Thus, interfering float refers to that portion of
the activity float which cannot be consumed without
affecting adversely the float of the subsequent
activity or activities.
Remarks 1. The basic difference between slack and float times is that slack is used for
events only.
whereas float is applied for activities.
2. Latest occurrent time of an event is always
greater than or equal to its earliest occurrence time, ie.,
Li2 E. This implies that
Independent float Free float s Total float.
3. An activity is critical if its total float is zero, otherwise it is
non-critical.
4. Once the float of an activity is disturbed, float of all other
activities of the project is changed and
should be re-calculated.
5. The calculation of various floats can
help the decision-maker in identifying the underutilized
resources, flexibility in the total schedule and
possibilities of redeployment of resources.
NETWORK SCHEDULING BY PERTICPM
781

25:7, PROBABILITY CONSIDERATIONS IN PERT

The network methods discussed so far
may be termed as deterministic, since estimated
assumed to be the expected values. But no activity times
eis recognition is given to the fact that
expected activity
time the mean of a distribution of possible values which
could occur.
Under the conditions of
uncertainty, the estimated time for each
activity for PERT network is
onresented by a probability
distribution. This
probability distribution of activity time is based upon
three different time estimates made for each activity. These are as follows
= the optimistic time, is the shortest possible time to complete the activity if all goes well
i= the pessimistic time, is the longest time that an activity could take if every thing goes wrong.
= t h e most likely time, is the estimate of the normal time an activity would take. If only one
time were available, this would be it. Otherwise it is the mode
of the probability distribution.
The range specified by the optimistic time (t) and pessimistic time (t,) estimates supposedly must
enclose every possible estimate of the duration of the activity. The most likely time (,) estimate may
not coincide with the midpoint (, + 1,)/2 and may occur to its left or to its
right as shown in Fig.
25.22

Fig. 25.22
Keeping in view of the above-mentioned properties, it may be justified to assume that the duration
of each activity may follow a Beta (B) distribution with its unimodal point occurring at1 ,
points , and p
In Beta distribution the mid-point (, + t,)/2 is assumed to weigh half as much as the most likely
point (). Thus, the expected value of the activity duration can be approximated as the arithmetic
mean of (, + )/2 and 2 Thus, we have
, [2+ +)/2] =% + 4tm t ) / 6

Since almost (99%) all values of random variables fall within t3 standard deviation from the
mean or fall within the range approximately 6 standard deviation in length, therefore the interval
, ) is assumed to enclose about 6 standard deviation of a symmetric distribution. Thus, if a
denotes the standard deviation, then
6o p - or = (, / 6 .
The variance, therefore, is: o = {l, - )/6F.

Emark. In PERT analysis, a Beta distribution is assumed because it is unimodal, has non-negative end

points, and is approximately symmetric.

Probability of Meeting the Schedule Time
With of completing a contract on schedule. The
sched. , il is possible to determine the probability time. Initially they 'may be
the dates are expressed as a number of time units from the present
is started we shall know how far it has
DrO Umes, T, for each event, but after a project
be the latest time if the project is to be
Comnla
at
any given date, and the scheduled time will
ompleted on its
original schedule.
782 OPERATIONS RESEARCH
The probability
distribution of times for completing an event can be approximated by the normal
distribution due to the central limit theorem. Thus the probability of completing the
project by
scheduled time (T,) is given by

Prob
The standard normal variate (SNV) is given by,

where, T, =
expected completion time of the project and
o =
number of standard deviations the scheduled time lies from the
expected (mean) time,
i.e., the standard deviation of the scheduled time.
Using the cumulative normal distribution tables
(given at the end of book), the corresponding
value of the standard normal variate is read off. This will
the project on scheduled time.
give the required probability of completing
25:8. DISTINCTION BETWEEN PERT AND CPM
Both PERT and CPM are managerial techniques for planning and control of large complex projects.
Both are techniques to network analysis wherein a network is prepared to analyse inter-relationships
between different activities of a project. However, there are several differences between the two
techniques
 SCHEDULING BY PERTICPM
NETWORK 791
, CPM is used for repetitive jobs like planning the construction of a house. On the other hand,
cT is used for non-repetitive jobs
planning like the
assembly of the space platform.
PERT is a probabilistic model with uncertainty in activity duration. Multiple time estimates are
t o Calculate probability
the of
completing the project within scheduled time. On the contrary,
DM is a deterministic model with well-known activity (single) times based upon past experience. It,
re fore, does not deal with uncertainty in project duration.
th
3PERT is said to be event-oriented as the results of analysis are expressed in terms of events or
distinct points in time indicative of progress. CPM is, on the other hand, activity-oriented as the
lt of calculations
considered in terms of activities or
are
operations of the project.
4. PERT is applied mainly for planning and scheduling research programmes. On the other hand,
CPM is employed in construction and business problems.

5. PERT incorporates statistical analysis and thereby enables the determination of

probabilities
concerning the time by which each activity and the entire project would be completed. On the other
hand, CPM does not incorporate statistical analysis in determining time estimates because time is
precise and known.
6. PERT serves a useful control device as it assists the
management in controlling a project
calling attention through constant review to such delays in activities which might lead to a delay by
in
the project completion date. But, it is difficult to use CPM as a controlling device for the
simple
reason that one must repeat the entire evaluation of the project each time the changes are incorporated
into the network.

25:9. APPLICATIONS OF NETWORK TECHNIQUEs

The list con taining PERT and CPM applications is very large and the applications are expanding to
many new areas. Following are a few typical areas in which these techniques are widely accepted:
. Administration. Networks have been used by the administration for
streamlining paperwork
system, for making major administrative system revisions, for long range planning and
developing staffing plans, etc.
2. Construction Industry. It is one of the largest areas in which the network techniques of
project management have found application. These techniques are used in the construction of
buildings, roads, highways, bridges, dams and iigation projects.
3. Manufacturing. The design, development and testing of new machines, installing machines
and plant layouts are a few examples of how it can be
applied to the manufacturing function
a firm. It has been used in

4.
of manufacturing of ships, aeroplanes, etc.
Maintenance Planning. R&D has been the most extensive area where PERT has been used
for development of new products, processes and systems. It has been used in missile
development, space programmes, strategic and tactical military operations, ete.
.
InventoryPlanning. Installation of production and inventory control, acquisition of spare
parts, etc. have been greatly helped by network techniques.
Marketing. Networks have been used for advertising programmes, for development and
aunching of new products and for planning their distribution.
Other Areas of Application are preparation of budget and auditing. installation of computers
and large machinery, organisation of big conferences and public works, advertising and sales
promotion strategies, etc.
45:10.
ADVANTAGES OF NETWORK TECHNIQUES
hcse are most valuable and powerful for planning, seheduling and control of operations in
large and complex projects.
792 OPERATIONS RESEARCH
2. The techniques are useful tools to evaluate the level of performance by comparing
ring actual
performance against the planned targets.
3. These techniques help to determine the interdependence of various activities for nro
for propeT
integration and coordination of various operations.
4. These techniques help to evaluate the time-cost trade off and determine the aptimum schedhule
5. These techniques are simple and can be easily oriented towards computers.
6. The networks clearly designate the responsibilities of different supervisors. Supervisor of
activity knows his time schedule precisely and also thé supervisors of other activities wi
an
whom he has to coordinate.
25:11. LIMITATIONS AND DIFFICULTIES IN USING NETWORK
. Construction of networks for complex projects is complicated and time consumin, to trial
and error approach.
2. Difficulty in securing the realistic time estimates. In the case of new and non-repetitive type
projects, the time estimates are often mere ficticious.
3. Estimation of reliable and accurate duration of various activities is a difficult exercise.
4. The natural tendency to oppose changes results in the difficulty of persuading the
management to accept these techniques.
5. The planning and implementation of networks require personnel trained in the network
methodology. Managements are reluctant to spare the existing staff to learn these techniques
or to recruit trained personnel.
6. Developing a clear logical network is also troublesome. This depends upon the data input a
thus the plan can be no better than the personnel who provides the data.
7. Determination of the level of network detail is another troublesome area. The level of detail
varies from planner to planner and depends upon the judgement and experience.

MULTIPLE CHOICE QUESTIONS

1. In the context of network, which of the following is not correct?

(a) A network is a graphic representation of activities and nodes.
(b) A project network cannot have multiple initial and final nodes.
(c) An arrow diagram is essentially a closed network.
(d) An arow representing an activity may not have a length and shape.
2. The objective of network analysis is to
(a) minimize total project cost.
(b) minimize total project duration.
(c) minimize production delays, interruption and conflicts.
(d) all of the above.
3. Network problems have advantage in terms of project
(a) scheduling (b) planning
(c) controlling (d) all of the above.
4. In critical path analysis, the word CPM mean
(a) Critical Path Method. (b) Crash Project Management.
(c) Critical Project Management. (d) Critical Path Management.
5. In eritical path analysis, CPM is
(a) event oriented (b) probabilistic in nature
(c) deterministic in nature (d) dynamic in nature
6. The slack for an activity in network, is equal to
(a) LS ES (b) LF - LS
(c) EF- ES (d) EF- LS.
 SCHEDULING BY PERTICPM
AIETWORK
793
, The term commonly used for activity slack time is
(a) free float
(b) independent float
(c)total float (d)all of the above.
in the network
8. An activity
represents atask which has a definite
beginning and a definite end.
A Cannot start unless all its immediate
predecessors are
have float zero if it is critical, otherwise total completed.
float as positive in
all of the above.
case of non- critical activity.
(d)
9 If an activity has zero slack, it implies that
(a) it is a dummy activity.
(b) it lies on the critical path.
(c) there are more than one critical paths.
(d) the project is progressing well.
10 The activity which can be delayed without affecting the execution of the immediate
determined by succeeding activity is

(a) total float

(6) free float
(c) independent float
(d) interfering float.
11. A dummy activity is used in network diagram., when
(a) two parallel activities have the same tail and head events.
(b) the chain of activities may have a common event, yet be independent by themselves.
(c) both (a) and (6).
(d) none of the above.
12. Which of the following is not correct?
(a) Total float is the aggregate of the free, interfering and independent floats.
(6) For each critical activity-total, free and independent floats are equal to zero.
(c) An activity with some free float cannot be a critical activity.
(d) Interfering float is the excess of the total float over the free float.
13. Which of the following is not correct?
() The critical path of a project network represents the minimum time needed to complete the project.
(b) Critical path is the longest path in a project network.
(c) A delay in the completion of critical activities need not cause a delay in the completion of the whole
project.
(d) The sum of the variances of the critical activity times gives the variance of the overall project
completion time.
14. In PERT network, each activity time assume a B-distribution, because
(a) it need not be symmetrical about modal value.
(b) it is a uni-modal distribution that provides information regarding the uncertainty of time estimates of
activities.
(c)it has got finite non-negative error.
(d) all of the above.
15. Which of the following is correct?
(a) Completion time of each activity in a PERT network is assumed to follow B-distribution.
(6) The completion time of an activity in PERT calculations is assumed to follow normal distribution.
(c) The pessimistic time for every activity in a PERT project must always be greater than its optimistic time.
(d) In case of more than one critical path for a PERT network, the one with the least variance is selected
for making probability calculations.
ANSWERS

3. (d) 4. (a) 5. (c)

1. (d) 2. (b)
8. (d) 9. (b) 10. (b)
6. (a) 7. (d
11. (c) 13. (c) 14. (b) 15. (a)
12. (a)