Scheduling problems
Flow, matching and scheduling problems
General Maths Units 3 and 4 (2023+)

Sorry!

This video is for subscribers only.

To view this video please support me by purchasing a (very cheap!) years access.

Share:
##### Videos in this series
Please select a video from the same chapter
Gain access to chapters by taking out a (very reasonable and cheap!) one year plan
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.
LEGAL STUFF (VCAA)
VCE Maths exam question content used by permission, ©VCAA. The VCAA is not affiliated with, and does not endorse, this video resource. VCE® is a registered trademark of the VCAA. Past VCE exams and related content can be accessed at www.vcaa.vic.edu.au
There are no current errors with this video ... phew!
Lesson notes for this video are for subscribers only. Sorry! To gain access, please consider supporting me by taking out a (very reasonable and cheap!) one year plan by [clicking here]
Video tags

vce maths maths tutorials vce further maths scheduling problems networks Earliest Start Time Latest Start Time EST LST Float times Critical Path Minimum Completion Time further units 3 and 4 weighted networks how to forward scan how to backards scan forwards and backwards scanning