Search published articles


Showing 2 results for Longest Path

A. Azaron , S.m. Fatemi Ghomi,
Volume 18, Issue 3 (11-2007)
Abstract

Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in accordance with the independent semi-Markov processes over the planning horizon. By using the stochastic dynamic programming, we find a dynamic path with maximum expected length from the source node to the sink node of the stochastic dynamic network. The expected value of such path can be considered as an approximation for the mean project completion time in the original dynamic PERT network.

 


Mohmmad Anvar Adibhesami, Ahmad Ekhlassi, Ali Mohammad Mosadeghrad, Amirhossein Mohebifar,
Volume 30, Issue 2 (6-2019)
Abstract

The CPM (critical path method) technique is to search out the longest path to try and do activities, so as to compress and cut back the time it takes for a project, which finally ends up inside the creation of an identical and intensive network of activities inside the targeted work. This formal random simulation study has been recognized as a remedy for the shortcomings that are inherent to the classic critical path technique (CPM) project analysis. Considering the importance of time, the cost of activities within the network, and rising the calculation of the critical path during this study, Critical Path technique has been applied to improve critical routing intelligence. This study, by simulating and analyzing dragonfly's splotched and regular patterns, has obtained the precise algorithm of attainable paths with the smallest amount cost and time for every activity. This has been done to put down the restrictions and enhance the computing potency of classic CPM analysis. The simulation results of using Dragonfly Algorithm (DA) in CPM, show the longest path in shortest time with the lowest cost. This new answer to CPM network analysis can provide project management with a convenient tool.
 

Page 1 from 1     

© 2020 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb