An Algebra for the Analysis of Generalized Activity Networks

Salah E. Elmaghraby
Additional contact information
Salah E. Elmaghraby: Yale University, New Haven, Connecticut

Management Science, 1964, vol. 10, issue 3, 494-514

Abstract: This paper generalizes the approach of activity networks, exemplified by PERT and CPM, to networks in which activites and events occur probabilistically and contain logical relationships of a more complicated nature. For example, from a specific event some activities are undertaken with certainty while others probabilistically. It presents an algebra of analysis taking the decision rules or logical structure of the system as given. The approach is applicable to the analysis of practical situations such as contract bidding, flow in shops, etc.

Date: 1964
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.10.3.494 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:10:y:1964:i:3:p:494-514

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().