Redundancy Resource Allocation for Reliable Project Scheduling: A Game-theoretical Approach

The redundancy allocation problem is among the most interesting and difficult problems in the system reliability design. In this paper this concept is considered to enhance reliability in projects network scheduling with stochastic activity duration. In order to determine the optimal manner of redundancy allocation, a new mathematical model is developed. Then, by simulating the problem in the form of a game-theoretical pattern, it is shown that the Nash-equilibrium points of the problem are very close to optimal solutions of original model. Therefore, an algorithmic approach is developed for the calculation of Nash equilibria. Finally, several computational experiments are executed and their results are analysed. The comparison of equilibrium outcomes with the optimal policy justifies the efficiency of Nash equilibria for increasing the projects network reliability.