ISSN: 2226-3624
Open access
The objective of this paper is to calculate the completion time of various network paths according to which project completion time could be calculated. Critical Path Method (CPM) is used to determine project completion time if the time to conduct activities is definite. But if time of conducting activities is probable, Program Evaluation and Review Technique (PERT) method must be used and if occurring activities is possible, Graphical Evaluation and Review Technique (GERT) method should be applied. The current project control software usually cannot perform calculations for the last two states. Moreover, using manual methods is impossible if the network is composed of several activities. Thus applying the simulation approach is an appropriate method in such states. Simulation is used as a strong tool to analyze systems because it has a close relationship with real systems and considers many complicated relations in them.
It is intended to determine project completion time and critical path in this survey given that time of activities is probable and each activity is the prerequisite to another. ARENA software has been used to do so which is based on simulation method.
Debels. D, Reyck. B.D, a hybrid scatter search electromagnetism meta- heuristic for project scheduling, European Journal of Operation Research, 623- 637, 2006.
Zhang. H, Li. H, particle swarm optimization for source constrained project scheduling, International Journal of Project Management, 83- 92, 2006.
Jaboui. B, Damak. N, a combinatorial particle swarm optimization for solving multi- mode source constrained project scheduling problems, Applied Mathematics and Computation, 299- 308, 2008.
Yamashita. D, Armentano. V, scatter search for project scheduling with resource availability cost, European Journal of Operation Research, 623- 637, 2006.
Rabbani. M, Fatemi ghomi. S.M.T, a new heuristic for source constrained project scheduling in stochastic networks using critical chain concept, European Journal of Operation Research, 794- 808,2007.
Azaron. A, Fatemi ghomi. S.M.T, lower bound for the mean project completion time in dynamic PERT network, European Journal of Operation Research, 2007.
Long. L, Ohsato. A, fuzzy critical chain method project scheduling under source constraints and uncertainty, International Journal of Project Management, 2007.
Trietsch. D, Mazmanyan. L, Gevorgyan. L, Baker. K, modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation, European Journal of Operation Research, 386-396, 2012.
Maccrimmon. K. R, Ryavec. C. A. an analytical study on the PERT assumptions, Opration. Research, 16- 37, 1964.
Golenko-Ginzburg, D. On the distribution of activity time in PERT. Opration. Research, 767- 771, 1988.
(Jafarnejad et al., 2013)
Jafarnejad, A., Davoodi, S. M. R., & Abtahi, S. M. (2013). Calculation of Project Scheduling in Stochastic Networks. International Journal of Academic Research in Economics and Management Sciences, 2(6), 109–116.
Copyright: © 2018 The Author(s)
Published by Human Resource Management Academic Research Society (www.hrmars.com)
This article is published under the Creative Commons Attribution (CC BY 4.0) license. Anyone may reproduce, distribute, translate and create derivative works of this article (for both commercial and non-commercial purposes), subject to full attribution to the original publication and authors. The full terms of this license may be seen at: http://creativecommons.org/licences/by/4.0/legalcode