In order to handle high and rapid production demands, printed circuit board (PCB) manufacturers have employed high‐speed surface mount machines into their assembly lines. These machines have abilities of fast component placements, but provide challenges for process engineers to optimise the component placement sequences and feeder arrangements via effective planning. A computer program was developed based on operating concepts using genetic algorithm, to solve for various component placement sequencing planning of the high‐speed chipshooter. Genetic algorithms are a class of general purpose search methods based on the concepts of genetic evolution and survival of the fittest. The program provides information on component placement sequences and feeder arrangements for optimal assembly times. Initial tests have shown that the size of the parent space affects the convergence of the solutions during iterations. Finally, comparisons of results have shown improvement over those previously obtained by other researchers.
Article navigation
1 February 2002
This article was originally published in
Integrated Manufacturing Systems
Research Article|
February 01 2002
Sequence placement planning for high‐speed PCB assembly machine Available to Purchase
N.‐S. Ong;
N.‐S. Ong
School of Mechanical and Production Engineering, Nanyang Technological University, Singapore
Search for other works by this author on:
W.‐C. Tan
W.‐C. Tan
School of Mechanical and Production Engineering, Nanyang Technological University, Singapore
Search for other works by this author on:
Publisher: Emerald Publishing
Online ISSN: 1758-583X
Print ISSN: 0957-6061
© MCB UP Limited
2002
Integrated Manufacturing Systems (2002) 13 (1): 35–46.
Citation
Ong N, Tan W (2002), "Sequence placement planning for high‐speed PCB assembly machine". Integrated Manufacturing Systems, Vol. 13 No. 1 pp. 35–46, doi: https://doi.org/10.1108/09576060210411495
Download citation file:
273
Views
Suggested Reading
Pareto‐based continuous evolutionary algorithms for multiobjective optimization
Engineering Computations (February,2002)
A modification to particle swarm optimization algorithm
Engineering Computations (December,2002)
An Efficient Algorithm to Solve Integer‐programming Problems in Reliability Optimisation
International Journal of Quality & Reliability Management (May,1990)
Dynamic simulation modelling for lean logistics
International Journal of Physical Distribution & Logistics Management (April,1997)
Related Chapters
Enacting the Everyday: The Dialectic of Algorithms, Data Activism, and Platform Power
Contesting Platform Power: The Oppositional Affordances of Data Activism
Conclusion: The Future of Platform Power and Data Activism
Contesting Platform Power: The Oppositional Affordances of Data Activism
Recommended for you
These recommendations are informed by your reading behaviors and indicated interests.
