Please use this identifier to cite or link to this item:
Title: Minimizing cycle time for PCB assembly lines : an integer programming model and a branch-and-bound approach
Authors: Ji, P 
Wan, YF
Keywords: Branch-and-bound (B&B) algorithm
Integer programming
PCB assembly
Planning and control
Issue Date: 2008
Source: International journal of information and management sciences, 2008, v. 19, no. 2, p. 237-243 How to cite?
Journal: International Journal of Information and Management Sciences 
Abstract: Printed circuit board (PCB) assembly is popular in today's electronic manufacturing industry while component placement is critical in PCB assembly since it determines the efficiency and productivity of a PCB assembly line. This paper first discusses a cycle time determination problem in a PCB assembly line. Then the problem is formulated into a pure integer programming model with the objective of minimizing the cycle time of the PCB assembly line. Furthermore, the mathematical model is solved by the branch-and-bound (B&B) algorithm in order to get the optimal solution. Finally, a numerical example is presented to illustrate the mathematical model and the B&B algorithm.
ISSN: 1017-1819
Appears in Collections:Journal/Magazine Article

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


Last Week
Last month
Citations as of Aug 16, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 13, 2018

Google ScholarTM


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