• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.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.10a
• /
• 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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.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.

• Journal of the Korea Society for Simulation
• /
• v.15 no.4
• /
• pp.59-67
• /
• 2006

An efficient PCB assembly method with Gantry type machine is developed and proposed in this paper to improve system productivity. Nozzle changes at Gantry type machine is the major reason causing lower system performance instead of header and slot movements on the other type machines. The problem is attacked by maximizing multiple adsorptions to reduce the number of necessary nozzle changes with Gantry type machine. It is designed to reduce the assembly time per PCB with multiple adsorptions based upon the positions of feeders and nozzles. A simulation model is constructed to show the effectiveness of the suggested heuristic and necessarily a comparison study is followed with different methods on selection of next assembly feeder and nozzle with various cases.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.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.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.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
• /
• v.12 no.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.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.44-44
• /
• 1993

• International Journal of Control, Automation, and Systems
• /
• v.4 no.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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.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.