Abstract
Two major problems faced in the automated assembly of printed circuit boards are the determination of a component placement sequence and the internal arrangement of the component tapes in the feeder mechanism. The forms of these problems depend mainly on the physical design of the placement machine. The definition and solution of these optimization problems are attempted by many researchers and it is possible to find lots of relevant papers in the literature. However, most of these studies are concentrated on certain machine designs. In this study, the focus is on a particular machine type that has a rotational turret and a stationary component magazine. So far, this type of machine has received little attention among the researchers. The definition of the placement sequencing and feeder configuration problems are given and solution procedures are suggested. The performance of the suggested procedures are tested on real and randomly generated PCB assembly data.
Similar content being viewed by others
References
Balas E (1989). The prize collecting traveling salesman problem. Networks 19: 621–636.
Ball MO and Magazine MJ (1988). Sequencing of insertions in printed circuit board assembly. Opns Res 36: 192–201.
Bard J, Clayton R and Feo T (1994). Machine setup and component placement in printed circuit board assembly. Int J Flexible Manufact Syst 6: 5–31.
Bozer YA, Shorn EC and Sharp GP (1990). Geometric approaches to solve chebyshev traveling salesman problem. IIE Transac 22: 238–254.
Chan D (1993). Precedence constrained TSP applied to circuit board assembly and no wait flow-shop. Int J Product Res 31: 2171–2177.
Crama Y, Flippo OE, van de Klundert J and Spieksma FCR (1996). The component retrieval problem in printed circuit board assembly. Int J Flexible Manufact Syst 8: 287–312.
Drezner Z and Nof SY (1984). On optimizing bin packing and insertion plans for assembly robots. IIE Transac 16/3: 262–270.
Duman E (1998). Optimization issues in automated assembly of printed circuit boards. PhD thesis, Bogazici University.
Duman E and Or I (2002). Constrained multiple TSP arising in printed circuit board assembly. In: Lessing H (ed). Proceedings of the International Conference on Engineering Technology Research. Vaal Triangle Technikon, Vanderbijlpark, South Africa, pp 9–13.
Duman E and Or I (2004). Precedence constrained TSP arising in printed circuit board assembly. Int J Product Res 42: 67–78.
Duman E and Or I (2006). The quadratic assignment problem in the context of the printed circuit board assembly process. Comput Opns Res (in press).
Foulds LR and Hamacher HW (1993). Optimal bin location and sequencing in printed circuit board assembly. Eur J Opl Res 66: 279–290.
Gronalt M, Grunow M, Günther HO and Zeller R (1997). A heuristic for component switching on SMT placement machines. Int J Product Econom 53: 181–190.
Grotzinger S (1992). Feeder assignment models for concurrent placement machines. IIE Transac 24(4): 31–47.
Grunow M, Günther HO and Föhrenbach A (2000). Simulation-based performance analysis and optimization of electronics assembly equipment. Int J Product Res 38: 4247–4259.
Ji P and Wan YF (2001). Planning for printed circuit board assembly: the state-of-the-art review. Int J Comput Appl Technol 14: 136–144.
Leipälä T and Nevalainen O (1989). Optimizaton of the movements of a component placement machine. Eur J Opl Res 38: 167–177.
Lin S (1965). Computer solutions of the traveling salesman problem. Bell System Technol J 44: 2245–2269.
Loh TS, Bukkapatnam STS, Medeiros D and Kwon H (2001). A genetic algorithm for sequential part assignment for PCB assembly. Comput Indust Eng 40: 293–307.
McGinnis LF et al (1992). Automated process planning for printed circuit card assembly. IIE Transac 24(4): 18–29.
Moyer LK and Gupta SM (1996). SMT feeder slot assignment for predetermined component placement paths. J Electron Manufac 6: 172–192.
Ng MK (1998). Heuristics approach to printed circuit board insertion problem. J Opl Res Soc 49: 1051–1059.
Nurmi K (1991). Traveling salesman problem tools for microcomputers. Comput Opns Res 18: 741–749.
Ohno K, Jin Z and Elmaghraby S (1999). An optimal assembly mode for multi-type printed circuit boards. Comput Indust Engin 36: 451–471.
Or I (1976). Traveling salesman type combinatorial problems and their relation to the logistics of blood banking. PhD thesis, Northwestern University.
Sohn J and Park S (1996). Efficient operation of a surface mounting machine with a multihead turret. Int J Product Res 34: 1131–1143.
Stewart WR (1977). A computationally efficient heuristic for the traveling salesman problem. Proceedings of the 13th Annual Meeting of Southeastern TIMS, Myrtle Beach, SC, USA, pp 75–83.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Duman, E. Modelling the operations of a component placement machine with rotational turret and stationary component magazine. J Oper Res Soc 58, 317–325 (2007). https://doi.org/10.1057/palgrave.jors.2602152
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2602152