수송알고리즘에 의한 칩마운터의 조립순서계획

An Assembly Sequence Planning of a Chip Mounter Using Transportation Algorithm

  • 박태형 (충북대학교 전기전자 공학부) ;
  • 김철한 (충북대학교 제어계측공학과 대학원)
  • 발행 : 2000.09.01

초록

A sequence planning method is proposed to reduce the assembly time of gantey-type chip mounters with single head. The overall path of the chip mounter is divided into forward and backward path, and formulate the optimization problem is formulated as an transpoetation problem and an Euler's tour problem. The transportation alforithm is applied to find optimal backward path, and Euler's tour algorithm used to generate an assembly sequence. Simulation results are presented to verify the usefulness of the proposed method.

키워드

참고문헌

  1. T. L. Landers, W D. Brown et. al., Electronics Manufacturing Processes. Prentice-Hall, 1994
  2. 박태형, '전자조립용 CAM 시스템의 기술동향', 전자공학회지, 제26권, 제3호, pp. 48-61, 1999
  3. A. R. Hidde and A. Gierse, 'An AIbased manufacturing design rule checker and pathptimizer for PCB production preparation and manufacturing'. IEEE Trans, on Components. Hybrid, and Manufacturing Technology, vol. 15. no. 3. pp. 299-305, 1992 https://doi.org/10.1109/33.148494
  4. 박태형, Path Optimizer 활용법, 삼성항공산업(주), 1998
  5. R. Kumar and H. Li, 'Integer programming approach to printed circuit board assembly time optimi-zation'. IEEE Trans. on Components, Packaging, and Manufacturing Technology, Part-B: Advanced Packaging, vol. 18, no. 4, pp. 720-727, 1995 https://doi.org/10.1109/96.475281
  6. I. Or and E. Duman. ''Optimization issues in automated production of printed circuit boards: operations sequencing, feeder configurations and liad balancing problems', Proc. 1996 IEEE Conf. on Emerging Technology and Factory Automation, pp. 227-232, 1996
  7. W. Wang, P. C. Nelson, and T. M Tirpak, 'Optimization of high-speed multistation SMT placement machine using evolutionary algorithms', IEEE Trans. on Electronics Packaging Manu-factoring vol. 22, no. 2, pp. 137-145, 1999 https://doi.org/10.1109/6104.778173
  8. J. Sohn and S. Park, 'Efficient operation of a surface mounting machine with a multihead turret', International J. of Production Research, vol. 34, no. 4, pp 1131-1143, 1996 https://doi.org/10.1080/00207549608904954
  9. S. H. Lee, B. H. Lee, and T. H. Park, 'A hierarchical method to improve the productivity of a multi-head surface mounting machine', Proc. of the 1999 IEEE Int. Conf. on Robotics & Automation, pp. 2110-2115, 1999 https://doi.org/10.1109/ROBOT.1999.770418
  10. M. O. Ball and M. J. Magazine, 'Sequence of inser tions in printed circuit board assembly', Operations Research, vol. 36, no. 2. pp. 192-201. 1988
  11. D. A. Andreou, 'Optimization of the traveling sequence of a 'pick and place' robot by simulating its operation as a traveling salesman problem', Proc 21st Annual Simulation Symposium, pp. 91-105, 1988
  12. L. F. Mcgmnis, J. C. Ammons, M. C, Carlyle et. al., 'Automated process planning for printed circuit card assembly'. IIE Transactions, vol. 24, no. 4, 1992
  13. M. C. Leu, PI. Wong, and Z. Li, 'Planning of component placement / insertion sequence and feeder setup in PCB assembly using genetic algorithm', Journal of Electronic Paclwging in Trans. of the ASME, vol. 115, 1993
  14. K. G. Murty, Network Programming, Prentice-Hall. 1992. U.S.A
  15. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows, Prentice-Hall, 1993. U.S.A
  16. M. S. Bazaraa, J. J. Jarvis, and H, D. Sherali, Linear Programming and Network Flows, Wiley, 1990., Singapore
  17. J. B. Orlin, 'A faster strongly polynomial minimum cost flow algorithm', Proc. 20th ACM Symposium on the Theory of Computation, pp. 377-387, 1988 https://doi.org/10.1145/62212.62249
  18. D. M. Etter. Engineering Problem Solving with Matlab, Prentice-Hall, 1997
  19. B. Golden. B. T. Doyle, and W, Stewart, 'Approximate traveling salesman algorithms'. Operations Research. vol 28, no. 3, pp. 694-710. 1980