I may be misusing "scheduling" in this context, but here it goes:
I'm trying to build a simple calendar scheduling algorithm/routine, the purpose of which is to determine if a particular Time-Span is long enough to execute a number of scheduled events, each of which having a pre-determined duration.
- Task A, Duration: 1 day, Pre-Req: None
- Task B, Duration: 1.5 Days, Pre-Req: Task A
- Task C, Duration 0.5 Days, Pre-Req: Task B
Example use case is a set of "Lesson Plans". Each plan takes X units of time to execute, and the previous lesson plan is a pre-requisite to the next lesson plan (or perhaps each plan has a "Next Plan" pointer).
The instructor may insert or remove lesson plans at any point in the schedule. Lesson plans might take longer than previously scheduled, at which point all subsequent schedule items will need to be recalculated. If any scheduled events (Lesson Plans) fall outside of the prescribed Time Span (i.e. run outside of the teaching Semester, in this case), I need to flag those items.
I've been reading up on various scheduling algorithms, and most seem too complicated for this scenario.
Do any known algorithms exist that handle this type of simple calendar scheduling, or am I overthinking this?