Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Manufacturing Engineering | en_US |
| dc.creator | Wan, Yuk-fong Solar | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/1595 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | The optimization of line cycle time in printed circuit board assembly | en_US |
| dcterms.abstract | This research addresses the problem of Printed Circuit Board (PCB) assembly in an electronics manufacturing system. In the electronic industry, an assembly line normally has several non-identical component placement machines and the placement times of the different machines for the same component are different. Faced with the global competition, an efficient component placement operation is essential. This research attempts to determine the allocation of components to placement machines for the optimization of the line cycle time. A mathematical model was constructed to represent the mechanism for determining the optimal line cycle time. Initially the mathematical model was in a non-linear integer minimax type formulation. It was then converted into an integer linear programming format. The Branch-and-Bound (B&B) algorithm was applied to solve the integer linear programming model in this research project. However, the B&B alogrithm was found to have taken a very long time to get the optimal solution and hence a heuristic method, the Tabu Search (TS) heuristic was proposed to solve the problem. The performances of both the B&B algorithm and the TS heuristic were compared. The result showed that the TS heuristic can achieve an acceptable solution with a shorter computational time and less number of iterations while the B&B algorithm can guarantee to arrive at the optimal solution. Both the B&B algorithm and the Tabu Search procedure are found applicable to determine the optimal line cycle time in PCB assembly efficiently. Moreover, the cycle time of PCB assembly can be reduced as well as the cost of production by the use of the model and methods presented in the project. A further study is required in order to implement the model and the algorithms developed in this project in a real industrial situation, such as, a graphical user interface. | en_US |
| dcterms.extent | xi, 163 leaves : ill. ; 30 cm | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2001 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.LCSH | Printed circuits | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b15784885.pdf | For All Users | 3.95 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- 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.
- 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.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/1595