A computational study on bounding the makespan distribution in stochastic project networks

DOI10.1023/A:1010945830113zbMath1024.90012OpenAlexW1539960181MaRDI QIDQ5948194

Arfst Ludwig, Rolf H. Möhring, Frederik Stork

Publication date: 31 October 2001

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010945830113

zbMATH Keywords

bounding procedurescomputational studyPERT networks

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Stochastic network models in operations research (90B15)

Related Items (7)

A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing ⋮ Project planning with alternative technologies in uncertain environments ⋮ Genetic tabu search for the fuzzy flexible job shop problem ⋮ Criticality analysis of activity networks under interval uncertainty ⋮ Scheduling Markovian PERT networks to maximize the net present value ⋮ Robust resource allocations in temporal networks ⋮ A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems

Uses Software

• PSPLIB

This page was built for publication: A computational study on bounding the makespan distribution in stochastic project networks