Commit 2c91588b authored by Markus Klinik's avatar Markus Klinik
Browse files


parent 12a2370a
......@@ -135,6 +135,7 @@ Let $\vec{q} = \tuple{p_1, p_2, \ldots, q_1, q_2, \ldots}$ be an objective vecto
Let $\vec{w} = \tuple{w_1, w_2, \ldots, v_1, v_2, \ldots}$ be the weights, pre-determined by the decision maker.
The score $s$ of an objective vector is calculated using the weighted product according to the following formula.
$$s = (p_1^{w_1} p_2^{w_2} \ldots) / (q_1^{v_2} q_2^{v_2} \ldots)$$
\todo{minimize objective can't be zero}
Some of the properties of the weighted-product method relevant for c2 scheduling are as follows.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment