The most critical path in a PERT network: A heuristic approach (Q1341990): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90124-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975996215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost-reliability ratio path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666614 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multivariate Approach to Estimating the Completion Time for PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal ratio spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the <i>K</i> Most Critical Paths in PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the distribution functions in stochastic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Project Completion Time Distribution in PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results Concerning the Estimation of Beta Distribution Parameters in PERT / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distribution of Activity Time in PERT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path problem with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Point Approximations for Continuous Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of a Technique for Research and Development Program Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution of the Time Through a Directed, Acyclic Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with nonlinear multiattribute cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate means and standard deviations based on distances between percentage points of frequency curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Completion Time of PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding distributions for a stochastic pert network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of cutsets in Monte Carlo analysis of stochastic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5612245 / rank
 
Normal rank

Latest revision as of 10:18, 23 May 2024

scientific article
Language Label Description Also known as
English
The most critical path in a PERT network: A heuristic approach
scientific article

    Statements

    The most critical path in a PERT network: A heuristic approach (English)
    0 references
    9 February 1995
    0 references
    project management
    0 references
    most critical path problem
    0 references
    deterministic network
    0 references
    two-attribute fractional objective function
    0 references
    heuristic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers