Design of Cellular Manufacturing Systems

1992 ◽  
Vol 114 (3) ◽  
pp. 352-361 ◽  
Author(s):  
S. A. Irani ◽  
P. H. Cohen ◽  
T. M. Cavalier

This paper describes a method for layout design of a Cellular Manufacturing System (CMS) that would allow simultaneously, the grouping of machines unique to a part family into cells and those shared by several cells to be located together in functional sections. Using an illustrative example, this integration of the flexibility of a functional layout, the reduced handling gained from cell formation and allowance of limited intercell flows among adjacent cells is described. Thereby, the traditional strategy of simultaneous formation of part families and distribution of machines into independent cells which creates machine distribution and unbalanced utilization problems is avoided. This is justified by an analysis of the complex interactions between the critical subproblems in cell formation—machine grouping, part family formation, distribution and utilization of shared machines, intracell layout, intercell (or shop) layout and material handling. This approach represents a new direction in cell formation where, by allowing the handling function to limit the extent of machine duplication between adjacent cells, a new graph theoretic structure for simultaneous machine grouping and layout design was developed and validated.

Author(s):  
Amin Rezaeipanah ◽  
Musa Mojarad

This paper presents a new, bi-criteria mixed-integer programming model for scheduling cells and pieces within each cell in a manufacturing cellular system. The objective of this model is to minimize the makespan and inter-cell movements simultaneously, while considering sequence-dependent cell setup times. In the CMS design and planning, three main steps must be considered, namely cell formation (i.e., piece families and machine grouping), inter and intra-cell layouts, and scheduling issue. Due to the fact that the Cellular Manufacturing Systems (CMS) problem is NP-Hard, a Genetic Algorithm (GA) as an efficient meta-heuristic method is proposed to solve such a hard problem. Finally, a number of test problems are solved to show the efficiency of the proposed GA and the related computational results are compared with the results obtained by the use of an optimization tool.


Author(s):  
G V Songore ◽  
V Songore

Several techniques have appeared in the literature for the cell formation problem. However, most of these heuristics have the disadvantages that they cannot solve real-life problems typical of manufacturing firms in reasonable computational time, and deal with the part family formation and cell grouping problems separately. The Tabu search meta-heuristic is presented for resolving these problems. The minimization of intercellular movements as an objective function is demonstrated, although minimization of cell load variation and the multiobjective function option exist in the procedure developed. The results discussed for some problems taken from the literature show that the Tabu search is a promising technique for solving the cellular manufacturing systems design problem for both medium and large problem instances.


2013 ◽  
Vol 30 (04) ◽  
pp. 1350004 ◽  
Author(s):  
REZA KIA ◽  
NIKBAKHSH JAVADIAN ◽  
MOHAMMAD MAHDI PAYDAR ◽  
MOHAMMAD SAIDI-MEHRABAD

This paper develops a novel mixed integer nonlinear programming model for the intra-cell layout design of dynamic cellular manufacturing systems. In dynamic environment, the product mix and part demand are varying during a multi-period planning horizon. As a result, the cell configuration for one period may not be efficient for successive periods and thus necessitates reconfigurations. The proposed model incorporates several design features including intra-cell layout, operation sequence, operation time, alternative process routings, duplicate machines, purchase machine, machine capacity, route selection, production volume of parts, part movements in batch and cell reconfiguration. By considering intra-cell layout and operation sequence, the material handling volume and related cost is calculated more exactly. The objective is to minimize the total costs of inter-cell material handling, forward and backward intra-cell material handling, setting up route, machine relocation, purchasing new machines, machine overhead and machine processing. The main constraints are route selection among flexible routings, machine availability, cell size, machine time-capacity and machine location. The proposed model cannot be solved for large-sized problems optimally within a reasonable amount of computational time. Therefore, an efficient simulated annealing algorithm is developed to overcome NP-hardness of the proposed model.


10.6036/9997 ◽  
2021 ◽  
Vol 96 (5) ◽  
pp. 546-552
Author(s):  
NAGA-SAI-RAM GOPISETTI ◽  
MARIA LEONILDE ROCHA VARELA ◽  
JOSE MACHADO

Human cognition based procedures are promising approaches for solving different kind of problems, and this paper addresses the part family formation problem inspired by a human cognition procedure through a graph-based approach, drawing on pattern recognition. There are many algorithms which consider nature inspired models for solving a broad range of problem types. However, there is a noticeable existence of a gap in implementing models based on human cognition, which are generally characterized by “visual thinking”, rather than complex mathematical models. Hence, the natural power of reasoning - by detecting the patterns that mimic the natural human cognition - is used in this study as this paper is based on the partial implementation of graph theory in modelling and solving issues related to part machine grouping, regardless of their size. The obtained results have shown that most of the problems solved by using the proposed approach have provided interesting benchmark results when compared with previous results given by GRASP (Greedy Randomized Adaptive Search Procedure) heuristics. Keywords: Cellular manufacturing systems; part family formation; human cognition; inspection-based clustering.


2013 ◽  
Vol 51 (20) ◽  
pp. 6017-6044 ◽  
Author(s):  
Babak Javadi ◽  
Fariborz Jolai ◽  
Jannes Slomp ◽  
Masoud Rabbani ◽  
Reza Tavakkoli-Moghaddam

2016 ◽  
Vol 854 ◽  
pp. 121-126 ◽  
Author(s):  
M. Shunmuga Sundaram ◽  
V. Anbumalar ◽  
P. Anand ◽  
B. Aswinkumar

A Combined Algorithm is proposed to form the machine cell and part family identification in the cellular manufacturing system. In the first phase, part families identification, by using Rank Order Clustering (ROC) and Modified Single Linkage Clustering (MOD-SLC). In second phase, Machine cell formation, by using Rank Order Clustering (ROC) and Modified Single Linkage Clustering (MOD-SLC), which is to assign machines into machine cells to produce part families. The above Proposed method is tested by using standard problems and compared with other method results for the same standard problems. Grouping efficiency is one of the most widely used measures of quality for Cellular Manufacturing Systems.


Sign in / Sign up

Export Citation Format

Share Document