• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.755-755
• /
• 1995

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
• /
• pp.265-268
• /
• 2004

기존의 셀형 제조시스템에 관한 연구는 부품과 기계간의 유사성(Similarity) ${\cdot}$ 분석하여 복잡하고 큰 규모로 인해 통제 및 조정이 매우 힘든 제조시스템을 최소의 물류비용을 갖는 개별 하부 제조 시스템(Manufacturing Cell). 그러나 이러한 연구는 설비의 비중이 큰 작업장에서 설비의 효율적인 활용을 목적으로 하는 방법론이기 때문에 전자제품 조립라인과 같이 설비보다 작업자의 비중이 더 큰 라인에서는 별도의 연구가 필요하다. 현실적으로 셀형 제조시스템을 도입하여 가시적인 성과를 거둔 사례는 전자제품 조립라인의 경우가 훨씬 많다. 본 연구에서는 전자제품 조립라인에서 적용할 수 있는 조립 셀의 개념을 확립하고 성공적인 조립 셀의 도입을 위한 방법론을 제시하고자 한다.

• 산업경영시스템학회지
• /
• 제28권2호
• /
• pp.94-100
• /
• 2005

This paper presents the application of integrated mathematical programming approach for the design of cellular manufacturing. The proposed approach is carried out in two phases The first phase concerning exceptional elements(EEs) in cell formation and the second phase facilities layout design. This paper considers the total costs of three important costs for (1) intercellular transfer (2) machine duplication and (3) subcontracting. One of Important issue is the calculation of the number of machines considering the maximum utilization of machines and the available capacity of a machines that can be transferred between cells. Facilities layout design is considered to reflect the real field data taking in to account the operational sequence of the parts to be manufactured. The model is formulated as mixed integer programming that is employed to find the optimal solution.

• 한국정밀공학회지
• /
• 제13권4호
• /
• pp.143-151
• /
• 1996

The concept of cellular manufacturing is to decompose a manufacturing system into subsystems, which are easier to manage than the entire manufacturing system. The objective of cellular manufacturing is to group parts with similar processing requirements into part families and machines into cells which meet the processing needs of part families assigned to them. This paper presents a methodology for cell formation based on genetic algorithm which produces improved cell formation in terms of total moves, which is a weighted sum of both intercell moves and intracell moves. A sample problem is solved for two, three and four cells with an approach based on genetic algorithms.

• 한국경영과학회지
• /
• 제23권1호
• /
• pp.17-28
• /
• 1998

This study suggests a procedure for designing cellular manufacturing systems (CMS) which are combined with automated guided vehicles (AGVs) using a tandem configuration. So far most of the previous studies have dealt with conventional design problems not considering the layout and the characteristics of transporters used in CMS. A mathematical model is developed using the service time to perform material transfers as a suitable meassure. The service capacity of AGVs and space limitations are also reflected in this model. As the model can be shown strongly NP-hard, a heuristic algorithm is presented, in which each cell is temporarily formed using both the set covering model and similarity coefficients, and then locations of the cells are determined by means of tabu search and finally machine perturbations are carried out. An example problem is solved to demonstrate the algorithm developed.

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

This study is concerned with a heuristic algorithm that can make effectively the machine-part grouping in early stage for designing cellular manufacturing systems. By enhancing the Close Neighbour Algorithm(CNA), the proposed algorithm is concerned with making the machine-part grouping that can maximize machine utilization and minimize part's intercell movement by reducing exceptional elements. The algorithm is tested against existing algorithms in solving several machine-part initial matrices extracted from references and obtained by using random number. Test results shows that a solution matrix of the algorithm has superior grouping efficiency to Close Neighbour Algorithm.

• 대한산업공학회지
• /
• 제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.