Constrained Consumable Resource Allocation in GERTtype Networks with EXCLUSIVEOR, PROBABILISTIC Nodes

Yashar Hasanpour Gara Tapeh; Seyed Saeid Hashemin

doi:https://doi.org/10.14445/22315381/IJETT-V56P203

Research Article | Open Access | Download PDF

Volume 56 | Number 1 | Year 2018 | Article Id. IJETT-V56P203 | DOI : https://doi.org/10.14445/22315381/IJETT-V56P203

Constrained Consumable Resource Allocation in GERTtype Networks with EXCLUSIVEOR, PROBABILISTIC Nodes

Yashar Hasanpour Gara Tapeh, Seyed Saeid Hashemin

Citation :

Yashar Hasanpour Gara Tapeh, Seyed Saeid Hashemin, "Constrained Consumable Resource Allocation in GERTtype Networks with EXCLUSIVEOR, PROBABILISTIC Nodes," International Journal of Engineering Trends and Technology (IJETT), vol. 56, no. 1, pp. 12-19, 2018. Crossref, https://doi.org/10.14445/22315381/IJETT-V56P203

Abstract

This research discusses constrained consumable resource allocation problem in special kinds of GERT-type networks (GTN). The Networks have only EXCLUSIVE-OR, PROBABILISTIC nodes. They don’t have any loops. They have one source node and they can have more than one target nodes. Also, durations of activities are random variables with known probability density functions. A certain type of consumable resource is necessary for executing the activities. A new heuristic algorithm has been developed to achieve this purpose. Finally, three examples have been solved using the proposed method.

Keywords

constrained consumable resource allocation, GERT-type networks, Exclusive-or probabilistic.

References

[1] A.A.B Pritsker, W.W. Happ, “GERT: graphical evaluation and review technique, part I”, fundamentals. J Ind Eng., vol.17 (5), pp.267–274, 1966.
[2] S. S. Hashemin, and S. M. T. Fatemi Ghomi, “A hybrid method to find cumulative distribution function of completion time of GERT networks,” Journal of Industrial Engineering International., vol. 1, No. 1, pp. 1-9, 2005.
[3] S. S. Hashemin, “Fuzzy completion time for alternative stochastic networks,” Journal of Industrial Engineering International., vol. 6, No. 11, pp. 17-22, 2010.
[4] D. Golenko-Ginzburg and A. Gonik, “Stochastic network project scheduling with non-consumable limited resources,” International Journal of Production Economics., vol. 48, No. 1, pp. 29-37, 1997.
[5] D. Golenko-Ginzburg and A. Gonik, “A heuristic network project scheduling with random activity duration depending on the resource allocation”, International Journal of Production Economics., vol. 55, pp. 149-162, 1998.
[6] D. Golenko-Ginzburg, A. Gonik and S. Sitniakorsky, “Resource supportability model for stochastic network projects under a chance constraint,” Communication in Dependability and Quality Management., vol. 3, pp. 89-102, 2000.
[7] S. S. Hashemin, “A Heuristic for Constrained Consumable Resource Allocation in Alternative Stochastic Networks,” 4th International Conference of IranianOperations Research Society, pp. 1-2, 18-19 May. 2011.
[8] S. S. Hashemin and S. M. T. FatemiGhomi, “A multi objective model for Constrained Resource Allocation in GERT-type Networks,”5th Conference onAdvanced Engineering Design, Prague, Czech Republic, pp.1-9, 11-14 June. 2006.
[9] S. S. Hashemin and S. Eini, “ Combination of Dynamic Programming and Multi Objective Decision Making for Constrained Consumable Resource Allocation in Alternative Stochastic Networks,” 8th International Symposium of Statistics Anadolu University, Eskisehir, TURKEY., pp. 194-195, 11-13 October. 2012.
[10] S. S. Hashemin, “A Heuristic Method for Constrained Consumable Resource Allocation in Alternative Fuzzy Networks,” 12th International Symposium onEconometrics, Operations Research and Stortistics, Pamukkale University, Denizli,Turkey., pp. 1-11, 27 May. 2011.