Time-Efficient Allocation Mechanisms for Crowdsensing Tasks with Precedence Constraints

. 2019 May 29;19(11):2456. doi: 10.3390/s19112456

Algorithm 2 Final task set construction

Require:
the task set

T

Ensure:
the final task set

F

1: Set

F = T

;
2: for each task

t_{j} \in F

do
3: for each task

t_{k} \in T

do
4: for each task

t_{q} \in C_{k}

do
5: if

t_{j} = t_{q}

then
6: Delete task

t_{j}

from the final task set

F

;
7: return the final task set

F

;