• Title/Summary/Keyword: machine cell

Search Result 423, Processing Time 0.026 seconds

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

Cell Formation Algorithm for the Maximum Number of Cell without Exceptional Element in FMS with Alternative Routings (대체 가공경로를 갖는 FMS에서 예외적 요소가 존재하지 않는 최대수의 셀 형성방법)

  • Lee, Young-Kwang;Yun, Chang-Won;Chung, Byung-Hee
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.20 no.2
    • /
    • pp.51-64
    • /
    • 1994
  • Cellular manufacturing requires formation of machine cells that can produce families of parts with similar processing requirement. The purpose of cell formation is to create separable machine clusters and part families simultaneously. However, the cell formation process often includes the identification of exceptional elements. This paper presents cell formation method under consideration of alternative routings in FMS which consists of machines capable of multi-processing and parts which require more than one operation. We suggest theorems to calculate the maximum number of machine cell and part family which have no exceptional elements. We also develop a cell formation algorithm which is based on the suggested theorem. A numerical example is provided to illustrate the proposed theorem and algorithm.

  • PDF

A Study on PC-NC based Machine Agent System (PC-NC기반 Machine Agent System에 관한 연구)

  • 정병수;강무진;정순철;배명한;김성환
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.10a
    • /
    • pp.636-640
    • /
    • 2002
  • In contrast to conventional CNC, PC-NC opens a new era for machine tools to be more intelligent. For instance, machine tool with PC-NC can be a machine agent system with capability of reacting autonomously to changing operating conditions. This paper introduces a concept of intelligent machine agent system, composed of machine agent and cell manager. Machine agent performs the functions such as process monitoring, diagnosis, maintenance management, condition assessment and schedule negotiation, while cell manager coordinates the negotiation process among multiple machine agents.

  • PDF

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.

A Machine Cell Formation Algorithm Using Network Partition (네트워크 분할 기법을 이용한 기계 그룹 형성 알고리즘)

  • Choi Seong-Hoon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.27 no.3
    • /
    • pp.106-112
    • /
    • 2004
  • This paper presents a new heuristic algorithm for the machine cell(MC) formation problem. MC formation problem is represented as an unbalanced k-way network partition and the proposed algorithm uses four stage-approach to solve the problem. Four stages are natural sub-network formation, determination of intial vertexes for each sub-network, determination of initial partition, and improvement of initial partition. Results of experiments show that the suggested algorithm provides near optimal solutions within very short computational time.

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

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

  • 최동순;정병희
    • Journal of Korean Society of 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

Group Technology Cell Formation Using Production Data-based P-median Model

  • Won Yu Gyeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.05a
    • /
    • pp.375-380
    • /
    • 2003
  • This study is concerned with the machine part grouping m cellular manufacturing. To group machines into the set of machine cells and parts into the set of part families, new p-median model considering the production data such as the operation sequences and production volumes for parts is proposed. Unlike existing p-median models relying on the classical binary part-machine incidence matrix which does not reflect the real production factors which seriously impact on machine-part grouping, the proposed p-median model reflects the production factors by adopting the new similarity coefficient based on the production data-based part-machine incidence matrix of which each non-binary entry indicates actual intra-cell or inter-cell flows to or from machines by parts. Computation test compares the proposed p median model favorably.

  • PDF

Machine-Part Group Formation Problem with the Number of Cells and Cell Size (기계셀의 수와 크기가 있는 기계-부품그룹 형성)

  • Kim, Yea-Geun;Oh, Gun- Chul
    • IE interfaces
    • /
    • v.2 no.2
    • /
    • pp.15-24
    • /
    • 1989
  • When we design, plan, and schedule for group technology, the limitation on the machine cells and cell size may occur. The purpose of this study is to find machine cells and part families to minimize the exceptional elements, constraining both the number of machine cells and the cell size. To solve this problem, the algorithm extending Kusiak's p-median method is proposed. In the proposed algorithm, the method finding initial solution and reducing the number of constraints is presented for computational efficiency. The proposed algorithm is evaluated and compared with well-known algorithms for machine-part group formation in terms of the exceptional elements. An example is shown to illustrate the proposed algorithm.

  • PDF

A Machine Cell and Part Family Formation Procedure in Considering the Duplication and Subcontracting (중복설계와 하청을 고려한 셀 및 부품군 형성 절차)

  • Mun, Chi-Ung;Kim, Hyo-Nam;Lee, Sang-Yong
    • Journal of Korean Society for Quality Management
    • /
    • v.21 no.2
    • /
    • pp.224-231
    • /
    • 1993
  • This paper propose a procedure to form the cell and part family using both of similarity coefficient method and mathematical programming in order to slove the exceptional part and bottleneck machine problems. In the procedure proposed by this paper, the machine duplication and subcontracting are considered to slove the bottleneck machine and intercellular moving part problems An example is given to show how this procedure works.

  • PDF