Castro Cantalejo, JavierGómez González, DanielTejada Cazorla, Juan Antonio2023-06-192023-06-192014-031435-246X10.1007/s10100-012-0264-5https://hdl.handle.net/20.500.14352/33486The SPERT problem was defined, in a game theory framework, as the fair allocation of the slack or float among the activities in a PERT network previous to the execution of the project. Previous approaches tackle with this problem imposing that the durations of the activities are deterministic. In this paper, we extend the SPERT problem into a stochastic framework defining a new solution that tries also to maintain the good performance of some other approaches that have been defined for the deterministic case. Afterward, we present a polynomial algorithm for this new solution that also could be used for the calculation of other approaches founded in the deterministic SPERT literature.engjournal articlehttp://link.springer.com/article/10.1007/s10100-012-0264-5http://www.springer.com/open access519.8Game theoryProject schedulingPERT networkSlack allocationPolynomial algorithmsInvestigación operativa (Matemáticas)1207 Investigación Operativa