Cellular manufacturing layout design using heuristic clustering algorithm and optimization model

Abstract

The presented mathematical model is used to form machine cells, optimize costs of exceptional elements and design the shop floor layout for various demands of components. The proposed complete similarity measure is attained this complete state from the simple form through the developed similarity measure. This complete similarity measure is used in the proposed Pragmatic Algorithm of a Resumptive Inline (PARI) clustering model which forms machine cells and part families in a refined form. newlineThe exceptional elements are eliminated in the linear programming optimization model by machine duplication and part subcontract. This mathematical model consists of novel objective function and constraints which are formed to optimize exceptional elements costs such as machine duplication costs, parts subcontract costs and costs of inter intracellular movements. This optimization model is developed to overcome the logical methodology which is followed earlier to process exceptional elements by machine duplication alone. newlineThe shop floor layout is designed to have optimized material movements between cells and within a cell. The cell demand is calculated for each of the machine cells and machine demand is calculated for each machine in the cells. These demands determine the size of workstations in the cells. The dimensions of each cell are calculated. The two-dimensional shop floor layouts are plotted for all the benchmark problems with the help of cell dimensions, relative aisle passage sizes. The distance matrix is formed concerning the origin and material movement lengths, floor area are determined with the help of this distance matrix for all the solved bench work problems. newline