A heuristic procedure for solving the dynamic probabilistic project expediting problem (Q948658): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2007.09.010 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: BRATIO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Diehard / 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.ejor.2007.09.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030702697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost/time trade-off analysis for the critical path method: a derivation of the network flow approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Reduction of Two-Terminal Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic gradient-based time-cost tradeoffs in PERT networks using simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Estimation of Arc Criticalities in Stochastic Activity Networks / 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: Critical Path Analyses Via Chance Constrained and Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An uncertainty importance measure of activities in PERT networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete time-cost tradeoff problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling. A research handbook. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal procedures for the discrete time/cost trade-off problem in project networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: New computational results on the discrete time/cost trade-off problem in project networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of the complexity index as a measure of complexity in activity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 708: Significant digit computation of the incomplete beta function ratios / 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 Criticality Indices of the Activities in PERT Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Expected Duration of PERT Type Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On criticality and sensitivity in activity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the measurement of complexity in activity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance-constrained programming in activity networks: A critical evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERT and crashing revisited: Mathematical generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Network Flow Computation for Project Cost Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Note on “A Simple CPM Time-Cost Tradeoff Algorithm” / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling under uncertainty: survey and research potentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Algorithm for Decision CPM Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient of Network Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical-Path Planning and Scheduling: Mathematical Basis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chance constrained critical path with location-scale distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Time Compression in Project Scheduling / 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: Twisted GFSR generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twisted GFSR generators II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mersenne twister / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CPM Time-Cost Computational Algorithm for Arbitrary Activity Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project scheduling: The effects of problem structure on heuristic performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Project Management Duration/Resource Tradeoff Analysis: an Application of the Cut Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution to Cost-Time Tradeoff for CPM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple CPM Time-Cost Tradeoff Algorithm / 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: Measures of the restrictiveness of project networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Use of Distributions in Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical path planning under uncertainty / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2007.09.010 / rank
 
Normal rank

Latest revision as of 09:26, 10 December 2024

scientific article
Language Label Description Also known as
English
A heuristic procedure for solving the dynamic probabilistic project expediting problem
scientific article

    Statements

    A heuristic procedure for solving the dynamic probabilistic project expediting problem (English)
    0 references
    0 references
    17 October 2008
    0 references
    project scheduling
    0 references
    heuristics
    0 references
    simulation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers