论文信息 - A rule for slack allocation proportional to the duration in a PERT network

A rule for slack allocation proportional to the duration in a PERT network

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.

Daniel Gómez | Juan Tejada | Javier Castro

[1] Gustavo Bergantiños,et al. The proportional rule for problems with constraints and claims , 2002, Math. Soc. Sci..

[2] Barry O'Neill,et al. A problem of rights arbitration from the Talmud , 1982, Math. Soc. Sci..

[3] Gustavo Bergantiños,et al. NTU PERT games , 2002, Oper. Res. Lett..

[4] Hervé Moulin,et al. Priority Rules and Other Inequitable Rationing Methods , 1998 .

[5] R. Aumann,et al. Game theoretic analysis of a bankruptcy problem from the Talmud , 1985 .

[6] Bing Lu,et al. Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models , 2003, J. Comb. Optim..

[7] Daniel Gómez,et al. A polynomial rule for the problem of sharing delay costs in PERT networks , 2008, Comput. Oper. Res..

[8] H. Moulin. Priority Rules and Other Asymmetric Rationing Methods , 2000 .