A Heuristic for Constrained Consumable Resource Allocation in Alternative Stochastic Networks

Some of real projects are completing through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASN). It is supposed that nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. This paper discusses the constrained consumable resource allocation problem in ASN. A heuristic is developed for allocating the constrained consumable resource among the project activities. This heuristic method is illustrated by an example