A Workflow Criticality-Based Approach to Bypass the Workflow Satisfiability Problem

Algorithm 2

Load_Status algorithm.

	//n: the number of users to verify.
	//m: the number of tasks that the user i executes.
(1)	while i ≤ n do
(2)	for k ⟵ 1, m do
(3)	UH ⟵ UH + Uk // UH = ∑Hi
(4)	end for
	// L(U) = UH/nb
	// c(T) = H(T)/(nb × D)
(5)	if 1 − L(U) ≥ c(T) then
	//Table of available users ordred by charge.
(6)	Tab[x] ⟵ Uij//Uij = Non_Conflict((U(Ri), t), T)
(7)	x ⟵ x + 1
(8)	else i ⟵ i + 1
(9)	end if
(10)	end while