Bilogic PERT networks can be used to model the execution of parallel and/or sequential programs. If the various tasks composing the program are given random durations, the problem of computing the program completion time is NP-hard. We describe a low polynomial complexity algorithm that provides bounds and approximations of the completion time using properties of integral orderings among random variables. The algorithm is tested on some examples of large graphs and proves to be satisfactory.