Development of a sensitivity analysis (SA) procedure is a significant part of constructing robust solutions for a class of resource constrained planning and scheduling problems. The key uncertain parameters, the probabilities that projects will be terminated, occur in both the objective function and the left-hand side of the constraints. Estimates of the mean probability of failure for a task can be extracted from historical data; however, it is important to take into account the sensitivity of the proposed solution to variations in these estimates. Parameter studies show complex interactions between the objective function and the resource constraints. A method to study the behavior of the solution using branch and bound algorithms enhanced with logical programming is introduced.