RT Journal Article
T1 A rule for slack allocation proportional to the duration in a PERT network
A1 Castro Cantalejo, Javier
A1 Gómez González, Daniel
A1 Tejada Cazorla, Juan Antonio
AB In this paper, we define a new rule for the resolution of the slack allocation problem in a PERT network. This problem exists of allocating existing extra time in some paths among the activities belonging to those paths. The allocation rule that we propose assigns extra time to the activities proportionally to their durations in such a way that no path duration exceeds the completion time of the whole project. This time allocation enables us to make a schedule for the PERT project under study. We give two characterizations of the rule and we compare it with others that have been previously defined in the literature.
PB Elsevier Science
SN 0377-2217
YR 2008
FD 2008
LK https://hdl.handle.net/20.500.14352/50062
UL https://hdl.handle.net/20.500.14352/50062
LA eng
NO R.J. Aumann, M. Maschler, Game theoretic analysis of a bankruptcy problem from the talmud, Journal of Economic Theory 36 (1985) 195–213.G. Bergantiños, E. Sánchez, NTU PERT games, Operations Research Letters 30 (2002) 130–140.G. Bergantiños, E. Sánchez, The proportional rule for problems with constraints and claims, Mathematical Social Sciences 43 (2002)225–249.J. Castro, D. Gómez, J. Tejada, A polynomial rule for the problem of Sharing delay cost in PERT networks, Computers and Operations Research (2006), doi:10.1016/j.cor.2006.11.003.H. Moulin, Priority rules and other inequitable rationing methods, Econometrica 68 (2000) 643–684.B. O’Neill, A problem of rights arbitration from the talmud, Mathematical Social Sciences 2 (1982) 345–371.E. Shragowitz, H. Youseff, B. Lu, Iterative converging algorithms for computing bounds on durations of activities in Pert and Pert-like models, Journal of Combinatorial Optimization 7 (2003) 5–22.
DS Docta Complutense
RD 30 sept 2024