Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/2204
DC FieldValueLanguage
dc.contributor.authorHo, Williamen_US
dc.date.accessioned2010-10-12T11:50:34Z-
dc.date.available2010-10-12T11:50:34Z-
dc.date.issued2004-
dc.identifier.urihttp://hdl.handle.net/10397/2204-
dc.description1xvii, 279 leaves : ill. ; 30 cmen_US
dc.descriptionPolyU Library Call No.: [THS] LG51 .H577P ISE 2004 Hoen_US
dc.description.abstractThe 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.en_US
dc.description.sponsorshipDepartment of Industrial and Systems Engineeringen_US
dc.language.isoenen_US
dc.publisherThe Hong Kong Polytechnic Universityen_US
dc.rightsAll rights reserved.en_US
dc.subjectPrinted circuits -- Design and construction.en_US
dc.subjectSurface mount technologyen_US
dc.subjectAssembling machinesen_US
dc.subjectHong Kong Polytechnic University -- Dissertationsen_US
dc.titleComponent sequencing and feeder arrangement for PCB assembly machines : integration, models, and solutionsen_US
dc.typeThesisen_US
dc.description.degreePh.D., Dept. of Industrial & Systems Engineering, The Hong Kong Polytechnic University, 2004.en_US
dc.description.degreelevelDoctorateen_US
dc.relation.publicationpublished-
dc.description.oapublished_final-
Appears in Collections:Thesis
Files in This Item:
File Description SizeFormat 
E-thesis_Link.htmFor PolyU Users 162 BHTMLView/Open
b17864148.pdfFor All Users (Non-printable)7.21 MBAdobe PDFView/Open
Show simple item record
PIRA download icon_1.1View/Download Contents

Page view(s)

1,038
Last Week
4
Last month
Citations as of Jul 16, 2019

Download(s)

195
Citations as of Jul 16, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.