TY - JOUR
T1 - Formation of manufacturing cell using queuing theory and considering reliability
TT -
JF - IUST
JO - IUST
VL - 27
IS - 2
UR - http://ijiepr.iust.ac.ir/article-1-666-en.html
Y1 - 2016
SP - 121
EP - 139
KW - Cell formation problem
KW - Queuing theory
KW - Particle swarm optimization algorithm
KW - Genetic
N2 - In this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. Since cell formation problem is NP-Hard, two algorithms based on genetic and modified particle swarm optimization (MPSO) algorithms are developed to solve the problem. For generating initial solutions in these algorithms, a new heuristic method is developed, which always creates feasible solutions. Moreover, full factorial and Taguchi methods are implemented to set crucial parameters in the solutions procedures. Deterministic method of branch and bound (B&B) algorithm is used to evaluate the results of modified particle swarm optimization algorithm and the genetic algorithm. The results indicate that proposed algorithms have better performance in quality of the metaheurstic algorithms final answer and solving time compared with the method of Lingo software’s B&B algorithm. The solution of two metaheurstic algorithms is compared by t test. Ultimately, the results of numerical examples indicate that considering reliability has significant effect on block structures of machine-part matrixes.
M3 10.22068/ijiepr.27.2.121
ER -