Universidad Complutense de Madrid
E-Prints Complutense

Allocating slacks in stochastic PERT network

Impacto

Descargas

Último año

Castro, Javier y Gómez, Daniel y Tejada Cazorla, Juan Antonio (2014) Allocating slacks in stochastic PERT network. Central European journal of operations research, 22 (1). pp. 37-52. ISSN 1435-246X

[img] PDF
Restringido a Sólo personal autorizado del repositorio hasta 31 Diciembre 2022.

250kB

URL Oficial: http://link.springer.com/article/10.1007/s10100-012-0264-5


URLTipo de URL
http://www.springer.com/Editorial


Resumen

The 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.


Tipo de documento:Artículo
Palabras clave:Game theory; Project scheduling; PERT network; Slack allocation; Polynomial algorithms
Materias:Ciencias > Matemáticas > Investigación operativa
Código ID:24721
Depositado:18 Mar 2014 10:29
Última Modificación:18 Mar 2014 10:29

Descargas en el último año

Sólo personal del repositorio: página de control del artículo