Abstract
The purpose of this paper is to present an overview of the factors affecting the cycle time of printed circuit card assembly (PCCA) in high-mix environments and demonstrate a technique for improving machine throughput. We have concentrated our research on optimizing the portion of the PCCA manufacturing process performed by high-speed placement machines (chip shooters). A crucial factor affecting the throughput of a chip shooter is the assignment of components to the feeder slots. Genetic algorithms were employed to find a near optimal assignment of the feeder carriage. Results for various genetic operators in this problem domain are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T.M. Tirpak, Simulation software for surface mount assembly, in: Proceedings of the 1993 Winter Simulation Conference, Los Angeles, CA, December 1993, pp. 796–803.
T.M. Tirpak, A case study in computer-aided scheduling for high-mix surface mount technology, Boston, MA, February 1993; NEPCON East 1993, Technical Session 6.
V. Mehra, Reducing cycle times for surface mount production processes, Anaheim, CA, February 1993; NEPCON West 1993, Technical Session 18.
L.F. McGinnis, J.C. Ammons, M. Carlyle, L. Cranmer, G.W. Depuy, K.P. Ellis, C.A. Tovey and H. Xu, Automated process planning for printed circuit card assembly, IIE Transactions (September 1992).
L.F. McGinnis, J.C. Ammons, M. Carlyle, L. Cranmer, G.W. Depuy, K.P. Ellis, C.A. Tovey and H. Xu, Computer-aided process planning in printed circuit card assembly, IEEE (June 1993).
T. Koopmans and M. Beckmann, Assignment problems and the location of invisible economic activities, Econometrica (1957)53–76.
P.M. Pardalos and J.V. Crouse, P-complete approximation problems, in: Proceedings of Super-Computing Conference, 1989, pp. 357–360.
S. Sahni and T. Gonzalez, P-complete approximation problems, Journal of the ACM (1976)555–565.
J.H. Holland, Adaption in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, MI, 1975.
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
A. Dikos, Optimization of printed circuit card assembly in high-mix environments using genetic algorithms, Master's Thesis, University of Illinois at Chicago, 1995.
J.D. Bagley, The behavior of adaptive systems which employ genetic and correlation algorithms, Ph.D. Thesis, University of Michigan, 1967.
D.E. Goldberg and R. Lingle, Alleles, loci, and the traveling salesman problem, in: Proceedings of the International Conference on Genetic Algorithms and Their Applications, 1991, pp. 154–159.
L. Davis, Applying adaptive algorithms to epistaic domains, in: Proceedings of the International Joint Conference on Artificial Intelligence, 1985.
Panasert Software Training Manual, Revision 1.2, Panasonic Factory Automation, 1994.
I. Oliver, D. Smith and J.R. Holland, A study of permutation crossover operators on the traveling salesman problem, in: Proceedings of the 2nd International Conference on Genetic Algorithms and Their Applications, 1987, pp. 224–230.
D. Whitley, T. Starkweather and D. Fuquay, Scheduling problems and traveling salesman: The genetic edge recombination operator, in: Proceedings of the 3rd International Conference on Genetic Algorithms, 1989, pp. 133–140.
D.E. Brown, C.L. Huntley and A.R. Spillane, A parallel genetic heuristic for the quadratic assignment problem, in: Proceedings of the 3rd International Conference on Genetic Algorithms and Their Applications, 1989, pp. 406–415.
Rights and permissions
About this article
Cite this article
Dikos, A., Nelson, P.C., Tirpak, T.M. et al. Optimization of high-mix printed circuit card assembly using genetic algorithms. Annals of Operations Research 75, 303–324 (1997). https://doi.org/10.1023/A:1018919815515
Issue Date:
DOI: https://doi.org/10.1023/A:1018919815515