Allocating slacks in stochastic PERT network

DOI10.1007/s10100-012-0264-5zbMath1339.90320OpenAlexW2074873192MaRDI QIDQ301152

Juan Tejada, Daniel Gómez, Javier Castro

Publication date: 29 June 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-012-0264-5

zbMATH Keywords

game theoryproject schedulingPERT networkpolynomial algorithmsslack allocation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Games involving graphs (91A43) Applications of game theory (91A80) Management decision making, including multiple objectives (90B50)

Related Items (3)

Revenue sharing for resource reallocation among project activity contractors ⋮ Sharing delay costs in stochastic scheduling problems with delays ⋮ Or in the industrial engineering of industry 4.0: experiences from the Iberian Peninsula mirrored in CJOR

Cites Work

• A new probabilistic approach to the path criticality in stochastic PERT
• Iterative converging algorithms for computing bounds on durations of activities in pert and pert-like models
• NTU PERT games
• Two approaches to the problem of sharing delay costs in joint projects
• The proportional rule for problems with constraints and claims.
• A rule for slack allocation proportional to the duration in a PERT network
• A polynomial rule for the problem of sharing delay costs in PERT networks
• The equal award principle in problems with constraints and claims
• A genetic algorithm approach for the time-cost trade-off in PERT networks
• Bounding the Project Completion Time Distribution in PERT Networks
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• Computing bounds on project duration distributions for stochastic PERT networks

This page was built for publication: Allocating slacks in stochastic PERT network