AND/OR graphs and project management

Dušan Hvalica

Abstract


It is shown that projects can be described by AND/OR graphs and that the cost of the minimal solution subgraph can be defined so as to equal the shortest time for completing a project or the minimal costs of the project represented by the AND/ OR graph.


Keywords


project management, network programming, AND/OR graphs

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Crossref Similarity Check logo

Crossref logologo_doaj