• Title/Summary/Keyword: Feeder Assignment

Search Result 6, Processing Time 0.017 seconds

PCB Assembly Optimization of Chip Mounters for Multiple Feeder Assignment (다중피더배치를 고려한 칩마운터의 조립순서 최적화)

  • Kim Kyung-Min;Park Tae-Hyoung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.2
    • /
    • pp.144-151
    • /
    • 2005
  • We propose an optimization method to reduce the assembly time of chip mounters. Feeder arrangement and assembly sequence are determined considering the multiple feeder assignment. The problem is divided into two sub-problems: feeder arrangement problem and assembly sequence problem. We present mathematical model for each sub-problem. The clustering algorithm and assignment algorithm are applied to solve the feeder arrangement problem. The assignment algorithm and connection algorithm are applied to solve the assembly sequence problem. Simulation results are then presented to verity the usefulness of the proposed method.

Feeder Re-assign Problem in a Surface Mount Device with a Piano-Type Multi-Headed Gantry

  • Tae, Hyunchul;Kim, Byung-In
    • 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.

Heavy-Weight Component First Placement Algorithm for Minimizing Assembly Time of Printed Circuit Board Component Placement Machine

  • Lee, Sang-Un
    • 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.

Development of the Process Planning Program for a Multi-functional Surface Mounting Device (다기능 표면실장기의 공정계획 프로그램 개발)

  • Sohn, Jin-Hyeon;Yu, Sung-Yeol;Kang, Jang-Ha;Park, Sung-Soo;Oh, Byung-Jun;Seong, Pil-Young
    • IE interfaces
    • /
    • v.10 no.1
    • /
    • pp.155-167
    • /
    • 1997
  • The purpose of this study is to develop the program for efficient operation of a multi-functional surface mounting device(SMD) which mount various components on a printed circuit board(PCB). These components are provided by diverse types of feeders such as cassette, stick and tray feeders. The SMD has one or two heads. In the SMD, the positions of PCB and feeders and fixed, and the head moves to pick up a component from a feeder and to mount it on the PCB. The number of lanes occupied by each feeder and the nozzle used for each component can be different. We develop an off-line program to minimize the cycle-time of the SMD by studying the optimal assignment of feeders and the optimal mounting sequence of components. Graphical User Interface(GUI) is also developed. Additionally, we consider the line balancing problem which appears when two SMDs are used sequentially.

  • PDF

Analysis of the Switch Installation Criteria by Increasing Operating Capacity in Distribution Line (배전선로 운전용량 상향에 따른 개폐기 설치 기준 분석)

  • Jo, Nam-Hun;Ha, Bok-Nam;Lee, Heung-Ho
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.6
    • /
    • pp.290-295
    • /
    • 2002
  • The present assignment in installing the number of switches for distribution line was made on the basis of a normal feeder capacity 7,000kVA in KEPCO(Korea Electric Power Corporation), Korea. But the normal capacity is revised to 10000kVA in 1998. Even increasing limit of the operating capacity of the distribution lines enables us to give some benefit for the operation flexibility and investment cost of the distribution system. It is disadvantageous in the viewpoint of supply reliability. In distribution systems, switches are equipped to improve the reliability of distribution systems by minimizing the outage section due to fault and maintenance. Utility generally improves the reliability by minimizing the length of outage section, which is caused by fault and maintenance, through switch equipment on distribution system. In order to cope with the changes such as operation capacity, it is necessary to study whether the present criteria is reasonable or not, also to confirm whether the present criteria of installing switches in line is improved or not. In this study, we proposes the number of switch per feeder on the basis of present operation capacity in distribution system.

Integer Programming Approach to Line Optimization of Multiple Surface Mounters (정수계획법에 의한 다수 표면실장기의 라인 최적화)

  • Kim Kyung-Min;Park Tae-Hyoung
    • 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.

  • PDF