Algorithm 4 Optimisation based on GA algorithm

1: Generate Solutions. Build a set of PopSize $\mathcal{P}$ solution 2: Reformulation of solutions. Selection of a local search method to each solution in $\mathcal{P}$ 3: while number of evaluations < MaxEval do 4:  $t_{sched}^i$ introduction to P. Evaluation of solution in $\mathcal{P}$ and update 5:  Probability of survival based on the quality of the solution 6:  $\mathcal{P}$ solution is partially selected to apply the mutation and crossover operation 7:  Number of evaluation ++ 8:  Constraint validate $\mathcal{P}$ for each $t_{sched}^i$. Discard solutions which are disqualified 9: end while