Description
This is the second from last video looking at Networks for the Further Maths course. Scheduling problems is about as real world as it gets! This is practical Mathematics. I take a look at how we can add weights to activity networks to let us schedule tasks e.g. building a house, making a cup of tea etc. I look at forward and backwards scanning. I explain Earliest Start Times (EST) and Latest Start Times (LST) and how they relate to Float Times. We look at how we use the information to find the Minimum completion time and where the Critical Path is. All with lots of examples explained in my own unique way.