Constrained Non-Renewable Resource Allocation in Metagraphs with Discrete Random ‎Times

In this paper, it is supposed that a project can be shown as a metagraph. The duration of activities are discrete random variables with known probability function, also one kind of consumable and constrained resource is required to execute each activity of the project.The objective of this paper is to maximize the probability of completion of stochastic metagraph before the due date of the project.

کلیدواژه ها:

Constrained Resource Allocation ، Stochastic Metagraph ، Project Completion Time