
210 Practical Workflow Applications
max
X
i
rp
i sel(i)
i.e., max
X
i,j
rp
ij
b
ij
X
i
c
i sel(i)
d
i
≤ B
∀
j
b
4j
= b
10j
b
5j
= b
11j
, b
6j
= b
12j
b
2j
= b
7j
= b
13j
, b
3j
= b
8j
= b
14j
.
In the aforementioned formulations, a condition on the minimum reputation
for selected services can also be imposed as:
∀
i,j
rp
ij
≥ RP MIN · b
ij
. (7.1)
This problem formulation can be easily solved by all the algorithms proposed
in Section 4.2.
7.5 Control and Management of Distributed Devices and
Sensors
Other than using BeesyCluster and its workflow management system for
optimization of service selection and optimization including execution time,
cost and possibly other quality metrics such as reliability