Lec-36 Calculation of Earliest And Latest Time,Total And Free Float, Critical path | Hindi | OR 

#calculationofearliesttime #float #criticalpath #totalfloat #freefloat #independentfloat #latesttime
Connect with me
Instagram : / i._am._arfin
LinkedIn : / arfin-parween
Twitter : / startpracticing
Email : wbstartpracticing@gmail.com
Hello ...... Today we going to learn after drawing network diagram, how we calculate earliest starting time, earliest finishing time, latest starting time, latest finishing time, earliest time for head event, latest time for tail event, total float, free float, independent float, critical path, critical activity
In project management our topic is ......
Introduction of project management
project
Phases of project
basic terms : activities, events
common Error: looping, dangling, redundancy
Rule to draw network diagram
numbering the events : Fulkerson's rule
construction of network diagram
Time analysis: Forward pass computation
Backward pass computation
calculation of float and slack
Critical Activity
critical path
CPM (critical path method)
PERT ( program evaluation and review techniques)
The critical path method (CPM), or critical path analysis (CPA), is an algorithm for scheduling a set of project activities. ... A critical path is determined by identifying the longest stretch of dependent activities and measuring the time required to complete them from start to finish.
THANK YOU FOR WATCHING
___________________________________________
Please like share comments and subscribe
___________________________________________
To watch more tutorial, press the below link
How to draw network diagram and basics of network scheduling
• Lec-35 How To Draw Net...
Travelling salesman problem
• Lec-33 Travelling Sale...
Maximization in assignment problem
• Lec-32 Maximization As...
Unbalanced Assignment Problem
• Lec-31 Unbalanced Assi...
Assignment problem for multiple solution
• Lec-30 Assignment Prob...
Assignment problem part 1
• Lec-29 Assignment Prob...
degeneracy in Transportation Problem
• Lec-27 Degeneracy in T...
modi method transportation problem using north west corner rule 2
• Lec-26 Modi Method Tra...
Modi Method Transportation Problem using Vam 1
• Lec-25 Modi Method Tra...
unbalanced transportation problem vam method,
• Lec-24 Unbalanced Tran...
vogel's approximation method transportation problem
• Lec-23 Vogel's Approxi...
least cost method transpotation problem, unbalanced table
• Lec-22 Least Cost Meth...
least cost method transportation problem, balanced table
• Lec-21 Least Cost Meth...
unbalanced transportation problem using north west corner method
• Lec-20 Unbalanced Tran...
north-west corner method transportation problem, balanced table
• Lec-19 North West Corn...
transportation problem in hindi, conversion of unbalanced table into balanced table
• Lec-18 Transportation ...
for watch more tutorials pls visit the playlist in the channel
channel: / @startpracticing
playlist of operation research
• Operation Research In ...
Playlist of Transportation Problem
• Transportation problem...
playlist of probability for engineering mathematics
• Probability (engineeri...
Playlist of Data Structure and Algorithm
• Data Structure and Alg...
My RU-vid Shorts of Operation Research
• Operation Research Shorts
CPM in operation Research, network scheduling in operation Research, network scheduling by cpm, float in cpm, total float in cpm, free float, independent float, network scheduling in operation Research In Hindi, critical path in project management, critical path , critical activity, earliest time calculation in operation Research, latest time calculation in operation Research, arfin, arfin parween, start practicing