• 산업공학
• /
• 제14권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.

• 산업경영시스템학회지
• /
• 제19권39호
• /
• pp.63-73
• /
• 1996

With the success of flexible manufacturing systems (FMSs), flexible assembly systems (FASs) have been developed to automate factories further. As in a cellular FMS, a cellular FAS is considered as the most flexible and feasible assembly system configuration Because of the differences between manufacturing and assembly operation, the logic of cell formation and cell layout between a FMS and a FAS is not the same. Since the time for assembly operation is usually relatively short, the transfer time is thus very crucial for the performance of assembly systems. Therefore in assembly systems it is important to reduce the transfer time by sequencing operations efficiently and arranging machines like the sequences. The network-type layout is not only feasible for the machine arrangement based on operation sequences, but it has also layout flexibility. Therefore it is a reasonable layout configuration for cellular FASs. This paper presents a method for the cell layout based on the network-type layout in a cellular FAS design.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.63-73
• /
• 1998

With the success of flexible manufacturing systems(FMSs), flexible assembly systems(FASs) have been developed to automatic factories further. As in a cellular FMS, a celluar FAS is considered as the most flexible and feasible assembly systems configuration. This paper presents a method for the integrated layout design in cellular FASs. Unlike the traditional paper, this paper deals with the formation of cells and the layout of cells for jobs with operation times on different machines. The procedure in this paper consists of two distinct phases. The first phase presents machine arrangement in a double rows flowline. cell formation not to allow intercellular movements, and integrated layout design in cellular FASs considering the characteristics of FAS, layout, and production factors This phase uses older optimal algorithm. The second phase proposes to balance the system with an objective of reducing the degree of workload deviation in the cells. Simulated annealing method is used to balance the system. This phase also shows the integrated layout design in cellular FASs with the cost less than total cost of the first phase.

• 한국정밀공학회지
• /
• 제16권6호
• /
• pp.197-208
• /
• 1999

This paper presents an operation sequence-based approach for determining machine cell layout in a cellular manufacturing environment. The proposed model considers the sequence of operations in evaluating the intercell and intracell movements. In this paper, design of cellular layout has an objective of minimization of total material flow among facilities, where the total material flow is defined as a weighted sum of both intercell and intracell part movements. The proposed algorithm is developed by using genetic algorithm and can be used to design an optimal cellular layout which can cope with changes of shop floor situation by considering constraints such as the number of machine cells and the number of machines in a machine cell.

• 한국경영과학회지
• /
• 제22권4호
• /
• pp.133-149
• /
• 1997

The major two steps required to design a cellular layout are cell formation and cell layout. Because of the differences between manufacturing and assembly operations, the logic of cell formation and cell layout between an FMS and an FAS is not the same. Since the time for the assembly operations is usualaly relatively short, the transfer time is thus very crucial for the performance of assembly systems. Transfore in a cellular FAS it is more important to eliminate backtracking operations in assembly planning, not to allow intercellular movements in cell formation, and to arrange machines according to assembly sequence in cell layout. This study presents a method for the integrated layout design in cellular FASs considering the characteristics of FAS, layout, and production factors.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 추계학술대회 논문집
• /
• pp.334-338
• /
• 2000

One of the major drawbacks of the existing facility layout methods is that most of them were developed based on pre-defined cost functions, and therefore fail to cope with the dynamic aspects of modern manufacturing systems. Another drawback is that due to the poor representation capability of the block diagrams, they are not able to convey the sufficient information needed by facility designers. In this paper, a system for solving facility layout problem considering these matters in cellular manufacturing environment is proposed and implemented using GA approach with embedded simulation module and virtual reality technologies.

• 한국시뮬레이션학회논문지
• /
• 제4권1호
• /
• pp.75-86
• /
• 1995

There has been a great deal of interest in the area of group technology recently. They suggest that group technology's formation of cells of machines which are dedicated to production of families of parts will bring many of the advantages of cellular layout of job shops. In this context, Yoon [2] designed and suggested 3 types of the layout structure for a small firm, by introducing the cellular layout into the traditional flow line of an existing factory. Also he found that P5C, i.e. process layout /5 cells layout, outperformed the rest types. However, he performed the experiments in the standpoint of the existing factory operation and did not consider other operating methods including changing the dispatching and sequencing rules. Therefore, in this paper, we compared the performance of 3 different layout by the simulation technique using the real data from the existing factory, considering a newly suggested dispatching and machine selection rule.

• 한국컴퓨터정보학회논문지
• /
• 제21권4호
• /
• pp.47-54
• /
• 2016

Cellular formation and layout problem has been known as a NP-hard problem. Because of the algorithm that can be solved exact solution within polynomial time has been unknown yet. This paper suggests a systematic method to be obtain of 2-degree partial directed path from the frequency of consecutive forward order. We apply the modified Kruskal algorithm of minimum spanning tree to be obtain the partial directed path. the proposed reverse constructive algorithm can be solved for this problem with O(mn) time complexity. This algorithm performs same as best known result of heuristic and metaheuristic methods for 4 experimental data.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.121-124
• /
• 1996

In general, cellular manufacturing system can be constructed by the following two steps. The first step forms machine cells and part families, and the second step determines cell layout based on the result of first step. Cell layout has to be considered when cell is formed becauese the result of cell formation affects it. This paper presents a cell formation algorithm and proposes an integrated mathematical model for cell formation and cell layout. The cell formation algorithm minimizes the number of exceptional element in cellular manufacturing system. New concept for similarity and incapability is introduced, based on machine-operation incidence matrix and part-operation incidence matrix. One is similarity between the machines, the other is similarity between preliminary machine cells and machines. The incapability identifies relations between machine cells and parts. In this procedure, only parts without an exceptional element are assigned to machine cell. Bottleneck parts are considered with cell layout design in an integrated mathematical model. The integrated mathematical model determines cell layout and assigns bottleneck parts to minimize the number of exceptional element and intercell moving distance, based on linearixed 0-1 integer programming. The proposed algorithm is illustrated by using numerical examples.

• Advances in Computational Design
• /
• 제3권1호
• /
• pp.35-47
• /
• 2018

Design of settlement space is a complicated process while reasonable spatial layout bears great significance on the development and resource allocation of a settlement. The study proposes a weighted L-system generation algorithm based on CA (Cellular Automation) model which tags the spatial attributes of cells through changes in their state during the evolution of CA and thus identifies the spatial growth mode of a settlement. The entrance area of the Caidian Botanical and Animal Garden is used a case study for the model. A design method is proposed which starts from the internal logics of spatial generation, explores possibility of spatial rules and realizes the quantitative analysis and dynamic control of the design process. Taking a top-down approach, the design method takes into account the site information, studies the spatial generation mechanism of settlements and further presents a engine for the generation of multiple layout proposals based on different rules. A optimal solution is acquired using GA (Genetic Algorithm) which generates a settlement spatial layout carrying site information and dynamically linked to the surround environment. The study aims to propose a design method to optimize the spatial layout of the complex settlement system based on parametric generation.