Critical path method is used to estimate the duration of the critical path in a network of activities. The critical path denotes the longest path taken by the activities to complete,therefore it gives the maximum duration of the project of which the network diagram is made. In this paper,we aim to replace the typical traditional critical path method by a modified Dijkstra’s Algorithm,to find the critical path. The proposed method involves the computation of a critical path without iterative calculations and is less time consuming. The proposed method is efficient as it provides the optimum critical path in all cases. The paper introduces a new method to find a critical path. The paper elucidates the critical path method and the modified Dijkstra’s algorithm. © 2016,International Journal of Pharmacy and Technology. All rights reserved.