Constrained Consumable Resource Allocation in Stochastic Metagraphs with Discrete Random Times

International Journal of Industrial Engineering

© 2017 by SSRG - IJIE Journal

Volume 4 Issue 2

Year of Publication : 2017

Authors : S.S. Hashemin and N. Akhoundi Shiviyari

10.14445/23499362/IJIE-V4I4P102

How to Cite?

S.S. Hashemin and N. Akhoundi Shiviyari, "Constrained Consumable Resource Allocation in Stochastic Metagraphs with Discrete Random Times," SSRG International Journal of Industrial Engineering, vol. 4,  no. 2, pp. 13-17, 2017. Crossref, https://doi.org/10.14445/23499362/IJIE-V4I4P102

Abstract:

This paper presents a new heuristic algorithm for allocation of constrained consumable resource in stochastic metagraphs. The duration of each edge is a discrete random variable with known probability function and also depends on the amount of resource allocated to it. It is assumed that a certain type of consumable resource is needed to execute each activity of the project. The amount of resource which can be allocated to each activity is constrained to specific values. So, we must allocate the constrained resource to activities optimally. The problem is to maximize the probability of completion of stochastic metagraph before the due date of the project. Solving this problem using the analytical method is very time consuming. Therefore, we have developed a new heuristic algorithm in order to solve the problem.

Keywords:

Consumable resource, Stochastic metagraph, Constrained resource allocation, Project management, Project completion time.

References:

[1] A. Basu and R. W. Blanning, Enterprise Modeling using Metagraphs, Decision support systems: Experiences and Expectations, 1992, 183-192. 
[2] A. Basu and R. W. Blanning, Metagraphs and Perti Nets in Model Management, Proceedings of the Second Annual workshop on Information technologies and systems, 1992, 64-73.
[3] A. Basu and R. W. Blanning, Metagraphs and their application, Springer US, Integrated Series in Information System, 2007. 
[4] A. Basu and R. W. Blanning: A Tool for modeling Decision support systems, Management Science, 40(12), 1994, 1579–1600.
[5] A. Basu, and R. W. Blanning, A Metagraph-Based DSS Analysis Workbench, 29th Hawaii International Conference on System Science, 1996.
[6] A. Basu, and R. W. Blanning, Metagraph Transformations and Workflow Management, Proceedings of the Thirtieth Annual Hawaii International Conference on System Science, 1997.
[7] A. Basu, and R. W. Blanning, Workflow Analysis Using Attributed Metagraphs, Proceedings of the 34th Hawaii International Conference on System Science, 2001.
[8] S. S. Hashemin, Computing of the Completion Time for Fuzzy Metagraphs, 2nd Joint Congress on Fuzzy and Intelligent Systems, Iran, Tehran, 2008. 
[9] S. S. Hashemin, Time cost trade-off in uncertain Metagraphs with trapezoidal fuzzy edge time, Annals of Fuzzy Sets Logic and Fuzzy System, 1(2), 2011,117-127.
[10] S. S. Hashemin, Constrained resource allocation in fuzzy metagraph, 10th Iranian Conference on Fuzzy Systems, Shahid Beheshti University, 2010, 13-15. 
[11] S. S. Hashemin, Constrained Renewable Resource in Allocation in Fuzzy Metagraphs via Min-slack, International Journal of Applied Operational Research, 1(1), 2011, 7-17.
[12] H. Vahedi, and S. S. Hashemin, A New Method for Allocation of Constrained Non-Renewable Resource in Fuzzy Metagraphs, International Journal of Industrial Engineering, 2(3),2015,14-19. 
[13] S. S. Hashemin, Completion Time of Stochastic Metagraphs by Sampling from Edge Time and using the conditional Monte-Carlo simulation, 12th International Symposiumon Econometrics, Operations Research and statistics, Turkey, Denizli, 2011.
[14] E. Hakimzadeh, and S. S. Hashemin, Constrained Renewable Resource Allocation in Stochastic Metagraphs, International Journal of Industrial Engineering, 4(4),2017,1-5.