Controlled alternative activity networks for project management (Q1107431)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4064754
Language Label Description Also known as
default for all languages
No label defined
    English
    Controlled alternative activity networks for project management
    scientific article; zbMATH DE number 4064754

      Statements

      Controlled alternative activity networks for project management (English)
      0 references
      1988
      0 references
      This paper presents a branching network to control a project with two different types of alternative events. The first one reflects stochastic (uncontrolled) branching of the development of a project. The alternative event of the second type is of a deterministic nature, i.e., the project's decision-maker chooses the outcome direction. Such a network contains alternative nodes with different logical operations at the input and output and includes both connective and diverging paths. The problem of controlling a project is, in essence, the choosing of an optimal outcome direction at every `decision-making' node which is reached in the course of the project's realization. This is carried out by a permanent reduction of the initial network and by applying a special algorithm described here, based on lexicographical scanning. A numerical example is given and application areas are presented.
      0 references
      controlled alternative activity networks
      0 references
      project management
      0 references
      outcome graph
      0 references
      joint variant
      0 references
      admissible plan
      0 references
      lexicographical order
      0 references
      branching network
      0 references
      two different types of alternative events
      0 references
      lexicographical scanning
      0 references

      Identifiers