Advertisement

Physical Design of Printed Circuit Boards: Group Technology Approach

  • Dan Braha
  • Oded Maimon
Part of the Applied Optimization book series (APOP, volume 17)

Abstract

In this chapter, the applicability of Group Technology models and clustering techniques of the industrial engineering and operation research community to the partitioning problem of electronic circuits is examined. The problem is shown to be NP-complete, hence intractable within most modern computing environments. Characteristics of the solution are outlined and a grouping heuristic algorithm is discussed. We derive lower bounds on the objective function for any set of constraints on pairs of gates that must be in the same chip. The lower bounds and the grouping heuristic procedure are used to develop a branch and bound algorithm. Finally, computational results are given for four test problems.

Keywords

Print Circuit Board Chromatic Number Group Technology Physical Design Synthesis Knowledge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Askin, R.G. and K. S. Chiu, “A Graph Partitioning Procedure for Machine Assignment and Cell Formation in Group Technology,” International Journal of Production Research, Vol. 28, pp. 1555–1572, 1990.zbMATHCrossRefGoogle Scholar
  2. 2.
    Boothroyd, G., Assembly Automation and Product Design, Marcel Dekker, New York, 1992.Google Scholar
  3. 3.
    Chandrasekharan, M.P. and R. Rajagopalan, “An Ideal Seed Non-Hierarchical Clustering Algorithm for Cellular Manufacturing,” International Journal of Production Research, Vol. 24, pp. 451–464, 1986a.zbMATHCrossRefGoogle Scholar
  4. 4.
    Chandrasekharan, M.P. and R. Rajagopalan, “MODROC: An Extension of Rank Order Clustering for Group Technology,” International Journal of Production Research, Vol. 24, pp. 1221–1233, 19866.Google Scholar
  5. 5.
    Chu, C.H., “Manufacturing cell formation by competitive learning,” European Journal of Operational Research, Vol. 69 (3), pp. 292–311, 1993.CrossRefGoogle Scholar
  6. 6.
    Chung, Y., and A. Kusiak, “Grouping Parts with a Neural Network,” Journal of Manufacturing Systems, Vol. 13, pp. 262–275, 1994.CrossRefGoogle Scholar
  7. 7.
    Ersov, A.P. and G.I. Kozuhin, “Estimates of the Chromatic Number of Connected Graphs,” Soviet Mathematics, Translation of Doklady Akademii Nauk SSSR, Vol. 3, pp. 50–53, 1962.Google Scholar
  8. 8.
    Garey, M.R. and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.zbMATHGoogle Scholar
  9. 9.
    Harhalakis, G., Nagi, R. and J.M. Proth, “An Efficient Heuristic in Manufacturing Cell Formation for Group Technology Applications,” International Journal of Production Research, Vol. 28, pp. 185–198, 1990.CrossRefGoogle Scholar
  10. 10.
    Harhalakis, G., Proth, J.M. and X. L. Xie, “Manufacturing cell design using simulated annealing: an industrial application,” Journal of Intelligent Manufacturing, pp. 185–191, 1990.Google Scholar
  11. 11.
    Kaparthi, S., Suresh, N.C. and R.P. Cerveny, “ An improved neural network leader algorithm for part-machine grouping in group technology,” European Journal of Operational Research, Vol. 69, pp. 342–356, 1993.zbMATHCrossRefGoogle Scholar
  12. 12.
    King, J.R., “Machine-Component Group Formation in Group Technology,” OMEGA: The International Journal of Management Science, Vol. 8, pp. 193–199, 1980a.CrossRefGoogle Scholar
  13. 13.
    King, J.R., “Machine-Component Grouping in Production Flow Analysis: An Approach Using a Rank-Order Clustering Algorithm,” International Journal of Production Research, Vol. 18, pp. 213–232, 19806.Google Scholar
  14. 14.
    Kumar, K.R., Kusiak, A. and A. Vannelli, “Grouping of Parts and Components in Flexible Manufacturing Systems,” European Journal of Operational Research, Vol. 24, pp. 387–397, 1986.CrossRefGoogle Scholar
  15. 15.
    Kusiak, A., “The Generalized Group Technology Concept,” International Journal of Production Research, Vol. 25, pp. 561–569, 1987.CrossRefGoogle Scholar
  16. 16.
    Liu, C.M. and J.K. Wu, “Machine cell formation: using the simulated anneling algorithm,” International Journal Computer Integrated Manufacturing, Vol. 6 (6), pp. 335–349, 1993.CrossRefGoogle Scholar
  17. 17.
    Maimon, O. and A. Shtub, “Grouping Methods for Printed Circuit Boards Assembly,” International Journal of Production Research, Vol. 29, pp. 1379–1390, 1991.CrossRefGoogle Scholar
  18. 18.
    McGinnis, L. F., J.C. Ammons, M. Carlyle, Ranmer L., Depuy, G. W., Ellis, K. P., Tovey C. A. and H. Xu, “Automated Process Planning for Printed Circuit Card Assembly,” IIE Transactions, 24, pp. 18–26, 1992.CrossRefGoogle Scholar
  19. 19.
    Papadimitriou, C.H. and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, Englewood Cliffs, NJ, 1982.zbMATHGoogle Scholar
  20. 20.
    Pierreval, H. and M. F. Plaquin, “A Genetic Algorithm Approach to Group Machines into Manufacturing Cells,” Proceeding of the Fourth International Conference on Computer Integrated Manufacturing and Automation Technology, pp. 267–271, 1994.Google Scholar
  21. 21.
    Rajagopalan, R. and J.L. Batra, “Design of Cellular Production Systems: A Graph Theoretic Approach,” International Journal of Production Research, Vol. 13, pp. 567–579, 1975.CrossRefGoogle Scholar
  22. 22.
    Rockwell, T.H. and W.E. Wilhelm, “Material Flow Management in Cellular Configurations for Small-Lot Circuit Card Assembly,” International Journal of Production Research, Vol. 28, pp. 573–594, 1990.CrossRefGoogle Scholar
  23. 23.
    Shafer, S.M. and Meredith, J.R., “A Comparison of Selected Manufacturing Cell Formation Techniques,” International Journal of Production Research, Vol. 28, pp. 661–673, 1990.CrossRefGoogle Scholar
  24. 24.
    Shtub, A., “Modeling Group Technology Cell Formation as a Generalized Assignment Problem,” International Journal of Production Research, Vol. 27, pp. 775–782, 1989.CrossRefGoogle Scholar
  25. 25.
    Singh, N., “Design of cellular manufacturing systems: An invited review,” European Journal of Operational Research, Vol. 69, pp. 284–291, 1993.CrossRefGoogle Scholar
  26. 26.
    Vannelli, A. and K.R. Kumar, “A Method for Finding Minimal Bottle-Neck Cells for Grouping Part-Machine Families,” International Journal of Production Research, Vol. 24, pp. 387–400, 1986.CrossRefGoogle Scholar
  27. 27.
    Daskin, M., O. Maimon, A. Shtub and Braha D., “A Branch and Bound Algorithm for Grouping Components in Printed Circuits Board Production,” International Journal of Production Research,to appear.Google Scholar
  28. 28.
    Lindsey, D., The Design and Drafting of Printed Circuits, revised ed., Bishop Graphics Inc., CA, 1984.Google Scholar
  29. 29.
    Breuer, M.A., “Min-Cut Placement,” Journal of Design Automation and Fault Tolerant Computing,“ Vol. 1, pp. 343–362, 1977.Google Scholar
  30. 30.
    Fisher, D. H., “Knowledge Acquisition via Incremental Conceptual Clustering,” Machine Learning, Vol. 2 (7), pp. 139–172, 1987.Google Scholar
  31. 31.
    Reich, Y., “Measuring the Value of Knowledge,” International Journal of Human-Computer Studies, Vol. 42, pp. 3–30, 1995.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Dan Braha
    • 1
  • Oded Maimon
    • 2
  1. 1.Department of Industrial EngineeringBen Gurion UniversityBeer ShevaIsrael
  2. 2.Department of Industrial EngineeringTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations