4.4.1 Apply network 1.

Define Network Network Tests, Question

analysis to 2. Draw network Analysis is exercises
paper and
schedule a diagrams. properly ,
project 3. Perform applied in assignme marking
network project nts and
schemes
calculations. scheduling and examinat
4. Calculate minimizing ions. Checklists
EST,EFT, LST, project costs
Reports
project
duration, Total
float, free float
and
independent
float.
5. Apply crashing
procedure to
shorten the
duration of
project while
minimizing
additional cost.
NETWORK

Is the technique used for planning and scheduling of large projects in the fields of
construction, maintenance, fabrication, purchasing, computer system installation,
research and development planning etc. There is multitude of operation research situation
that can be modelled and solved as network. Some recent surveys report that as much
as 70% of the real-world mathematical programming problems can be represented by
network related models.

NETWORK ANALYSIS

It is referred to a family or combination of related techniques that help management to

plan and control projects.

Is organized application of systematic reasoning for planning , scheduling , monitoring

and controlling practical situations where many separate tasks ( which make up a whole
project) can happen simultaneously or consecutively.

These techniques show interrelationships of various chores/ task which make up the
overall projects and clearly identify the critical paths of the project.

They are most useful in complex large organizations or big projects with restrictions or
constraints.

Network analysis is known by many names

1. PERT (Programme Evaluation and Review Technique)

2. CPM (Critical Path Method), PEP (Programme Evaluation Procedure)
3. LCES (Least Cost Estimating and Scheduling)
4. SCANS (Scheduling and Control by Automated Network System).

Objectives of network analysis

1. Planning, scheduling and control

2. Simplified framework of the interconnecting of the various activities consisting a
project or a programme. done to show the technology interdependence of various
of activities
3. Minimization of the total cost, total time and other resources
4. Maximization of efficiency/effectiveness returns etc

Management and application of network analysis

(i) Building and construction

Construction of buildings, bridges, factories, highways and stadium
 (ii) Building and auditing procedures
(iii) Assembly line scheduling
(iv) Missile development
(v) Installation of the complex equipment example computers, large machines
(vi) Planning
(vii) Advertising programme for development and launching of new products
(viii) Finding the best traffic flow patterns
(ix) Research and development

Main concepts of network analysis

1. Activity
A task or job which takes time and resources
Occupation of starting time (ST) and ending time (ET) + duration and crushing
cost
Denoted by arrow ( )
2. Preceding activity
An activity that must be completed immediately, prior to the start of another
activity.
Activity that occurs earlier than the others
3. Succeeding activity
Activity that succeeds other activities
4. Critical path
Path which contains sequence of activity. It consumes more time and resources
5. Concurrent activities
Activities that can be accomplished together
6. Critical activity
An activity whose delay causes delay in the entire project

7. Dummy activity
An activity that does not consume time or resources. it is used to show logical
dependencies between activities
8. Event
Time description,
A point in time that indicates the start or finish of an activity
It is denoted by a circle or node

Start event Finish event

There are three types of events

(i) Merge event

Formed when more than one activity come and join in an event

(ii) Burst event

Formed when more than one activity leaves an event

(iii) Merge and Burst event

A combination of the two when more than one activity come and join together
and more than one activity leaves an event

9. Network
A combination of activities and event in a logical sequence according to the rules
of drawing network
10. Float
Spare time taken by all calculated that dot exit in Critical path method (CPM)
Float of an activity represents the excess of available time over its duration
11. Total Float (Ft )
The amount of time by which the completion of an activity could be delay beyond
the earliest expected completion time without affecting the overall project duration
Ie TF = Latest − Earliest start for actvity (i − j) or (TF)ij = (LS)jj − (ES)ij
12. Free float (Ff )
The time by which the completion can be delayed beyond the earliest finish time
without affecting the earliest start of subsequent (succeeding) activity
13. Slack time
spare time taken by event which do not exist within CPM
RULES OF DRAWING NETWORK DIAGRAM
(I) Each activity must be represented by one and only one arrow in the network

(II) Network are drawn from left to Right, having one entry point and one exit
point and must be represented by arrows.

(III) Network diagram must be numbered from the start to exit

1 2 5 6

(IV) Arrows should be straight not curved or bent and should not cross each
other unless it is inevitable
(V) The length of arrows is of no significance
(VI) Angles between the arrows should large as possible
(VII) Each activity must have a unique tail and head

Tail Event Head event

 (VIII) Network must be indicated by letters times by numbers

3
B D

A F
1 2 5 6

C E
4

1 2 5 6