• 산업경영시스템학회지
• /
• 제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.

• Industrial Engineering and Management Systems
• /
• 제7권2호
• /
• pp.160-170
• /
• 2008

This paper proposes a mathematical model for converting conveyor assembly line to cellular manufacturing in complex production environments. Complex production environments refer to the situations with multi-products, variant demand, different batch sizes and the worker abilities varying with work stations and products respectively. The model proposed in this paper aims to determine (1) how many cells should be formatted; (2) how many workers should be assigned in each cell; (3) and how many workers should be rested in shortened conveyor line when a conveyor assembly line should be converted, in order to optimize system performances which are defined as the total throughput time and total labor power. We refer the model to a new production system. Such model can be used as an evaluation tool in the cases of (i) when a company wants to change its production system (usually a belt conveyor line) to a new one (including cell manufacturing); (ii) when a company wants to evaluate the performance of its converted system. Simulation experiments based on the data collected from the previous documents are used to estimate the marginal impact that each factor change has had on the estimated performance improvement resulting from the conversion.

• 한국시뮬레이션학회논문지
• /
• 제22권2호
• /
• pp.93-100
• /
• 2013

다품종 소량생산이 보편화 되면서 하나의 생산라인에서 여러 종류의 제품을 교대로 생산하는 혼류생산방식이 보편화 되었다. 하지만 흐름라인 방식의 혼류생산에서는 필연적으로 작업장 간의 공정시간 불균형이 존재한다. 따라서 이러한 공정불균형에 의한 대기의 낭비를 최소화하기 위하여 기존의 흐름생산방식에서 셀생산방식으로 전환하는 시도가 빈번하게 발생한다. 본 논문에서는 굴삭기 부품을 생산하는 혼류흐름라인 방식의 자동화 로봇 용접라인을 FMC 개념의 직선형 셀방식으로 전환하는 과정에서 타당성 검토를 위해 시뮬레이션을 수행한 사례연구 결과를 소개한다. 분석결과 26.7%의 생산량 증가와 55% 이상의 리드타임 감소효과가 예상되었다. 또한 향후 제품 생산비율의 변화에 따른 민감도분석을 수행하였다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 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.

• 한국생산제조학회지
• /
• 제23권6호
• /
• pp.580-589
• /
• 2014

Demands for automation in the cell production process of IT products are becoming increasingly sophisticated. In particular, the dual-arm robot has drawn attention as a solution because it has a flexibility and works similarly to humans. In this paper, we propose an automation system for cellular phone packing processes using two dual-arm robots. Applied robots are designed with specifications to meet the requirements of cellular phone packing jobs. In addition, a robotic cell production system is proposed by applying a method of task allocation for efficient packing of cellular phones. Specifically, a task is assigned to reduce takt-time and to avoid collision between two robots. Finally, we discuss some experimental results that include the packing job of five unit boxes with seven kinds of accessories.

• 대한산업공학회지
• /
• 제24권4호
• /
• pp.559-569
• /
• 1998

Cellular manufacturing system (CMS) has been recognized as an alternative to improve manufacturing productivity in conventional batch-type manufacturing systems through reducing set-up times, work-in-process inventories and throughput times by means of group technology. Most of the studies on the design of CMS assumed that each part has a unique process plan, and that its demand is known as a deterministic value despite of the probabilistic nature of the real world problems. This study suggests an approach for designing CMS, considering both alternative process plans and uncertain demand. A mathematical model is presented to show how to minimize the expected amortized and operating costs satisfying these two relaxations. Four heuristic algorithms are developed based on tabu search which is well suited for getting an optimal or near-optimal solution. Example problems are carried out to illustrate the heuristic algorithms and each of them is compared with the deterministic counterpart.

• 산업경영시스템학회지
• /
• 제23권61호
• /
• pp.137-146
• /
• 2000

One of the problems faced in implementing cellular manufacturing systems is machine-part group formation. This paper proposes machine-part grouping algorithms based on Self-Organizing Map(SOM) neural networks and K-Means algorithm in cellular manufacturing systems. Although the SOM spreads out input vectors to output vectors in the order of similarity, it does not always find the optimal solution. We rearrange the input vectors using SOM and determine the number of groups. In order to find the number of groups and grouping efficacy, we iterate K-Means algorithm changing k until we cannot obtain better solution. The results of using the proposed approach are compared to the best solutions reported in literature. The computational results show that the proposed approach provides a powerful means of solving the machine-part grouping problem. The proposed algorithm Is applied by simple calculation, so it can be for designer to change production constraints.

• 산업경영시스템학회지
• /
• 제22권49호
• /
• pp.67-76
• /
• 1999

This research presents the relationship among machining time, cycle time and demand rate in a cellular manufacturing system. The manufacturing cell produces part families by automated machines. This paper discusses the cases of increasing demand rate in an existing cell and designing cell based on the demand rate. This research developed an algorithm for decision making such as cycle time, machines and workers in order to minimize the total machine capacity and the number of workers for any given demand rate. The proposed algorithm was successfully applied for the design and operation of cell manufacturing with a good result.

• 경영과학
• /
• 제16권1호
• /
• pp.173-186
• /
• 1999

Recently many firms are introducing the cellular manufacturing system(CMS) as a means of achieving manufacturing efficiencies. However, most of the research on CMS was mainly for determining the cell formation problems. Since the goal of the CMS is not only a increase production efficiencies, but also to enhance the competitive stength of a firm, it would be reasonable to assume CMS as a business reengineering module rather than an independent technique. The purpose of this study is to align the CMS with reengineering, to present an integrated methodology for constructing the CMS, and to apply the CMS to a firm and verify it. The paper concludes with a brief description of the lessons learend by the CMS project and the limitations of the research are described.

• 산업공학
• /
• 제10권3호
• /
• pp.189-196
• /
• 1997

This paper presents a cell formation approach for a cellular manufacturing system to minimize the inter-cell moves considering operation sequences. Two new factors are introduced: (1)flow-similarity(FS) for integrating direct/indirect inter-machine flow and similarity (2)machine cell-part moves (CPM) for exactly computing inter-cell moves. FS is used for combining machines and CPM is used for assigning the parts to the preliminary machine cells. In addition, we develop an aggregated heuristic algorithm to form manufacturing machine cells and assign the parts to those cells based on these concepts. We use performance criterion called total inter-cell moves(TICM), which is the total material flow between internal cells and external cells. Results of computational tests on a number of randomly generated test problems show that the suggested heuristic is superior to existing methods.