Algorithm 1: HCCETS Framework

Input: $Q_{\upsilon }$; $Q_d$; {$V_{j,1}$, …, $V_{j,m}$}

1    begin

2      Z ← 0;

3      Call Task Sequencing;

4      foreach (${\upsilon }_i$ ∈ $Q_{\upsilon }$) do

5          Zi ← Call Initial Task Scheduling;

6          Z ← Z + Zi;

7          Call Critical Task Reshuffling;

8          Call Cost-Efficient Rescheduling;

9          Z* ← Z + Zi;

10      return Z*;