New Heuristic for Constrained Non- Renewable Resource Allocation in Stochastic Metagraphs with Discrete Random Times
Citation
Maryam Ebrahimi Erdi, Seyed Saeid Hashemin"New Heuristic for Constrained Non- Renewable Resource Allocation in Stochastic Metagraphs with Discrete Random Times", International Journal of Engineering Trends and Technology (IJETT), V60(3),172-179 June 2018. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group
Abstract
In recent years, some researchers have attempted to show projects using metagraphs. In real word projects, activity durations are non-deterministic. Non-deterministic quantities can be shown with random variables. Here, it is assumed that the activity duration is a discrete random variable with a known probability function. It is supposed that a certain type ofnon-renewable (consumable) resource is necessary to execute the activities. However, the amount of the available resource is constrained and known. In addition, probability function of activity time depends on the resource allocated to it. In this research, a new heuristic algorithm has been developed to allocate the constrained consumable resource to the edges (activities) of the metagraph such that, the delay in project completion time is decreased. In other words, the probability of project completion before the due date is maximized. Some examples have been solved using the new and previous algorithms. Then, results have been compared. This probability has been used for time-cost trade off in the project, in a way that the total cost of project is minimized. Therefore, the optimum value of the resource is defined.
Reference
[1] A. Basu and R. W. Blanning, Enterprise Modeling using Metagraphs, Decision support systems: Experiences and Expectations,pp. 183-192,1992.
[2] Basu, A., and Blanning, R.W. Metagraphs.Omega.Vol. 23, No. 1, pp. 13-25, 1995.
[3] Basu, A., and Blanning, R.W. Metagraphs: A Tool for modeling Decision support systems. Management Science,Vol. 40, No. 12, pp.1579-1600, 1994.
[4] Basu, A., and Blanning, R.W. Metagraph Transformation and Workflow analysis. Proceedings of the Thirtieth Annual Hawaii International Conference on System Science, Vol.4, pp. 359-366, 1997.
[5] Basu, A., and Blanning, R.W. Metagraphs in workflow Support Systems.Decision Support Systems, Vol. 5, No. 3, pp. 199-208, 1999.
[6] Basu, A., and Blanning, R.W. Workflow Analysis Using Attributed Metagraphs. Proceedings of the 34 th Hawaii International Conference on System Science, pp. 9, 2001.
[7] Basu, A., and Blanning, R.W. Metagraph and Their Application.SpringerUS, Integrated Series in Information Systems, 2007.
[8] Hashemin, S.S. Constrained resource allocation in fuzzy metagraph.10th Iranian Conference on Fuzzy Systems, ShahidBeheshtiUniversity, pp.13-15, 2010.
[9] Hashemin, S.S. Time cost trade-off in uncertain metagraphs with trapezoidal fuzzy edge time, Annals of fuzzy sets, fuzzy logic and fuzzy system, Vol. 1, No. 2, pp. 117-128, 2011.
[10] Hashemin, S.S., Akhoundi shiviyari, N. Constrained consumable resource allocation in stochastic metagraphs with discrete random times. International Journal of Industrial Engineering, Vol. 4, No. 4, pp. 6-10, 2017.
Keywords
Time-cost trade off; Consumable resource allocation; Stochastic metagraph; Project completion time.