SENSITIVITY ANALYSIS FOR PROJECT-PLANNING AND SCHEDULING UNDER UNCERTAIN COMPLETIONS

Development of a sensitivity analysis (SA) procedure is a significant part of constructing robust solutions for a class of resource constrai ned planning and scheduling problems. The key uncertain parameters, th e probabilities that projects will be terminated, occur in both the ob jective function and the left-hand side of the constraints. Estimates of the mean probability of failure for a task can be extracted from hi storical data; however, it is important to take into account the sensi tivity of the proposed solution to variations in these estimates. Para meter studies show complex interactions between the objective function and the resource constraints. A method to study the behavior of the s olution using branch and bound algorithms enhanced with logical progra mming is introduced. (C) 1998 Elsevier Science Ltd. All rights reserve d.