• 대한산업공학회지
• /
• 제12권2호
• /
• pp.45-55
• /
• 1986

A method for forming production cells in cellular manufacturing systems is presented. The basic approach is based on part-machine group formation by using relationship matrix calculated from the original part-machine matrix. The cases of exceptional elements and bottleneck machines are discussed. The proposed method can work with any starting form of part-machine matrix and provides the same solution regardless of the changes of starting form of part-machine matrix for any given problem.

• 산업경영시스템학회지
• /
• 제18권34호
• /
• pp.123-128
• /
• 1995

The grouping of parts into families and machines into cells poses an important problem in the design and planning of the flexible manufacturing system(FMS). This paper proposes a new optimal algorithm of forming machine-part groups to maximize the similarity, based on branching from seed machine and bounding on a completed part. This algorithm is illustrated with numerical example. This algorithm could be applied to the generalized machine-part grouping problem.

• 대한산업공학회지
• /
• 제18권2호
• /
• pp.123-130
• /
• 1992

The group formation problem of the machine and part in Flexible Manufacturing System (FMS) is a very important issue in planning stage of FMS. This paper discusses the problem of machine-part group formation. The purpose of the study is to develop a heuristic algorithm, which can handle more realistic machine-part group formation problem by considering manufacturing factors. A new similarity coeffecient has been developed to solve more realistic machine-part group formation problem. For the purpose of illustations, a numerical example is presented.

• 대한산업공학회지
• /
• 제31권1호
• /
• pp.20-26
• /
• 2005

This paper proposes the heuristic algorithm for the generalized GT problems to consider the restrictions which are given the number of machine cell and maximum number of machines in machine cell as well as minimum number of machines in machine cell. This approach is split into two phase. In the first phase, we use the similarity coefficient which proposes and calculates the similarity values about each pair of all machines and sort these values descending order. If we have a machine pair which has the largest similarity coefficient and adheres strictly to the constraint about birds of a different feather (BODF) in a machine cell, then we assign the machine to the machine cell. In the second phase, we assign parts into machine cell with the smallest number of exceptional elements. The results give a machine-part grouping. The proposed algorithm is compared to the Modified p-median model for machine-part grouping.

• 산업경영시스템학회지
• /
• 제19권37호
• /
• pp.1-7
• /
• 1996

The grouping of parts into families and machines into cells poses an important problem for the improvement of productivity and quality in the design and planning of the flexible manufacturing system(FMS). This paper proposes a new algorithm of forming machine-part groups in case of the bottleneck machine problem and shows the numerical example. This algorithm could be applied to the large scale machine-part grouping problem.

• 경영과학
• /
• 제12권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.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.656-658
• /
• 2006

This study deals with the part-machine grouping (PMG) that considers realistic manufacturing factors, such as the machine duplication, operation sequences with multiple visits to the same machine, and production volumes of parts. Basically, this study is an extension of Won(2006) that has adopted fuzzy ART neural network to group parts and machines. The proposed fuzzy ART neural network algorithm is implemented with an ancillary procedure to enhance the block diagonal solution by rearranging the order of input presentation. Computational experiments applied to large-size PMG data sets with a psuedo-replicated clustering procedure show effectiveness of the proposed approach.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• 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.

• 한국정밀공학회지
• /
• 제18권5호
• /
• pp.177-185
• /
• 2001

This paper describes a machine-vision-based prototype system for automatically feeding engine-mount parts to a swaging machine which assembles engine mounts. The system developed consists of a robot, a feeding device with two cylinders and two photo sensors, and a machine vision system. The machine vision system recognizes the type of different parts being fed from the feeding device and estimates the angular difference between the inner-hole center of the part and the point predetermined for assembling. The robot then picks up each part and rotated it through the estimated angle such that the parts are well assembled together as specified. An algorithm has been developed to recognize different part types and estimate the angular difference. The test results obtained for a set of real specimens indicate that the algorithm performs well enough to be applied to prototype system.

• 대한산업공학회지
• /
• 제22권4호
• /
• pp.705-718
• /
• 1996

A similarity coefficient based algorithm is proposed to solve the machine cells and part families formation problem in group technology. Similarity coefficients are newly designed from the machine-part incidence matrix. Machine cells are formed using a recurrent neural network in which the similarity coefficients are used as connection weights between processing units. Then parts are assigned to complete the cell composition. The proposed algorithm is applied to 30 different kinds of problems appeared in the literature. The results are compared to those by the GRAFICS algorithm in terms of the grouping efficiency and efficacy.