• 한국통신학회논문지
• /
• 제38A권6호
• /
• pp.520-527
• /
• 2013

본 논문에서는 클러스터 이기종 셀룰러 네트워크에서 반동적 셀 그룹핑을 위한 합동 셀 그룹핑 및 사용자 접속 기법을 제안한다. 최근에는 핫스팟에서의 폭발적인 데이터 요구량을 지원하기 위해서, 소형 셀들이 기존의 매크로 기지국들과 함께 설치되고 있다. 이러한 클러스터 이기종 셀룰러 네트워크에서는 간섭과 부하 불균형으로 인하여 성능 열화가 발생할 수 있다. 본 논문에서 제안하는 기법은 사용자들의 비례공평이 최대화되도록 두 가지 문제를 합동적으로 다룬다. 모의실험을 통하여, 기존의 기법들보다 제안하는 기법을 통해 훨씬 더 향상된 사용자 평균 전송률 및 사용자간의 비례공평을 얻을 수 있음을 알아본다.

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

• 한국경영과학회지
• /
• 제30권3호
• /
• pp.41-54
• /
• 2005

In this paper, we consider a multi-objective machine cell formation problem. This problem Is characterized as determining part route families and machine cells such that total sum of inter-ceil part movements and maximum machine workload imbalance are simultaneously minimized. Together with the objective function, alternative part routes and the machine sequences of part routes are considered In grouping Part route families. Due to the complexity of the problem, a two-phase heuristic algorithm is proposed. And we developed an n-stage look-ahead heuristic algorithm that generalizes the roll-out algorithm. Computational experiments were conducted to verify the performance of the algorithm.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 1999년도 춘계공동학술대회:정보화시대의 지식경영
• /
• pp.377-378
• /
• 1999

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1565-1568
• /
• 1997

In this paper, a fuzzy based machine-cell formation algorithm for cellular manufacturing is presented. The fuzzy lovic is employed to express the degree of appropriateness when alternative machnies are specified to process a part shape. For machine grouping, the similarity coefficient based approach is used. The algorithm produces efficient machine cells and part families which maximize the similarity values.

• 제어로봇시스템학회논문지
• /
• 제3권3호
• /
• pp.305-310
• /
• 1997

In this paper, a fuzzy set based machine-cell formation algorithm for cellular manufacturing is presented. The fuzzy logic is emoloyed to express the degree of appropriateness when alternative machines are specified to process a part shape. For machine grouping, the similarity coefficient based approach is used. The algorithm produces efficient machine cells and part families which maximize the similarity values.

• 산업경영시스템학회지
• /
• 제28권1호
• /
• pp.121-128
• /
• 2005

This paper proposes the heuristic approach for the generalized GT(Group Technology) problem to consider the restrictions which are given the number of cell, maximum number of machines and minimum number of machines. This approach is classified into two stages. In the first stage, we use the similarity coefficient method which is proposed and calculate the similarity values about each pair of all machines and align these values in descending order. If two machines which is selected is possible to link the each other on the edge of machine cell and they don't have zero similarity value, then we assign the machines to the machine cell. In the second stage, it is the course to form part families using proposed grouping efficacy. Finally, machine-part incidence matrix is realigned to block diagonal structure. The results of using the proposed approach are compared to the Modified p-median model.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1996년도 추계학술대회 학술발표 논문집
• /
• pp.315-318
• /
• 1996

The machine-part cell formation means the grouping of similar parts and similar machines into families in order to minimize bottleneck machines, bottleneck parts, and inter-cell part movements in cellular manufacturing systems and flexible manufacturing systems. The cell formation problem is knows as a kind of NP complete problems. This paper briefly introduces the cell-formation problem and proposes a cell formation method based on the Kohonen's self-organizing feature map which is a neural network model. It also shows some experiment results using the proposed method. The proposed method can be easily applied to the cell formation problem compared to other meta-heuristic based methods. In addition, it can be used to solve large-scale cell formation problems.

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

This paper presents a similarity coefficient based approach to the problem of machine-part grouping for cellular manufacturing. The method uses relevant production data such as part type, production volume, routing sequence to make machine cells and part families for cell formation. A new similarity coefficient using weighted factors is introduced and an algorithm for formation of machine cells and part families is developed. A comparative study of two similarity coefficients - Gupta and seifoddini's method and proposed method - is conducted. A software program using TURBO C has been developed to verify the implementation.

• 대한산업공학회지
• /
• 제22권1호
• /
• pp.141-154
• /
• 1996

This paper presents a similarity coefficient based approach to the problem of machine-part grouping for cellular manufacturing. The method uses relevant production data such as part type, production volume, routing sequence to make machine cells and part families for cell formation. A new similarity coefficient using weighted factors is introduced and an algorithm for formation of machine cells and part families is developed. A comparative study of two similarity coefficient methods, Gupta and Seifoddini's method and the proposed method, is conducted.