Mahdi Karbasian, Batool Mohebi, Bijan Khayambashi, Mohsen Chesh Berah, Mehdi Moradi,
Volume 26, Issue 4 (IJIEPR 2015)
Abstract
The present paper aims to investigate the effects of modularity and the layout of subsystems and parts of a complex system on its maintainability. For this purpose, four objective functions have been considered simultaneously: I) maximizing the level of accordance between system design and optimum modularity design,II) maximizing the level of accessibility and the maintenance space required,III) maximizing the providing of distance requirement and IV) minimizing the layout space. The first objective function has been put forward for the first time in the present paper and in it, the optimum system modularity design was determined using the Design Structure Matrix (DSM) technique.The second objective function is combined with the concept of Level of Repair Analysis (LoRA) and developed. Simultaneous optimization of the above-mentioned objective functions has not been considered in previous studies. The multi objective problem which has been put forward was applied on a laser range finder containing 17 subsystems and the modularity and optimum layout was determined using a multi objective particle swarm optimization (MOPSO) algorithm.
![\"AWT](\"./files/site1/images/4.png\")
Mohmmad Anvar Adibhesami, Ahmad Ekhlassi, Ali Mohammad Mosadeghrad, Amirhossein Mohebifar,
Volume 30, Issue 2 (IJIEPR 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.
