• Title/Summary/Keyword: machine-cell formation

Search Result 64, Processing Time 0.026 seconds

Cluster Analysis-based Approach for Manufacturing Cell Formation (제조 셀 구현을 위한 군집분석 기반 방법론)

  • Shim, Young Hak;Hwang, Jung Yoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.1
    • /
    • pp.24-35
    • /
    • 2013
  • A cell formation approach based on cluster analysis is developed for the configuration of manufacturing cells. Cell formation, which is to group machines and parts into machine cells and the associated part families, is implemented to add the flexibility and efficiency to manufacturing systems. In order to develop an efficient clustering procedure, this paper proposes a cluster analysis-based approach developed by incorporating and modifying two cluster analysis methods, a hierarchical clustering and a non-hierarchical clustering method. The objective of the proposed approach is to minimize intercellular movements and maximize the machine utilization within clusters. The proposed approach is tested on the cell formation problems and is compared with other well-known methodologies available in the literature. The result shows that the proposed approach is efficient enough to yield a good quality solution no matter what the difficulty of data sets is, ill or well-structured.

An Optimal Solution of Machine Cell Formation Problem (기계 그룹 형성 문제의 최적해)

  • Choi Seong-Hoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.27 no.3
    • /
    • pp.7-13
    • /
    • 2004
  • In this paper, machine cell formation problem is discussed. To reflect precisely actual manufacturing situations such as routing sequences, production quantities, and machining (or operation) characteristics, a new network presentation (or the problem is proposed. It is formulated as a simple 0-1 quadratic programming model with linear constraints. Then, the model is converted into a 0-1 integer programming model using a variable transformation technique. Lastly, some computational results are presented.

Machine-Part Cell Formation by Competitive Learning Neural Network (경쟁 학습 신경회로망을 이용한 기계-부품군 형성에 관한 연구)

  • 이성도;노상도;이교일
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.04a
    • /
    • pp.432-437
    • /
    • 1997
  • In this paper, Fuzzy ART which is one of the competitive learing neural networks is applied to machine-part cell formation problem. A large matrix and varios types of machine-part incidence matrices, especially including bottle-neck machines, bottle-neck parts, parts shared by several cells, and machines shared by several cells are used to test the performannce of Fuzzy ART neural network as a cell formation algorithm. The result shows Fuzzy ART neral network can be efficiently applied to machine-part cell formation problem which are large, and/or have much imperfection as exceptions, bottle-neck machines, and bottle-neck parts.

  • PDF

Design of Manufacturing Cell and Cellular Layout based on Genetic Algorithm (유전 알고리듬에 기초한 제조셀과 셀 배치의 설계)

  • Cho, Kyu-Kab;Lee, Byung-Uk
    • IE interfaces
    • /
    • v.14 no.1
    • /
    • pp.20-29
    • /
    • 2001
  • This paper presents a concurrent design approach that deals with manufacturing cell formation and cellular layout in Cellular Manufacturing System. Manufacturing cell formation is to group machines into machine cells dedicated to manufacture of part families, and cellular layout problem determines layout of the manufacturing cells within shop and layout of the machines within a cell. In this paper, a concurrent approach for design of machine cell and cellular layout is developed considering manufacturing parameters such as alternative process plans, alternative machines, production volume and processing time of part, and cost per unit time of operation. A mathematical model which minimizes total cost consisting of machine installation cost, machine operating cost, and intercell and intracell movements cost of part is proposed. A hybrid method based on genetic algorithm is proposed to solve the manufacturing cell formation and cellular layout design problem concurrently. The performance of the hybrid method is examined on several problems.

  • PDF

An Integrated Model for Simultaneous Formation of Machine Cells and Part Families in FMS : Using Machine- Operation Incidence Matrix and Part - Operation Incidence Matrix (FMS에서 기계셀과 부품그룹의 동시형성을 위한 통합모형 : 기계-공정 빈도행렬과 부품-공정 빈도행렬의 이용)

  • 정병희;윤창원
    • Korean Management Science Review
    • /
    • v.12 no.1
    • /
    • pp.1-17
    • /
    • 1995
  • The success of cell manufacturing applications in FMS rests on the effective cell formation to maintain the independent relations both between machine cells and between part families. This paper presents an integrated method for concurrent formation of cells and families with no E.E (Exceptional Element) in FMS with alternative routings. To determine the maximum number of cell and family with no E.E, mathematical conditions and properties are derived. New concept of nonsimilarity is introduced for each machine and part based on machine-operation incidence matrix and part-operation incidence matrix. To concurrently form the cells and families, integer programming based mathematical models are developed. For the predetermined number of cell or family, model I is used to identify whether E.E exists or not. Model II forms cells and families considering only nonsimilarity. But model III can consider nonsimilarity and processing times. The proposed method is tested and proved by using numerical examples.

  • PDF

A Study of Formation of Machine Cell-Part Family in FMS using the Simulated Annealing Algorithm (시뮬레이티드 어닐링 알고리즘을 이용한 유연생산시스템의 기계셀-부품군 형성에 관한 연구)

  • Kim, Jin-Yong;Park, Dae-Geuk;Oh, Byeong-Wan;Hong, Sung-Jo;Choi, Jin-Yeong
    • IE interfaces
    • /
    • v.10 no.2
    • /
    • pp.1-13
    • /
    • 1997
  • The problem of the formation of machine-part cells in FMS is a very important issue at the planning and operating stages of FMS. This problem is inherently a combinatorial optimization problem, proven to be NP-complete(or, NP-hard). Among the several kinds of approaches which have been applied to solve the combinatorial optimization problems, the Simulated Annealing(SA) algorithm, a technique of random search type with a flexibility in generating alternatives, is a powerful problem solving tool. In this paper, the SA algorithm is used to solve machine cell-part family formation problems. The primary purpose of the study is to find the near-optimal solution of machine cell-part family formation problem, whare the product volume and number of operations are prespecified, that can minimize the total material handling cost caused by exceptional elements and intercell moves as much as possible. The results show that the SA algorithm is able to find a near-optimal solution for practical problems of the machine cell-part family formation.

  • PDF

Operation-sequence-based Approach for Designing a U-shaped Independent-Cell System with Machine Requirement Incorporated (설비능력과 작업순서를 고려한 U-라인상에서의 셀 시스템 설계)

  • 박연기;성창섭;정병호
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.1
    • /
    • pp.71-85
    • /
    • 2001
  • This paper considers a cost model for a U-shaped manufacturing cell formation which incorporates a required number of machines and various material flows together under multi-part multi-cell environment. The model is required to satisfy both the specified operation sequence of each part and the total part demand volume, which are considered to derive material handling cost in U-shaped flow line cells. In the model several cost-incurring factors including set-up for batch change-over, processing time for operations of each part, and machine failures are also considered in association with processing load and capacity of each cell. Moreover, a heuristic for a good machine layout in each cell is newly proposed based on the material handling cost of each alternative sequence layout. These all are put together to present an efficient heuristic for the U-shaped independent-cell formation problem, numerical problems are solved to illustrate the algorithm.

  • PDF

The Machine-Part Group Formation for Minimizing the tool Exchange (공구 교체 횟수에서 최소로 하는 기계-부품그룹 형성)

  • 홍상우
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.21 no.45
    • /
    • pp.329-332
    • /
    • 1998
  • This Paper proposes a mathematical model to solve the cell formation problem with exceptional elements, Exceptional elements are bottleneck machines and exceptional parts that span two or more manufacturing cells. The model suggests whether it is cost-effective to eliminate an EE (by machine duplication or part subcontracting), or whether the intercellular transfer caused by the EE should remain in the cell formation. It provides an optimal solution for resolving the interaction created by EE in the initial cell formation solution. In addition, the model recognizes potentially advantageous mixed strategies ignored by previous approaches.

  • PDF

A Manufacturing Cell Formantion Algorithm Using Neural Networks (신경망을 이용한 제조셀 형성 알고리듬)

  • 이준한;김양렬
    • Korean Management Science Review
    • /
    • v.16 no.1
    • /
    • pp.157-171
    • /
    • 1999
  • In a increasingly competitive marketplace, the manufacturing companies have no choice but looking for ways to improve productivity to sustain their competitiveness and survive in the industry. Recently cellular manufacturing has been under discussion as an option to be easily implemented without burdensome capital investment. The objective of cellular manufacturing is to realize many aspects of efficiencies associated with mass production in the less repetitive job-shop production systems. The very first step for cellular manufacturing is to group the sets of parts having similar processing requirements into part families, and the equipment needed to process a particular part family into machine cells. The underlying problem to determine the part and machine assignments to each manufacturing cell is called the cell formation. The purpose of this study is to develop a clustering algorithm based on the neural network approach which overcomes the drawbacks of ART1 algorithm for cell formation problems. In this paper, a generalized learning vector quantization(GLVQ) algorithm was devised in order to transform a 0/1 part-machine assignment matrix into the matrix with diagonal blocks in such a way to increase clustering performance. Furthermore, an assignment problem model and a rearrangement procedure has been embedded to increase efficiency. The performance of the proposed algorithm has been evaluated using data sets adopted by prior studies on cell formation. The proposed algorithm dominates almost all the cell formation reported so far, based on the grouping index($\alpha$ = 0.2). Among 27 cell formation problems investigated, the result by the proposed algorithm was superior in 11, equal 15, and inferior only in 1.

  • PDF

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

  • 오수철;조규갑
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.122-129
    • /
    • 1995
  • 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 coefficients - Gupta and seifoddini's method and proposed method - is conducted. A software program using TURBO C has been developed to verify the implementation.

  • PDF