• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• 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
• /
• v.5 no.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.10b
• /
• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.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.

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

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.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.

• The Journal of the Korea Contents Association
• /
• v.6 no.4
• /
• pp.46-54
• /
• 2006

We propose an optimization method for PCB assembly lines including multiple surface mounters. To increase the productivity of PCB assembly line, the component allocation, feeder assignment, and assembly sequence of each surface mounter should be optimized. The optimization Problem is formulated as an integer programming problem. We divide the overall problem into two hierarchical sub-problems: forward-path problem and backward-path problem. The clustering algorithm and branch-and-bound algorithm are applied to solve the forward-path problem. The assignment algorithm and connection algorithm are applied to solve the backward-path problem. Simulation results are presented to verify the usefulness of the proposed method.

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