• Title, Summary, Keyword: Cell grouping

Search Result 75, Processing Time 0.048 seconds

A weighted similarity coefficient method for manufacturing cell formation (제조셀 형성을 위한 가중치 유사성계수 방법)

  • Oh, Soo-Cheol;Cho, Kyu-Kab
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.1
    • /
    • pp.141-154
    • /
    • 1996
  • This paper presents a similarity coefficient based approach to the problem of machine-part grouping for cellular manufacturing. The method uses relevant production data such as part type, production volume, routing sequence to make machine cells and part families for cell formation. A new similarity coefficient using weighted factors is introduced and an algorithm for formation of machine cells and part families is developed. A comparative study of two similarity coefficient methods, Gupta and Seifoddini's method and the proposed method, is conducted.

  • PDF

Parts grouping by a hierarchical divisive algorithm and machine cell formation (계층 분리 알고리즘에 의한 부품 그룹핑 및 셀 구성)

  • Lee, Choon-Shik;Hwang, Hark
    • 제어로봇시스템학회:학술대회논문집
    • /
    • /
    • pp.589-594
    • /
    • 1991
  • Group Technology (GT) is a technique for identifying and bringing together related or similar components in a production process in order to take advantage of their similarities by making use of, for example, the inherent economies of flow production methods. The process of identification, from large variety and total of components, of the part families requiring similar manufacturing operations and forming the associated groups of machines is referred as 'machine-component grouping'. First part of this paper is devoted to describing a hierarchical divisive algorithm based on graph theory to find the natural part families. The objective is to form components into part families such that the degree of inter-relations is high among components within the same part family and low between components of different part families. Second part of this paper focuses on establishing cell design procedures. The aim is to create cells in which the most expensive and important machines-called key machine - have a reasonably high utilization and the machines should be allocated to minimize the intercell movement of machine loads. To fulfil the above objectives, 0-1 integer programming model is developed and the solution procedures are found. Next an attempt is made to test the feasibility of the proposed method. Several different problems appearing in the literature are chosen and the results air briefly showed.

  • PDF

Performance Analysis of Output Queued Batcher-Banyan Switch for ATM Network (ATM 망에 적용 가능한 출력단 버퍼형 Batcher-Banyan 스위치의 성능분석)

  • Keol-Woo Yu;Kyou Ho Lee
    • Journal of the Korea Society for Simulation
    • /
    • v.8 no.4
    • /
    • pp.1-8
    • /
    • 1999
  • This paper proposes an ATM switch architecture called Output Queued Batcher-Banyan switch (OQBBS). It consists of a Sorting Module, Expanding Module, and Output Queueing Modules. The principles of channel grouping and output queueing are used to increase the maximum throughput of an ATM switch. One distinctive feature of the OQBBS is that multiple cells can be simultaneously delivered to their desired output. The switch architecture is shown to be modular and easily expandable. The performance of the OQBBS in terms of throughput, cell delays, and cell loss rate under uniform random traffic condition is evaluated by computer simulation. The throughput and the average cell delay are close to the ideal performance behavior of a fully connected output queued crossbar switch. It is also shown that the OQBBS meets the cell loss probability requirement of $10^{-6}$.

  • PDF

A New Approach for Manufacturing Cell Formation with Operation Sequences (가공순서가 주어진 새로운 제조셀 형성방법)

  • 최동순;정병희
    • Journal of the Society of Korea Industrial and Systems Engineering
    • /
    • v.21 no.46
    • /
    • pp.59-72
    • /
    • 1998
  • This study is concerned in manufacturing cell formation with operation sequences. Operation sequences must be reflected for manufacturing cell formation anyway, because the primary aim of cellular manufacturing system is to minimize the inter-cell flows, and inter-cell flows are differed by operation sequences. In this study we propose flow-similarity(FS) of reflecting both inter-machine similarity and direct/indirect flow, and then apply the modified P-median model for grouping machines. We also use machine cell-part handling frequency(CPH) so as to be assigned parts to the machine cells having the most CPH. We confirm this approach through an application example. The performance of this approach(FS-model) is evaluated and compared with P-median model and F-model through computational experiments.

  • PDF

Fuzzy ART Neural Network-based Approach to Recycling Cell Formation of Disposal Products (Fuzzy ART 신경망 기반 폐제품의 리싸이클링 셀 형성)

  • 서광규
    • Journal of the Korea Safety Management & Science
    • /
    • v.6 no.2
    • /
    • pp.187-197
    • /
    • 2004
  • The recycling cell formation problem means that disposal products are classified into recycling product families using group technology in their end-of-life phase. Disposal products have the uncertainties of product condition usage influences. Recycling cells are formed considering design, process and usage attributes. In this paper, a new approach for the design of cellular recycling system is proposed, which deals with the recycling cell formation and assignment of identical products concurrently. Fuzzy ART neural networks are applied to describe the condition of disposal product with the membership functions and to make recycling cell formation. The approach leads to cluster materials, components, and subassemblies for reuse or recycling and can evaluate the value at each cell of disposal products. Disposal refrigerators are shown as an example.

Characterizing the Independent Cells by Increasing Grouping Efficiency (그룹핑 효율증대를 위한 독립적 셀의 특성화)

  • Cho, Moon-Soo;Jeong, Byung-Hee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.26 no.1
    • /
    • pp.1-8
    • /
    • 2000
  • We extended a minimum spanning tree algorithm (Cho et al., 1997) by characterizing the mutually independent cells with maximizing the grouping efficiency referring to few propositions developed by Shu, 1990 in cellular manufacturing system. Each row of the machine-part incidence matrix is regarded as a node in a graph, and a distance function is defined for every pair of nodes. It shows that there are K mutually independent cells in the cellular manufacturing system if only if there are K-1 arcs of length 1 in the minimum spanning tree of the graph, and gives an effective policy for sub-cell formation from larger cells.

  • PDF

An integer programming model to generate part-machine families in a cellular manufacturing system (정수계획법에 의한 셀제조 시스템에 부품-기계군의 생성)

  • 양정문;문기주;김정자
    • Journal of the Society of Korea Industrial and Systems Engineering
    • /
    • v.19 no.38
    • /
    • pp.9-15
    • /
    • 1996
  • The purpose of this research is to develop a method for part-machine grouping subject to production and management constraints. In the proposed integer programming model, minimization of operating and material-handling costs are considered as an objective function. The model allows one to recognize the existing parts and machines into disaggregated cells. New constraints are introduced in the model to resolve unbalancing capacity and bottleneck problems. It is found that this approach could have a better flexibility on cell size design for mote alternatives than conventional methods. Experimental grouping and comparison studies with ROC algorithm are given for evaluation purposes.

  • PDF

Machine-Part Grouping Formation Using Grid Computing (그리드 컴퓨팅을 이용한 기계-부품 그룹 형성)

  • Lee, Jong-Sub;Kang, Maing-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.30 no.3
    • /
    • pp.175-180
    • /
    • 2004
  • The machine-part group formation is to group the sets of parts having similar processing requirements into part families, and the sets of machines needed to process a particular part family into machine cells using grid computing. It forms machine cells from the machine-part incidence matrix by means of Self-Organizing Maps(SOM) whose output layer is one-dimension and the number of output nodes is the twice as many as the number of input nodes in order to spread out the machine vectors. It generates machine-part group which are assigned to machine cells by means of the number of bottleneck machine with processing part. The proposed algorithm was tested on well-known machine-part grouping problems. The results of this computational study demonstrate the superiority of the proposed algorithm.

Cellular manufacturing system design with proper assignment of machines and parts

  • Won Yu Gyeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • /
    • pp.390-396
    • /
    • 2002
  • This study is concerned with the strict machine-cell and part-family grouping (MCPFG) in cellular manufacturing system design. Most of MCPFG methodologies often suffer from improper assignment of machines and parts in which exceptional machine has more common operations with machines in a cell other than its own cell and exceptional part has more operations through machines in a cell other than the cell corresponding to its own family. This results in the loss of similarity in part design or common setup of machines and the benefits from the conversion of job shop manufacturing into cellular manufacturing are lost. In this study, a two-phase methodology is proposed to find the machine-cells and part families under the strict constraints in which all machines and parts are assigned to its most proper cells and families. Test results with moderately medium-sized ill-structured MCPFG problems available from the literature show the substantial efficiency of the proposed approach.

  • PDF