Keywords:-
Article Content:-
Abstract
Network techniques are often used in scheduling projects that contain many interrelated activities. One approach that has been widely used is the Critical Path Method(CPM), in which a network diagram depicts precedence among activities. In the CPM, such as three parameters earliest event time, latest event time and
slack time are used to determine each of the critical activities. This paper also deals with the methodology to find the critical path using modified Dijkstra’s algorithm, Floyd Warshall’s algorithm and Bellman Ford algorithm. In addition to critical path problem formulated as a Linear Programming Problem (LPP), it was
also solved using binary integer (0-1) programming formulation. Further, dual of the linear programming is used to determine the critical path as well as critical distance. Finally, these algorithms were executed using matlab software.
References:-
References
Ahuja H.N, Dozzi S.P, and Abourizk S.M,1994. Project Management, New York: Wiley.
Dijkstra, E. W., 1959. A note on two problems in connection with graphs. Numerische Mathematik 1: p269-
Dr. Roopa K.M, Apoorva H.R., Srinivasu V.K. and Vishwanath M.C, 2013. A Study on Different Algorithm for
shortest Route Problem. IJERT, 2(9): P422-434.Hemalatha S and Valsalal P, 2012. Identification of Optimal Path in Power System Network Using Bellman
Ford Algorithm. Hindawi Publishing Corporation, Modelling and Simulation in Engineering,Article ID 913485.
Ravi Shankar N and Sireesha, 2010. Using modified Dijkstra’s Algorithm for Critical Path Method in a Project
Network. IJCAM, 5 (2) : p.217-225.
Sohana, J, and Sajid, H, Md, 2011. A Comparitive Study on Algorithms for Shortest- Route Problem and
some Extensions. International journal of Basic and Applied Sciences. 11(6): p167-177
Stevenson W.J, 2002. Operation Management, seventh edition, McGraw-Hill.
Taha H A, 2003. Operations Research: An Introduction, (Seventh Edition), Prentice Hall.