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

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.297-297
• /
• 2000

This paper proposed character recognition method by using DB Matching and Artificial Neural Network at the Gerber files. Gerber files are file for make PCB. But we also use the file to a program of extraction PCB position data. If the Gerber file recognized a character, the extraction PCB position data will be faster and also when the recognition rate is high, it can be possible to automatic extraction. We apply to the construction PCB Gerber file program and Simulation results are presented to verify the usefulness of the method.

• 제어로봇시스템학회논문지
• /
• 제16권11호
• /
• pp.1089-1095
• /
• 2010

We propose an image segmentation method for auto-teaching system of PCB (Printed Circuit Board) assembly inspection machines. The inspection machine acquires images of all components in PCB, and then compares each image with its standard image to find the assembly errors such as misalignment, inverse polarity, and tombstone. The component window that is the area of component to be acquired by camera, is one of the teaching data for operating the inspection machines. To reduce the teaching time of the machine, we newly develop the image processing method to extract the component window automatically from the image of PCB. The proposed method segments the component window by excluding the soldering parts as well as board background. We binarize the input image by use of HSI color model because it is difficult to discriminate the RGB colors between components and backgrounds. The linear combination of the binarized images then enhances the component window from the background. By use of the horizontal and vertical projection of histogram, we finally obtain the component widow. The experimental results are presented to verify the usefulness of the proposed method.

• 한국시뮬레이션학회논문지
• /
• 제15권4호
• /
• pp.59-67
• /
• 2006

본 연구에서는 갠트리타입 기종을 사용한 PCB 조립 생산시 생산시스템의 수행도 향상을 위한 방안을 개발하여 제시한다. 갠트리타입의 기종에서는 헤더나 슬롯의 이동보다는 노즐의 교체가 시스템의 수행도 향상에 주된 걸림돌이 되므로 동시흡착을 최대화할 수 있는 방안을 모색하였다. 본 연구에서 제시된 해법은 피더의 위치와 노즐의 위치를 감안하여 동시흡착을 수행하도록 함으로써 노즐 교체를 최소화하고, 기판당 조립시간의 감소도 이루어지도록 하였다. 제안 해법의 유효성을 입증하기 위해 시뮬레이션 모형을 구축하고 부품의 수를 변화시켜가면서 다음 작업대상피더와 교체노즐의 선정을 다양하게 하여 여러 운영방안들의 수행도와 비교 분석하였다. 시뮬레이션 결과, 동시흡착을 유도하는 노즐교체를 할 경우 전반적인 수행상태가 양호한 것으로 나타났다.

• 한국컴퓨터정보학회논문지
• /
• 제21권3호
• /
• pp.57-64
• /
• 2016

This paper deals with the PCB assembly time minimization problem that the PAP (pick-and-placement) machine pickup the K-weighted group of N-components, loading, and place into the PCB placement location. This problem considers the rotational turret velocity according to component weight group and moving velocity of distance in two component placement locations in PCB. This paper suggest heavy-weight component group first pick-and-place strategy that the feeder sequence fit to the placement location Hamiltonean cycle sequence. This algorithm applies the quadratic assignment problem (QAP) that considers feeder sequence and location sequence, and the linear assignment problem (LAP) that considers only feeder sequence. The proposed algorithm shorten the assembly time than iATMA for QAP, and same result as iATMA that shorten the assembly time than ATMA.

• 전기학회논문지
• /
• 제61권3호
• /
• pp.472-478
• /
• 2012

The inspection machine in PCB (printed circuit board) assembly line checks assembly errors by inspecting the images inside of the component inspection region. The component inspection region consists of region of component package and region of soldering. It is necessary to extract the regions automatically for auto-teaching system of the inspection machine. We propose an image segmentation method to extract the component inspection regions automatically from images of PCB. The acquired image is transformed to HSI color model, and then segmented by several regions by clustering method. We develop a modified K-means algorithm to increase the accuracy of extraction. The heuristics generating the initial clusters and merging the final clusters are newly proposed. The vertical and horizontal projection is also developed to distinguish the region of component package and region of soldering. The experimental results are presented to verify the usefulness of the proposed method.

• Industrial Engineering and Management Systems
• /
• 제12권4호
• /
• pp.330-335
• /
• 2013

A surface mount device (SMD) assembles electronic components on printed circuit boards (PCB). Since a component assembly process is a bottleneck process in a PCB assembly line, making an efficient SMD plan is critical in increasing the PCB assembly line productivity. Feeder assignment is an important part of the SMD plan optimization. In this paper, we propose a feeder re-assign improvement algorithm for a specific type of SMD machine with a piano type multi-head gantry. Computational results on some real-world benchmark data sets show the effectiveness of our proposed algorithm.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1993년도 추계학술대회발표논문집; 서강대학교, 서울; 25 Sep. 1993
• /
• pp.44-44
• /
• 1993

• International Journal of Control, Automation, and Systems
• /
• 제4권1호
• /
• pp.96-104
• /
• 2006

We propose a path planning method to improve the productivity of AOI (automated optical inspection) machines in PCB (printed circuit board) assembly lines. The path-planning problem is the optimization problem of finding inspection clusters and the visiting sequence of cameras to minimize the overall working time. A unified method is newly proposed to determine the inspection clusters and visiting sequence simultaneously. We apply a hybrid genetic algorithm to solve the highly complicated optimization problem. Comparative simulation results are presented to verify the usefulness of the proposed method.

• 제어로봇시스템학회논문지
• /
• 제6권6호
• /
• pp.506-513
• /
• 2000

This paper proposes a path planning algorithm for dispensers to increase the productivity in printed circuit board assembly lines. We analyze the assembly sequence of the dispenser, and formulate it as an integer programming problem. The mathematical formulation can accomodate multiple heads and different types of heads through extended cost matrix. The TSP algorithms are then applied to the formulated problem to find the near-optimal solution. Simulation results are presented to verify the usefulness of the proposed scheme.