Algorithm 1 Compute the optimal deployment for Problem 1
1.	$\mathrm{Input}:\overline{T}=\left\{\left\{T_1^1,T_1^2,...,T_1^{M_1}\right\},...,\left\{T_q^1,T_q^2,...,T_q^{M_q}\right\}\right\},\overline{R}=\left\{R_1,R_2,...,R_N\right\},L,\omega \left(\mathrm{precision}\mathrm{threshold}\right)$
2.	$\mathrm{Output}:\mathrm{the}\mathrm{optimal}\mathrm{placement}\mathrm{order}{S}^{*},\mathrm{the}\mathrm{optimal}\mathrm{value}{\lambda }^{*},l=0,r=INF(\mathrm{a}\mathrm{larger}\mathrm{number})$
3.	$\mathrm{Repeat}$
4.	$mid\leftarrow \frac{l+r}{2}$
5.	$\mathrm{Call}\mathrm{Algorithm}2(\overline{T},\overline{R})\mathrm{to}\mathrm{get}len\mathrm{and}S//\mathrm{order}S\mathrm{can}\mathrm{denote}\mathrm{the}\mathrm{barrier}P$
6.	$\mathrm{If}len>L+\omega$
7.	$l\leftarrow mid$
8.	$\mathrm{Else}$
9.	$r\leftarrow mid$
10.	$\mathrm{Until}\left|l-r\right|\le \omega$
11.	$\mathrm{Return}{S}^{*}\leftarrow S,{\lambda }^{*}\leftarrow mid$