Algorithm 4: Cost-Efficient Rescheduling

Input: Z, PList[vi ∈ N, j ∈ M];

1  begin

2      foreach (vi as N) do

3          Calculate the $T_i^e$ of Vj by the Equation (4);

4            if Tj,i -1 + $T_i^e$ < di then

5                Calculate the Tj,i of Vj by the Equation (3);

6                V ← Vj;

7                break;

8            Calculate cost of Z by the Equation (1);

9            PList[vi ∈ N, j ∈ M] ← Z*;

10          return Z*;