Basic Scheduler

Functionality

The basic scheduler is designed to output a valid schedule that is good, but cannot be said to be optimal in as fast a time as possible. This is represented by the BasicScheduler class, which generates this type of schedule.

Implementation

The algorithm implemented here is simple. Take a look at all nodes currently available to you, and check to see which one allows for the cheapest scheduling. After that node is scheduled, look at all children of that node. If all the child node parents are scheduled, add that node to the current set of available nodes. The algorithm terminates once all nodes have been scheduled.