Algorithm 2: Pseudocode for the RA_Scheduler.

Input: $\mathcal{Q}\left[B{S}_i\right]$, user tuple $\langle U{E}_j,P_j,{\gamma }_j,CQ{I}_j,R{B}_{ij}^{\mathrm{req}}\rangle$, current $R{B}_i^{\mathrm{avail}}$ Output: $R{A}_{\mathrm{decision}}\left[B{S}_i\right]$, updated $R{B}_i^{\mathrm{avail}}$

1:$R{B}_i^{\mathrm{alloc}}\leftarrow 0$;   $R{A}_{\mathrm{decision}}\left[B{S}_i\right]\leftarrow \varnothing$ 2: ${\mathcal{Q}}_{\mathrm{uRLLC}}\leftarrow \{j\in \mathcal{Q}\left[B{S}_i\right]\mid P_j=P_{\mathrm{uRLLC}}\}$ 3: ${\mathcal{Q}}_{\mathrm{eMBB}}\leftarrow \{j\in \mathcal{Q}\left[B{S}_i\right]\mid P_j=P_{\mathrm{eMBB}}\}$ 4: ${\mathcal{Q}}_{\mathrm{mMTC}}\leftarrow \{j\in \mathcal{Q}\left[B{S}_i\right]\mid P_j=P_{\mathrm{mMTC}}\}$ 5:sort ${\mathcal{Q}}_{\mathrm{eMBB}}$ by $CQ{I}_j$ desc                  ▹ Serve eMBB with highest CQI first 6:for all $j\in [{\mathcal{Q}}_{\mathrm{uRLLC}}\parallel {\mathcal{Q}}_{\mathrm{eMBB}}\parallel {\mathcal{Q}}_{\mathrm{mMTC}}]$ do 7:    if $R{B}_i^{\mathrm{avail}}\ge R{B}_{ij}^{\mathrm{req}}$ then 8:        $R{A}_{\mathrm{decision}}\left[B{S}_i\right]\left[j\right]\leftarrow R{B}_{ij}^{\mathrm{req}}$ 9:        $R{B}_i^{\mathrm{avail}}\leftarrow R{B}_i^{\mathrm{avail}}-R{B}_{ij}^{\mathrm{req}}$ 10:    end if 11: end for 12:return $\left(R{A}_{\mathrm{decision}}\left[B{S}_i\right],R{B}_i^{\mathrm{avail}}\right)$