Skip to main content
Log in

Optimal component-insertion sequenceplanning methodology for the semiautomatic assembly of printed circuit boards

  • Papers
  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

One of the primary concerns in the manufacturing of printed circuit boards (PCBs) is the definition of optimum component-insertion sequences for manual and automated operations. The problem is dynamic and multiple feasible solutions can be found. The research work described in this paper has developed a component-insertion sequencing methodology and a ‘proof-of-concept’ expert system for printed circuit boards. This system solves the component-insertion sequencing problem for semi-automated work cells which utilize a light guiding system to identify for the operator where to assemble the next component. The innovation of the methodology is the application of Artificial Intelligence and Expert Systems techniques to represent the human reasoning involved in semi-automated PCB assembly planning. Based on established assembly criteria, sequencing decision rules and data available from a CAD system, the methodology leads to optimum component-insertion sequences.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Cavalloro, P. and Cividati, E. (1988)INCA: An expert system for process planning in PCB assembly line. IEEE, 170–4.

  • Contact Systems (1988)CS-400 Component Locator Programming Manual, Contact Systems, Inc., Danbury.

    Google Scholar 

  • Cunningham, P. and Browne, J. (1986) A LISP-based heuristic scheduler for automatic insertion in electronics assembly,International Journal Production Research,24, 1395–408.

    Google Scholar 

  • Gavett, J. W. (1965) Three heuristic rules for sequencing jobs to a single production facility.Management Science,11, 166–76.

    Google Scholar 

  • Little, J. D., Murty, K. G., Sweeney, D. W. and Karel, C. (1963) An algorithm for the traveling salesman problem.Operations Research,11, 972–89.

    Google Scholar 

  • Onari, H., Kobayashi, A. H. and Takahashi, S. (1988)Computer Aided Process Planning for Flexible Assembly of Printed Circuit Boards. Hitachi, Ltd, Japan

    Google Scholar 

  • Parker, R. G. and Rardin, R. L. (1980) The traveling salesman problem: An update of research.Naval Research Logistic Quarterly,30, 78–107.

    Google Scholar 

  • Taha, H. A. (1985)Operations Research: An Introduction, Macmillan Publishing Co. Inc. New York.

    Google Scholar 

  • Tarjan, R. E. (1972) Depth First Search and Linear Graph Algorithms.SIAM Journal on Computing,1, 146–60.

    Google Scholar 

  • Universal Instruments (1983)Universal Instrument's Blue Binder. Universal Instruments Corp., New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sanchez, J.M., Priest, J.W. Optimal component-insertion sequenceplanning methodology for the semiautomatic assembly of printed circuit boards. J Intell Manuf 2, 177–187 (1991). https://doi.org/10.1007/BF01471364

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01471364

Keywords

Navigation