Algorithm used?

[mcbain]

Do you use a known algorithm to find the best schedule ?

[bunkat]

It's based on standard critical path/float algorithms (see http://www.pmexamsmartnotes.com/how-to-calculate-critical-path-float-and-early-and-late-starts-and-finishes/ for an example on how to calculate the critical path and float). I use the calculated float and a couple of other properties (priorities, dependencies, etc) to sort the tasks and then schedule them in order at the first possible time when all of their dependencies are met.