Table 4 Complexities (T(W)) of line-seru conversion with the different scheduling rules
Scheduling on seru load | T(W) | Explanation |
|---|---|---|
Without given a scheduling | \(\sum\limits_{J = 1}^{W} {P (W ,J )} *(J^{M} )\) | Combine Eq. (14) with Theorem 1 |
A SRRSS and M ≥ J | \(\sum\limits_{J = 1}^{W} {P (W ,J )} *(P_{J}^{J} )\) | Combine Eq. (14) with Theorem 2 |
A SRRSS and M < J | \(\sum\limits_{J = 1}^{W} {P (W ,J )} *(P_{J}^{M} )\) | Combine Eq. (14) with Theorem 3 |
A SRUSS | \(\sum\limits_{J = 1}^{W} {P (W ,J )}\) | Combine Eq. (14) with Theorem 4 |