Component sequencing and feeder arrangement for PCB assembly machines : integration, models, and solutions

Pao Yue-kong Library Electronic Theses Database

Component sequencing and feeder arrangement for PCB assembly machines : integration, models, and solutions

 

Author: Ho, William
Title: Component sequencing and feeder arrangement for PCB assembly machines : integration, models, and solutions
Year: 2004
Subject: Hong Kong Polytechnic University -- Dissertations
Printed circuits -- Design and construction
Surface mount technology
Assembling machines
Department: Dept. of Industrial and Systems Engineering
Pages: xvii, 279 leaves : ill. ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1786414
URI: http://theses.lib.polyu.edu.hk/handle/200/2507
Abstract: The extensive applicability of printed circuit boards (PCBs) in numerous contemporary electronic products has placed an unprecedented demand for PCBs. Besides, customers' changing needs such as smaller in product size and greater in function and reliability force the surface mount technology (SMT) to replace the plated-through-hole technology. Among several assembly operations in an SMT assembly line, the component placement operation is a bottleneck of the line. So, this thesis mainly focuses on the optimization of the component placement operation such that the highest productivity can be achieved. The optimization of the component placement operation entails two interrelated problems: the component sequencing problem (i.e., which component places first, second, and so on) and the feeder arrangement problem (i.e., which feeder holds which type of components). Because of their inseparable relationship, the two problems should be integrated together instead of separated, as most of the researchers did. In this project, various types of mathematical models are formulated for the integrated problems of both the component sequencing and the feeder arrangement sub-problems for the two commonly used SMT placement machines: the pick-and-place machine and the chip shooter machine. The objective is to optimize the machines' performance. The models are also verified with commercial packages. Moreover, since it is very time-consuming to solve the mathematical models for optimal solutions, a heuristic approach is a prerequisite. Herein, a genetic algorithm hybridized with several improved heuristics is designed to solve the integrated problems. It is proved to be effective and efficient. Apart from the optimization of the component placement operation, this thesis also studies the line assignment problem in order to assign board types to proper assembly lines such that the minimal production cost can be obtained, in conjunction with the component allocation problem in order to assign component types to right placement machines in a line so that the minimal cycle time can be spent. For the line assignment and the component allocation problems, not only comprehensive and verified mathematical models are built but also genetic algorithms are proposed. Finally, a prototype of the printed circuit board assembly planning system is developed, in which the line assignment problem, the component allocation problem, and the integrated problems for both types of placement machines are combined together, to aid process engineers to determine the decision problems arising in PCB assembly.

Files in this item

Files Size Format
b17864148.pdf 7.393Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information