A tabu search heuristic for the component assignment problem in PCB assembly
Authors:
- 1 September 2001
- journal article
- Published by Emerald Publishing in Assembly Automation
- Vol. 21 (3) , 236-240
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.Keywords
This publication has 8 references indexed in Scilit:
- Modeling the component assignment problem in PCB assemblyAssembly Automation, 2001
- A tabu search heuristic using genetic diversification for the clustered traveling salesman problemJournal of Heuristics, 1997
- Extensions of a tabu search adaptation to the quadratic assignment problemComputers & Operations Research, 1994
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- AUTOMATED PROCESS PLANNING FOR PRINTED CIRCUIT CARD ASSEMBLYIIE Transactions, 1992
- Sequencing of Insertions in Printed Circuit Board AssemblyOperations Research, 1988
- On Optimizing Bin Picking and Insertion Plans for Assembly RobotsIIE Transactions, 1984
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977