Computing project makespan distributions: Markovian PERT networks revisited

DOI10.1016/J.COR.2018.10.017zbMath1458.90387OpenAlexW2900215476WikidataQ128981538 ScholiaQ128981538MaRDI QIDQ1634063

Jeroen Burgelman, Mario Vanhoucke

Publication date: 17 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.10.017

zbMATH Keywords

project schedulingMarkov chainslinear algebraPERT networks

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36)

Related Items (1)

A novel minimal cut-based algorithm to find all minimal capacity vectors for multi-state flow networks

Uses Software

• PSPLIB
• Gurobi
• RanGen
• mftoolbox

Cites Work

• Unnamed Item
• Resource allocation in multi-class dynamic PERT networks with finite capacity
• Resource allocation in dynamic PERT networks with finite capacity
• Longest path analysis in networks of queues: dynamic scheduling problems
• Multi-objective time-cost trade-off in dynamic PERT networks using an interactive approach
• A multi-objective resource allocation problem in dynamic PERT networks
• Comparing distributions
• Scheduling projects with stochastic activity duration to maximize expected net present value
• PSPLIB -- a project scheduling problem library
• Project scheduling under uncertainty: survey and research potentials
• On the fallacy of averages in project risk management
• Scheduling Markovian PERT networks to maximize the net present value
• Minimizing the expected makespan of a project with stochastic activity durations under resource constraints
• Lower bound for the mean project completion time in dynamic PERT networks
• An evaluation of the adequacy of project network generators with systematically sampled networks
• Rangen: A random network generator for activity-on-the-node networks
• A multi-objective resource allocation problem in PERT networks
• Project planning with alternative technologies in uncertain environments
• Computing the Action of the Matrix Exponential, with an Application to Exponential Integrators
• Estimation of u^Tƒ(A)v for large‐scale unsymmetric matrices
• A New Scaling and Squaring Algorithm for the Matrix Exponential
• A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
• The Completion Time of PERT Networks
• Nineteen Dubious Ways to Compute the Exponential of a Matrix
• Activity Delay in Stochastic Project Networks
• Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Application of a Technique for Research and Development Program Evaluation
• Expected Critical Path Lengths in PERT Networks
• Critical Path Analyses Via Chance Constrained and Stochastic Programming
• Bootstrap Methods
• Functions of Matrices
• Distribution of the Time Through a Directed, Acyclic Network

This page was built for publication: Computing project makespan distributions: Markovian PERT networks revisited