Scheduling (Lecture 3)
Scheduling (Lecture 3)
Planning:
Process of choosing which method and order of work is
best among different methods available.
Scheduling:
Process of determining the interrelationship of associated
timings of operations.
NETWORK TECHNIQUES
• Activities shown by
Arrows. Relationship
between activities
shown by nodes / events.
• Length of arrows does
not obey any scale.
PREDECESSOR-SUCCESSOR RELATIONSHIP
• There is Start-to-finish
relationship between
activities, also called
Predecessor-Successor
Relationship.
EVENT NUMBERING
• An activity having zero duration and zero cost (and uses zero
resources) is called Dummy Activity.
• Dummy Activity is represented by Dashed Lined Arrow.
• A Dummy Activity may be
a---- Logic Dummy - To fulfill logic relationship
b---- Numbering Dummy – To avoid same i, j pair for
two activities’
c---- Start / Finish Dummy – To give single start or finish
activity in the network.
ARTIFICIAL ACTIVITY
• Any time units may be allotted to activity durations like days, hours, weeks,
months, shifts, etc.
FORWARD PASS
• In Forward Pass through the network, the top two cells, of
the six-celled box at each activity are calculated.
• The top two cells give the values of EST & EFT.
• Forward Pass is carried out from left to right in the network
• The EST of first activity/activities is set to zero or some
other number.
• The EFT of the first activity/activities will be 0 + duration of
first activity/activities.
• The EST & EFT of subsequent activities are calculated as
BACKWARD PASS
• In Backward Pass through the network, the middle two cells, of
the six-celled box at each activity are calculated.
• The middle two cells give the values of LST & LFT.
• Backward Pass is carried out from right to left in the network
• The LFT of last activity/activities is set to maximum EFT of the
last activity/activities or some other number i.e. date of handing
over.
• The LST of the last activity/activities will be LFT - duration of
last activity/activities.
• The LST & LFT of activities progressing backwards in times are
then calculated as
LFT = Minimum LST of following activities.
LST = LFT - duration
CPM CALCULATIONS
FLOAT CALCULATION
• In FLOAT CALCULATION through the network, the bottom two
cells, of the six-celled box at each activity are calculated.
• The bottom two cells give the values of Total Float (TF) & Free
Float (FF).