• Industrial Engineering and Management Systems
• /
• 제15권4호
• /
• pp.364-373
• /
• 2016

Disassembly is one of the important activities in treating with the product at the End of Life time (EOL). Disassembly is defined as a systematic technique in dividing the products into its constituent elements, segments, sub-assemblies, and other groups. We concern with a Fuzzy Disassembly Line Balancing Problem (FDLBP) with multiple objectives in this article that it needs to allocation of disassembly tasks to the ordered group of disassembly Work Stations. Tasks-processing times are fuzzy numbers with triangular membership functions. Four objectives are acquired that include: (1) Minimization of number of disassembly work stations; (2) Minimization of sum of idle time periods from all work stations by ensuring from similar idle time at any work-station; (3) Maximization of preference in removal the hazardous parts at the shortest possible time; and (4) Maximization of preference in removal the high-demand parts before low-demand parts. This suggested model was initially solved by GAMS software and then using Genetic Algorithm (GA) in MATLAB software. This model has been utilized to balance automotive engine disassembly line in fuzzy environment. The fuzzy results derived from two software programs have been compared by ranking technique using mean and fuzzy dispersion with each other. The result of this comparison shows that genetic algorithm and solving it by MATLAB may be assumed as an efficient solution and effective algorithm to solve FDLBP in terms of quality of solution and determination of optimal sequence.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1995년도 추계학술대회 논문집
• /
• pp.707-710
• /
• 1995

Structure of product, which is not considered by easy of assembly, has many hidden costs. For reduction of hidden costs, concepts of line balancing and assembly-oriented design are used. We find that part of structure can be improved by concept of line balancing. To reduce assembly time and enhance easy of assembly, design principles are developed by concept of assembly-oriented design. And design principles for improvement are applied according to condition of the grasped parts of product structure. Thersfore, we could design assembly-oriented design for better structure and low cost.

• 제어로봇시스템학회논문지
• /
• 제22권1호
• /
• pp.40-45
• /
• 2016

This paper presents the neuro-fuzzy control method for balancing a two-wheel mobile robot. A two-wheel mobile robot is built for the experimental studies. On-line learning algorithm based on the back-propagation(BP) method is derived for the Takagi-Sugeno(T-S) neuro-fuzzy controller. The modified error is proposed to learn the B-P algorithm for the balancing control of a two-wheel mobile robot. The T-S controller is implemented on a DSP chip. Experimental studies of the balancing control performance are conducted. Balancing control performances with disturbance are also conducted and results are evaluated.

• 제어로봇시스템학회논문지
• /
• 제11권10호
• /
• pp.888-894
• /
• 2005

In this paper, experimental studies of balancing a pendulum mounted on a wheeled drive mobile robot and its position control are presented. Main PID controllers are compensated by a neural network. Neural network learning algorithm is embedded on a DSP board and neural network controls the angle of the pendulum and the position of the mobile robot along with PID controllers. Uncertainties in system dynamics are compensated by a neural network in on-line fashion. Experimental results show that the performance of balancing of the pendulum and position tracking of the mobile robot is good.

• 산업경영시스템학회지
• /
• 제33권4호
• /
• pp.138-144
• /
• 2010

This research deals with multiple Gantry-type assembly machines for the optimization of PCB assembly line. The automated assembly machine has 6 nozzles which can linearly move the X axis and the Y axis different from the turret type assembly machine. Each machine is optimized while considering the whole line balancing of three machines in assembly process simultaneously. Simulation models are developed using AutoMod for comparison study with single machine operation cases under various conditions such as types and total number of components to evaluate the proposed method.

• 한국경영과학회지
• /
• 제17권1호
• /
• pp.55-65
• /
• 1992

There are takes performed on only one side (right side or left side) of the assembly line, and task groups in which the tasks are more related to one another like a subassembly. In the Assembly Line Balancing (ALB) of the large-sized product such as bus and truck, the side on which tasks are performed and the related task groups should be considered to improve work methods and to appropriately lay out parts and facilities in the line. In this paper, presented are the 0-1 programming formulations for the ALB with the constraints of assigning the same side tasks to the station. The objective of minimizing the number of stations is combined with the objective that the total number of the related task groups handled by all the stations is minimized. Also, proposed are the methods of reducing the number of variables and constraints, and of determining the station to which subassembly tasks are assigned.

• 산업공학
• /
• 제10권2호
• /
• pp.29-40
• /
• 1997

This paper considers two-sided (left and right side) assembly lines which are often used, especially in assembling large-sized products such as trucks and buses. A large number of exact algorithms and heuristics have been proposed to balance one-sided lines. However, little attention has been paid to balancing two-sided assembly lines. This paper presents an efficient assignment rule for balancing two-sided assembly lines. The rule involves maximizing relatedness and slackness between works. We first investigate the characteristics of two-sided line balancing and devise new measures for the balancing. We in this rule assign workstations a set of tasks rather than an unit task at a time. a priority rule of assigning the sets is proposed. Extensive computational experiments are carried out to make the performance comparison between the proposed rule and existing ones. The computational results show that our rule is promising in solution quality.

• 산업경영시스템학회지
• /
• 제41권2호
• /
• pp.105-116
• /
• 2018

In this study, we consider the assembly line balancing (ALB) problem which is known as an very important decision dealing with the optimal design of assembly lines. We consider ALB problems with soft constraints which are expected to be fulfilled, however they are not necessarily to be satisfied always and they are difficult to be presented in exact quantitative forms. In previous studies, most researches have dealt with hard constraints which should be satisfied at all time in ALB problems. In this study, we modify the mixed integer programming model of the problem introduced in the existing study where the problem was first considered. Based on the modified model, we propose a new algorithm using the genetic algorithm (GA). In the algorithm, new features like, a mixed initial population selection method composed of the random selection method and the elite solutions of the simple ALB problem, a fitness evaluation method based on achievement ratio are applied. In addition, we select the genetic operators and parameters which are appropriate for the soft assignment constraints through the preliminary tests. From the results of the computational experiments, it is shown that the proposed algorithm generated the solutions with the high achievement ratio of the soft constraints.

• 한국컴퓨터정보학회논문지
• /
• 제19권5호
• /
• pp.89-98
• /
• 2014

본 논문은 NP-난제 문제로 알려진 단일모델 단방향 조립라인 균형문제에 대해 휴리스틱 알고리즘을 제안하였다. 조립라인 균형문제는 주로 메타휴리스틱 방법들을 적용하고 있는 추세이다. 제안된 알고리즘은 최종제품이 생산될 때까지 가장 많은 공정으로 조립되는 경로를 주경로로 설정하고, 주경로를 따라가면서 각 작업자에게 순환시간 조건을 만족하는 작업량을 배정하는 군집화 알고리즘을 제안하였다. 제안된 알고리즘은 최소의 작업자수를 결정하고, 순환시간도 단축시키는 결과를 얻었다. 9개의 다양한 실험 데이터에 제안된 주경로 군집화 휴리스틱 알고리즘을 적용한 결과 메타휴리스틱 방법들에 비해 보다 좋은 성능을 갖고 있음을 보였다.

• 한국인터넷방송통신학회논문지
• /
• 제22권1호
• /
• pp.95-101
• /
• 2022

NP-난제로 알려진 양측 조립라인 균형문제는 주로 메타휴리스틱 방법들을 적용하여 해를 구하고 있다. 본 논문은 총 작업완료시간 W와 순환시간 c가 주어진 양측 조립라인의 선행순서도에서 좌측, 우측과 좌·우측 무관으로 공정들을 분류하고, 좌측과 우측 각각에 대해 M^* = ${\lceil}$W/c${\rceil}$개의 작업대에 T_i = c^* ± α < c, c^* = ${\lceil}$W/m^*${\rceil}$이 되도록 공정들을 할당하는 병렬군집 알고리즘을 제안하였다. 제안된 알고리즘을 4개의 실험데이터, 17개의 c에 적용한 결과, 기존의 메타휴리스틱 방법들에 비해 최소 작업대 수 m^*를 구하였으며, T_max < c로 순환시간을 단축하였다. 또한, 제안된 알고리즘은 휴리스틱 방법임에도 불구하고, 조립라인 효율성의 극대화와 작업자간 작업시간 편차를 최소화시킬 수 있었다.