In this paper computational results are presented with a very general, yet powerful backtracking procedure for solving the duration minimization and net present value maximization problems in a precedence and resource-constrained network. These networks are generally of the PERT/CPM variety, although it is not required that they be so. Among the advantages cited for our approach are low compute...

An important issue in the use of expert sys tems is the so called brittleness problem Ex pert systems model only a limited part of the world While the explicit management of uncertainty in expert systems mitigates the brittleness problem it is still possible for a system to be used unwittingly in ways that the system is not prepared to address Such a situation may be detected by the method of s...

In this paper we discuss some practical issues that arise in solving hybrid Bayesian networks that include deterministic conditionals for continuous variables. We show how exact inference can become intractable even for small networks, due to the difficulty in handling deterministic conditionals (for continuous variables). We propose some strategies for carrying out the inference task using mix...

Tradeoff between time and cost is an important issue in planning a project. This paper deals with a stochastic Time-Cost Tradeoff Problem (TCTP) in PERT network of project management. All activities are subject to linear cost function and assumed to be exponentially distributed. The aim of this problem is to maximize the project completion probability with a pre-known deadline to a predefined p...

Project management is usually calculated as a set of static activities, whereas in reality these activities tend to be dynamic involving multiple feedbacks (Park and Peña-Mora [5]). This results in many late project completions. Recently research has been done to formulate and analyze various methods to improve project prediction and control. These include concurrent engineering (Carter and Bak...

In this paper, I propose a new methodology to find the bicriteria shortest path from the source to the sink node of a network of queues under the steady-state condition. I assume the number of servers in each service station settled in a node of the network is either one or infinity. Moreover, the arc lengths are mutually independent random variables. First, I propose a method to transform each...

Abstract Traditionally, stochastic project planning problems are modeled using the Program Evaluation and Review Technique (PERT). PERT is an attractive technique that commonly used in practice as it requires specification of only a few characteristics activities’ duration. Moreover, its computational burden extremely low. Over years, four main disadvantages have been voiced much research has d...