Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Industrial and Systems Engineering | en_US |
| dc.creator | Wu, Yongzhong | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/4520 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Optimization of production planning in printed circuit board assembly | en_US |
| dcterms.abstract | Many complicated planning problems arise in Printed Circuit Board (PCB) assembly. This research focuses on two high-level planning problems, i.e., the Component Allocation Problem (CAP) and the Multi-Line Scheduling Problem (MLSP), both of which are important for improving production efficiency in PCB assembly. For a PCB job (batch) to be processed by an assembly line, the component allocation problem is investigated, which is to allocate the component placements required by the PCB to the placement machines in the line, so that the line cycle time is minimized. The problem is intertwined with the lower-level machine optimization problems (feeder arrangement and placement sequencing), which determine the process (placement) time of each machine. Considering the great computational complexity, a decomposed solution strategy is proposed. This strategy relies on a regression-based placement time estimator, which can estimate the placement time of each machine accurately without solving the machine optimization problems. Based on this estimator, a specific genetic algorithm is developed. Experimental tests show that the proposed genetic algorithm can solve the problem both effectively and efficiently. Compared with the existing software provided by the machine vendor, the line cycle time is reduced. For a set of PCB jobs to be produced by multiple assembly lines, the multi-line scheduling problem is investigated, which is to assign the PCB jobs to the lines and sequence the jobs in each line, so that the sum of weighted tardiness and weighted makespan is minimized. A mixed integer linear programming model for the problem is established. Line-dependent cycle times, different due dates of the jobs, sequence-dependent setup times, and precedence constraints are considered so that the model is realistic and applicable. Experimental tests show that exact solutions can not be obtained for realistic-sized problem instances. A specific genetic algorithm is developed for solving the problem. Due to the complexity of the problem, a new replacement strategy is proposed to improve the performance of the algorithm. Experimental tests show that the genetic algorithm can solve the problem both effectively and efficiently. A study of a real case is conducted and illustrates the applicability and usefulness of the method. | en_US |
| dcterms.extent | xiv, 186 leaves : ill. ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2009 | en_US |
| dcterms.educationalLevel | All Doctorate | en_US |
| dcterms.educationalLevel | Ph.D. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations. | en_US |
| dcterms.LCSH | Printed circuits industry. | en_US |
| dcterms.LCSH | Printed circuits -- Design and construction. | en_US |
| dcterms.LCSH | Production planning. | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b22867132.pdf | For All Users | 3.43 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/4520