Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26616
Title: A tabu search heuristic for the component assignment problem in PCB assembly
Authors: Wan, YF
Ji, P 
Keywords: Assembly
Electronics industry
Printed circuits
Computer programming
Issue Date: 2001
Publisher: Emerald Group Publishing Limited
Source: Assembly automation, 2001, v. 21, no. 3, p. 236-240 How to cite?
Journal: Assembly automation 
Abstract: Discusses the component assignment problem in PCB assembly, where assigning components to appropriate machines, in order to get a minimum assembly time for the assembly line, can be formulated as an integer linear programming model. In order to obtain the optimal solution to the component assignment problem, the branch-and-bound method can be applied. However, it is not efficient. Applies the tabu search heuristic to the component assignment problem. The procedure of the tabu search to the problem is presented, and a numerical example is provided. Finally, the performance of the tabu search is analyzed with the example.
URI: http://hdl.handle.net/10397/26616
ISSN: 0144-5154
DOI: 10.1108/EUM0000000005619
Appears in Collections:Journal/Magazine Article

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

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
1
Citations as of Aug 9, 2017

Page view(s)

45
Last Week
1
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



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