Constrained Consumable Resource Allocation in Uncertain Project Networks with Fuzzy Activity Duration

This paper studies the constrained consumable resource allocation in an uncertain project network. The project network is a directed and acyclic graph in the fuzzy environment. It is supposed that the activity duration is a positive trapezoidal fuzzy number (TFN). Parameters of the activity duration depend on the amount of resource allocated to it. By ranking the paths and activities an algorithm is developed for allocating the constrained resource to activities in such a way that the completion time of project is decreased. The proposed algorithm is illustrated by an example