activity on nodes
DESCRIPTION
Project Management, Activity on Nodes PERTTRANSCRIPT
Activity on Nodes
ACTIVITY ON NODES-Prof. Pradeep PaiGroup 6
DRAWING THE PROJECT NETWORKActivity On Arc/Arrow
Activity on Arrow networks show each activity as an arrow, and the nodes represent the starting and ending pointsActivity On Node
Activity on Node networks show each activity as a node and arcs show the immediate predecessor activities
2
ESEFLSLFActDurTotal FloatFree Float
ESEFLSLFActDurTotal FloatFree Float
Free FloatTotal FloatDurationActivityLate FinishLate StartEarly FinishEarly Start
Early StartEarly FinishLate StartLate FinishActivityDurationTotal FloatFree FloatEvery activity is shown in rectangleNode Design
RULES OF ACTIVITY ON NODENo need for a dummyMultiple start and multiple end is possibleSufficient space to write between the arrowsArrows cannot come backCannot start from top or bottomRelationship is from left to right
ESEFLSLFActDurTotal FloatFree Float
ESEFLSLFActDurTotal FloatFree Float
ESEFLSLFActDurTotal FloatFree Float
ESEFLSLFActDurTotal FloatFree Float
ESEFLSLFActDurTotal FloatFree Float
ESEFLSLFActDurTotal FloatFree Float
ESEFLSLFActDurTotal FloatFree Float
ESEFLSLFActDurTotal FloatFree Float
PROBLEM 1ActDurPredESEFLSLFTotal FloatFree FloatA3-030300B5A3871240C7A31031000D4B812121644E6C1016101600F4C1014172177G5D,E1621162100H8G,F2129212900I2G2123272966J4H,I2933293300
29332933J40(0)
21232729I26(6)
21292129H80(0)
10141721F47(7)
10161016E60(0)
310310C70(0)
16211621G50(0)
8121216D44(4)
38712B54(0)
0303A30(0)SOLUTION
FORWARD PASS
05A5
37B4FF+2
05A5
26B4SS+2
05A5
48B4FS-1
05A5
610B4FS+1To determine early start (ES) and early finish (EF) times for each task:Work from left to rightAdding times in each path (EF= ES+ Activity Duration)
Rule: when several tasks converge, the ES for the next task is the largest of preceding EF times
BACKWARD PASS
05A5
48B4-(FF+2)
16A5
37B4-(SS+2)
13A2
48B4-(FS-1)
05A5
610B4-(FS+1)
To determine the last finish (LF) and last start (LS) times:Start the end node Compute the bottom pairs of numbers Subtract duration from connecting nodes earliest start timeRule : Take the lowest value when several tasks converge
PROBLEM 2ACTIVITYDescriptionCOMPLETION TIME ARedesign product5BRedesign packaging3COrder and receive components for redesigned product 4DOrder and receive material for redesigned packaging 7EAssemble products5FMake up packaging 3GPackage redesigned product 2HTest market redesigned product6IRevise redesigned product3JRevise redesigned packaging 4KPresent results to the Board2
10
ActivityDurationPredecessorRelationESEFLSLFTotal FloatFree FloatA5--050500B3AFS-236111488C4AFS+38128120-4D7CSS8158150-1E5CFF+41116121710F3B,DFS,FS-11417141700G2EFS1618171910H6F,GFS,FS-2172317230-2I3GFS1821212433J4HSS+4212521250-1K2I,JFS,FF+12426242600
0505A50(0)
17231723H60(6)
361114B38(8)
21252125J40(0)
14171417F30(0)
812812C40(0)
815815D70(0)
18212124I33(3)
24262426K20(0)
11161217E51(0)
16181719G21(0)FSFSFS - 1FS - 2FF + 1FS-2FS + 3SSFF + 4FSFSSS+4FSSOLUTION
Whenever free float is negative, make it zeroNegative comes because of parallel workingRelationship Calculation requires AON methodCannot be solved by AOA method
13
Thank YouHarsh Kumar Jhunjhunwala B017Karan Malviya B021Amit Jain B023Deeksha Darak B027Piyush Jajodia B036Ekta Agarwal B043