A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
From MaRDI portal
Publication:3835266
DOI10.1080/03155986.1989.11732098zbMath0678.90033OpenAlexW2400084195MaRDI QIDQ3835266
Vidyadhar G. Kulkarni, Veena G. Adlakha
Publication date: 1989
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03155986.1989.11732098
Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35)
Related Items
The construction of stable project baseline schedules, A two-stage stochastic programming approach for project planning with uncertain activity durations, Project planning with alternative technologies in uncertain environments, Computing project makespan distributions: Markovian PERT networks revisited, A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept, Longest path analysis in networks of queues: dynamic scheduling problems, A classified bibliography of recent research relating to project risk management, Activity nets: A guided tour through some recent developments, Criticality analysis of activity networks under interval uncertainty, A new approach to determine the critical path in stochastic activity network, A new approximation algorithm for obtaining the probability distribution function for project completion time, Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error, Bounding the distribution of project duration in PERT networks, The exact overall time distribution of a project with uncertain task durations, Confidence Intervals for Quantiles Using Sectioning When Applying Variance-Reduction Techniques, Stochastic task networks -- trading performance for stability, Scheduling Markovian PERT networks to maximize the net present value, Robust resource allocations in temporal networks, Minimization of circuit registers: Retiming revisited, Critical path in an activity network with time constraints, Resource allocation by means of project networks: Complexity results
