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

The evaluation test for the operation of rotary type surface mounters which consist of the reel axis, the index table and the X-Y table, has been performed by comparing the new method with the old one in only fields. Because the problem seeking for the optimal operation of rotary type surface mounters, is NP complete, it is almost impossible to get the optimal solutions of large problems. This paper deals with a dynamic network modeling, which can reduce the effort, the cost, and the time used for the performance test of rotary type surface mounters.

• International Journal of Control, Automation, and Systems
• /
• 제5권2호
• /
• pp.192-199
• /
• 2007

This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1237-1240
• /
• 1996

This paper proposes a heuristic algorithm for performing the line balancing of PCB assembly fine including multiple surface mounters efficiently. We consider a PCB assembly line including the multiple surface mounters arranged serially as a target system. We assume that the number of heads of surface mounters can be changed. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. Also we propose an head-changing algorithm. The algorithms are validated through the computer simulation.

• 대한산업공학회지
• /
• 제20권3호
• /
• pp.79-92
• /
• 1994

Surface mount technology has been evolving in the electronics industries. Efficient operation of surface mounters is closely related with the productivity of the electronic products. In this study, modeling and optimal algorithm for allocating feeders and sequencing mounting jobs in the rotary type surface mounter, which consider all the constraints, in the hardware and are easy to be used in the field, are developed.

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

This paper proposes a heuristic algorithm to efficiently perform line balancing in the PCB assembly line including multiple surface mounters efficiently. Generally, the problems in line balancing are classified into two kinds. Firstly, is the determining of the minimum number of machines required for achieving the desired production rate. Secondly, is the assign of jobs to multiple machines in order to minimize the cycle time which is defined as a maximum among the working times of machines when the number of machines is fixed. In this paper, we deal with the latter. We consider a PCB assembly line, including the multiple surface mounters arranged serially as a target system. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering that the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. The algorithm is validated through computer simulation, the results of which show that their shapes coincide nearly with those of optimal line balancing efficiency graphs regardless of the number of components, the performance of surface mounters, and the structure of assembly line.

• 한국정밀공학회지
• /
• 제12권8호
• /
• pp.106-113
• /
• 1995

Surface mounters are used to mount the parts of electronic products on PCB(Printed Circuit Board. Those machines rely on high precision, high productivity, and software for accomodation of use. In this paper, two algorithms and a software which can give the users the acco-modation and high productivity for rotary type surface mounters are presented. The algo- rithms for development of of the software consider all factors which affect the effeciency of the operation. And the interface between user and machine for the accomodation of use can be achieved through the developed software.

• 한국콘텐츠학회논문지
• /
• 제6권4호
• /
• pp.46-54
• /
• 2006

다수 대의 표면실장기를 포함한 PCB조립라인의 생산성 향상을 위한 방법을 제시한다. PCB조립시간의 단축을 위하여 각 실장기 별로 부품공급 피더의 배치 및 실장순서가 최적화 되어야 하며, 표면실장기들의 라인 밸런스를 위하여 부품 할당이 최적화 되어야 한다. 전체의 최적화 문제를 정수계획문제로 수식화하며, 전향경로문제와 후향경로 문제로 분할하여 구성한다. 클러스터링 알고리즘과 branch-and-bound 알고리즘을 사용하여 전향경로문제의 해를 구하며, 할당 알고리즘과 연결 알고리즘을 사용하여 후향경로 문제의 해를 구한다. 시뮬레이션 결과를 통하여 제안된 방법의 성능을 평가한다.

• 산업경영시스템학회지
• /
• 제24권66호
• /
• pp.91-98
• /
• 2001

In this study, a heuristic for surface mounters is developed to find an efficient sequence on PCB and rack assignment by component grouping. As setting up 4 reels in a group, the distance of rack moving can be minimized. And then, a generalized model for N reels in a group is developed. It is found that the performance of this heuristic is better than other heuristics found in the literature. Throughout the simulation study, the suggested heuristic is performed about 8.2 ∼ 12% better than other heuristics.