Abstract

This paper proposes a heuristic algorithm to efficiently perform line balancing in the PCB assembly line including multiple surface mounters efficiently. Generally, the problems in line balancing are classified into two kinds. Firstly, is the determining of the minimum number of machines required for achieving the desired production rate. Secondly, is the assign of jobs to multiple machines in order to minimize the cycle time which is defined as a maximum among the working times of machines when the number of machines is fixed. In this paper, we deal with the latter. We consider a PCB assembly line, including the multiple surface mounters arranged serially as a target system. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering that the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. The algorithm is validated through computer simulation, the results of which show that their shapes coincide nearly with those of optimal line balancing efficiency graphs regardless of the number of components, the performance of surface mounters, and the structure of assembly line.

주제어

#line balancing(LB)   #cycle time   #PCB assembly   #surface mounter   #binary search  

저자의 다른 논문

참고문헌 (16)

1. MUST - A multiple solutions technique for balancing single-model assembly lines , E. M. Dar-El;Y. Rubinovitch , Mgmt. Sci. / v.25,pp.1105-1115, 1979
   
2. A heuristic method of assembly line balancing for assumptions of constant or variable work element times , C. L. Moodie;H. H. Young , IE / v.16,pp., 1965
   
3. An integer-programming algorithm with network cuts for solving the assembly line balancing problem , F. B. Talbot;J. H. Patterson , Mgmt. Sci. / v.30,pp.85-89, 1984
   
4. Fast, effective algorithms for simple assembly line balancing problem , S. T. Hackman;M. J. Magazine;T. S. Lee , Oper. Res. / v.37,pp.916-924, 1989
   
5. 표면실장기용 인-라인 시스템의 최적화에 관한 연구 , 김진철 , 서울대학교 공학석사 학위논문 / v.,pp., 1996
   
6. MALB - A heuristic technique for balancing large single-model assembly lines , E. M. Dar-El , AIIE Trans. / v.5,pp.343-356, 1973
   
7. F. M. Tonge , A heuristic programm of assembly line balancing / v.,pp., 1961
   
8. A survey of exact algorithms for the simple assembly line balancing problems , I. Baybars , Mgmt. Sci. / v.32,pp.909-932, 1986
   
9. 표면실장기용 인-라인 시스템의 최적화에 관한 연구 , 김진철;이성한;홍지민;김대원;이범희 , 한국 자동제어 학술회의 논문집 국내학술편 / v.,pp.719-722, 1995
   
10. An efficient branch and bound algorithm for an assemblyl line balancing problem - part Ⅱ. maximize the production rate , M. S. Magazine;T. S. Wee , Working Paper 150 / v.,pp., 1981
    
11. An analysis of a computer method of sequencing assembly line operations , A. L. Arcus , Ph.D.dissertation, University of California / v.,pp., 1963
    
12. Dynamic programming solution of sequencing problems with precedence constraints , L. Schrage;K. R. Baker , Oper. Res. / v.26,pp.444-449, 1978
    
13. Assembly line balancing using the ranked positional weight technique , W. P. Helgeson;D. P. Birnie , IE / v.12,pp.394-398, 1961
    
14. An efficient branch and bound algorithm for an assemblyl line balancing problem - part Ⅰ. minimize the number of work stations , M. S. Magazine;T. S. Wee , Working Paper 150 / v.,pp., 1981
    
15. Assembly line balancing with a precedence matrix , T. R. Hoffmann , Mgmt. sci. / v.9,pp.551-562, 1963
    
16. A comparative evaluation of heuristic line balancing techniques , F. B. Talbot;J. H. Patterson , Mgmt. Sci. / v.32,pp.430-454, 1986
    

이 논문을 인용한 문헌 (0)

1. 이 논문을 인용한 문헌 없음