Controlled alternative activity networks for project management (Q1107431): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simple stochastic networks: Some problems and procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision CPM: Network Reduction and Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Network Approach to the Planning and Scheduling of a Research Project / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the stable laws of distribution of the duration of operations in the stochastic network projects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4136858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110786 / rank
 
Normal rank

Latest revision as of 18:36, 18 June 2024

scientific article
Language Label Description Also known as
English
Controlled alternative activity networks for project management
scientific article

    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
    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
    0 references