Study of buffer effects on the grouping efficacy measure of stochastic cell formation problem

This paper deals the stochastic cell formation problem (scfp). the paper presents a new nonlinear integer programming model for the scfp in which the effect of buffer size on the grouping efficacy of cells has been investigated. the objective function is the maximization of the grouping efficacy of cells. a chance constraint is applied to explore the effect of buffer on the scfp. processing time and arrival time of the part for each cell are considered stochastic and are following exponential probability distribution. to find out the optimal solution in a reasonable time, a heuristic approach is used to linearize the proposed nonlinear model. this problem has been known as an np-hard problem. therefore, two metaheuristic methods, namely; genetic algorithm and particle swarm optimization are employed to solve examples. the parameters of the algorithms are calibrated using taguchi and full factorial methods, and the performances of the algorithms on the examples of various sizes are analyzed against global solutions obtained from lingo software’s branch and bound (b&b) in terms of quality of solutions and computational time.