Search published articles

Showing 2 results for Saidi-Mehrabad

I. Mahdavi, M. M. Paydar, M. Solimanpur , M. Saidi-Mehrabad,
Volume 21, Issue 2 (IJIEPR 2010)

  This paper deals with the cellular manufacturing system (CMS) that is based on group technology concepts. CMS is defined as identifying the similar parts that are processed on the same machines and then grouping them as a cell. The most proposed models for solving CMS are focused on cell formation problem while machine layout is considered in few papers. This paper addresses a mathematical model for the joint problem of the cell formation problem and the machine layout. The objective is to minimize the total cost of inter-cell and intra-cell (forward and backward) movements and the investment cost of machines. This model has also considered the minimum utilization level of each cell to achieve the higher performance of cell utilization. Two examples from the literature are solved by the LINGO Software to validate and verify the proposed model.

Bahman Esmailnezhad, Mohammad Saidi-Mehrabad,
Volume 29, Issue 1 (IJIEPR 2018)

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.

Page 1 from 1     

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

Designed & Developed by : Yektaweb