Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32057
Title: Genetic algorithm of determining cycle time for printed circuit board assembly lines
Authors: Ji, P 
Sze, MT
Lee, WB 
Issue Date: 2001
Publisher: Elsevier
Source: European journal of operational research, 2001, v. 128, no. 1, p. 175-184 How to cite?
Journal: European journal of operational research 
Abstract: The problem of allocating components to a printed circuit board (PCB) assembly line, which has several nonidentical placement machines in series, is formulated as a minimax-type integer programming (IP) model in this paper. In order to achieve the best production throughput, the objective of the model is to minimize the cycle time of the assembly line. The IP model is proven to be NP-complete (non-deterministic polynomial), so a genetic algorithm (GA) is developed for the cycle time determination problem in this paper. Finally, the efficiency of the genetic algorithm is illustrated by a numerical example.
URI: http://hdl.handle.net/10397/32057
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/S0377-2217(99)00348-3
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

34
Last Week
0
Last month
0
Citations as of Sep 23, 2017

WEB OF SCIENCETM
Citations

27
Last Week
0
Last month
0
Citations as of Sep 22, 2017

Page view(s)

39
Last Week
0
Last month
Checked on Sep 25, 2017

Google ScholarTM

Check

Altmetric



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