JSS shortest schedule penalty base

[m3ller]

Description At the moment, the base for the shortest schedule penalty is number of jobs + 1. However, in the derivation, the base is total number of TASKS + 1.

Some thought needs to be put into fixing this. We want the mathematical guarantee that the penalty is smallest for an optimized solution (see code for comments on how the shortest schedule penalty works), but increasing from number of jobs to number of tasks is likely to significantly increase the penalty.

[m3ller]

Alternative to this penalty is to simply run the problem multiple times with various max schedule times. Smallest valid schedule is the schedule returned to the user.