Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/13276
Title: Component grouping for automatic printed circuit board assembly
Authors: Sze, MT
Ji, P 
Lee, WB 
Keywords: Component grouping
Manufacturing planning
PCB assembly
Issue Date: 2002
Publisher: Springer
Source: International journal of advanced manufacturing technology, 2002, v. 19, no. 1, p. 71-77 How to cite?
Journal: International journal of advanced manufacturing technology 
Abstract: This paper addresses a component grouping problem in an automatic printed circuit board (PCB) assembly line with several non-identical placement machines. After the problem is defined, an integer linear programming model is formulated with the objective of minimising the cycle time of the assembly line. The integer linear programming model can be solved by the general branch-and-bound (B&B) algorithm; however, it is not efficient. So, the integer linear programming model is relaxed as a linear programming formulation because a near-optimal solution is acceptable in the real situation. A new algorithm is developed for the dual of the linear programming model. To demonstrate the efficiency of this algorithm, an example is presented and compared with its integer solution from a commercial package, CPLEX.
URI: http://hdl.handle.net/10397/13276
ISSN: 0268-3768
EISSN: 1433-3015
DOI: 10.1007/PL00003969
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

41
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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