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

الموضوعات : مجله بین المللی ریاضیات صنعتی

N. Akhoundi Shiviyari ¹ (Department of Industrial Engineering, Ardabil Branch, Islamic Azad University, Ardabil, Iran)
S. S. Hashemin ² (Department of Industrial Engineering, Ardabil Branch, Islamic Azad University, Ardabil, Iran)

تاريخ الإرسال : 02 الجمعة , شعبان, 1438 تاريخ التأكيد : 01 السبت , محرم, 1441 تاريخ الإصدار : 04 الأحد , ربيع الثاني, 1441

الکلمات المفتاحية: Stochastic Metagraph, Constrained Resource Allocation, Project Completion Time,

ملخص المقالة :

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.