This study is devoted to the evaluation of schedules of parallel applications consisting of a set of stochastic tasks having precedence constraints between them. This is an important issue when the goal is to evaluate the efficiency and the robustness of a schedule. In this case, evaluating the makespan consists to evaluate an arithmetic expression with random variables. Results show that the proposed methods provide a reasonable trade-off between precision and computation time.