This paper discusses a part selection problem for a flexible manufacturing system with versatile machine tools but with no tool transportation devices. We propose a maximal network flow model with… Expand

Given p or c, a semi-greedy heuristic chooses each iteration's decision randomly from among those decisions resulting in objective value improvements either within p% of the best improvement or among… Expand

This paper presents a new method for obtaining probability distributions that bound the exact probability distribution of the project duration from above and below.Expand

This paper discusses the solution of such a network in which one node is a source having an infinite supply of a commodity, and every other node a sink having a known constant demand.Expand

We consider a capital budgeting problem in which each potential project requires the performance of a known set of activities. In general, these sets of activities are not mutually exclusive.… Expand

An algorithm that sequentially computes upper bounds on the reliabilities of nodes of a directed source-sink network until we finally obtain an upper bound on the reliability of the network's sink.Expand

We present a decomposition algorithm for the exact computation of the reliability of a directed, source-sink network whose arcs either function or fail with known probabilities.Expand

This paper presents a recursive algorithm for computing bounds on the reliability of a directed, source-sink network whose arcs either function or fail with known probabilities.Expand