A new approximation algorithm for obtaining the probability distribution function for project completion time (Q2460585): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126261409, #quickstatements; #temporary_batch_1722284575798
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PSPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.camwa.2007.01.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020076529 / 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: Q4166568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987 / 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: Markov and Markov-Regenerative <scp>pert</scp> Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the probability distribution of project duration in a PERT network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis / 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: Application of a Technique for Research and Development Program Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Completion Time of PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Greatest of a Finite Set of Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the distribution function of the sum of independent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and efficiency of Moore-algorithms for the shortest route problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Polynomially Bounded Shortest Path Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and fast label correcting algorithm for shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPLIB -- a project scheduling problem library / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126261409 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:30, 29 July 2024

scientific article
Language Label Description Also known as
English
A new approximation algorithm for obtaining the probability distribution function for project completion time
scientific article

    Statements

    A new approximation algorithm for obtaining the probability distribution function for project completion time (English)
    0 references
    0 references
    0 references
    12 November 2007
    0 references
    stochastic activity networks
    0 references
    discretization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references