Algorithm 4:

procedure SELECT_FEASIBLE_k0_AND_nsc($\mathcal{X}$) 2:   $\mathcal{H}\leftarrow \left\{\begin{array}{c}h=\left(m^{*},u^{*},r^{*},q^{*},k_0,n^{sc}\right)\in \mathcal{X}\times \mathcal{K}\times \mathcal{I}:\hfill \\ \sum _{i=1}^N{x}_{p,s,c,i}\le 1\hfill \\ \sum _{s=1}^L{x}_{p,s,c,i}=u^{*}·r^{*}·t^{*},t\in \mathcal{T}\hfill \\ \sum _{s=1}^L\left|\left(x_{p,s,c,i}-x_{p,s+1,c,i}\right)\right|\le 2\hfill \\ \sum _{s=1}^L\sum _{c_1}^{c_{end}}{x}_{p,s,c,i}={\beta }^{*}·\left(u^{*}·r^{*}·t^{*}\right)\hfill \\ s{b}_{k_0}+u^{*}·r^{*}·t^{*}\le d\hfill \\ 1\le s{b}_{k_0}\le L\hfill \\ s{b}_{k_0}+u^{*}·r^{*}·t^{*}-1\le L\hfill \end{array}\right\}$    return $\mathcal{H}$ 4: end procedure