“…It initializes by determining the earliest start time t of A i , building a schedule σ for S i = t , computing its cost c =Č S i = t , and defining the variable c min that will be used to tighten the lower bound of C. Note that the direct approach to build σ (line 21) is a standard preemptive scheduling algorithm, therefore it is not presented here in detail. Then, the algorithms iteratively recomputes schedule σ by calling RecomputeSchedule (lines [24][25][26][27][28][29][30][31][32][33][34]. Note that RecomputeSchedule updates the values of σ , t, and c. At this point, variables t prev and t store the values of t j and t j+1 , respectively, while c prev and c contain the corresponding lower bound costs.…”