Circuit card assembly on tandem turret-type placement machines

IIE Transactions (Institute of Industrial Engineers)

Volumn 35, Issue 7, 2003, Pages 627-645

  Wilhelm, Wilbert E ^a   Kiatchaitarmy, Phinsuda ^a  

^a Texas A and M University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PLANNING; POLYNOMIALS; TURRET LATHES;

CIRCUIT CARD ASSEMBLY; POLYNOMIAL-TIME COMPLEXITY; PROCESS PLANNING; TURRET-TYPE PLACEMENT MACHINES;

ELECTRONIC EQUIPMENT MANUFACTURE;

EID: 0038817874     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170304357     Document Type: Article

References (36)

1. Ahuja, R.K., Magnanti, T.L. and Orlin, J.B. (1993) Network Flows, Prentice Hall, Upper Saddle River, NJ
2. Altinkemer, K., Kazaz, B., Köksalan, M. and Moskowitz, H. (2000) Optimization of printed circuit board manufacturing: integrated modeling and algorithms. European Journal of Operational Research, 124, 409-421.
3. Ammons, J.C., Carlyle, M., Crammer, L., De Puy, G., Ellis, K., McGinnis, L.F., Tovey, C.A., and Xu, H. (1997) Component allocation to balance workload in printed circuit card assembly systems, IIE Transactions, 29(4), 265-275.
4. Askin, R.G., Dror, M. and Vakharia, A. (1994) Printed circuit board family grouping and component assignment for a multimachine, open-shop assembly cell. IIE Transactions, 29(4), 265-275.
5. Ball, M. and Magazine, M. (1988) Sequencing of insertions in printed circuit board assembly. Operations Research, 36(2), 192-201.
6. Bard, J.F., Clayton, R.W. and Feo, T.A. (1994) Machine setup and component placement in printed circuit board assembly. The International Journal of Flexible Manufacturing Systems, 6, 5-31.
7. Bertsakis, D.P. (1988) The auction algorithm: a distributed relaxation method for the assignment problem. Annals of Operations Research, 14, 105-123.
8. Crama, Y., Flippo, O., Van de Klundert, J. and Spieksma, F. (1996) The component retrieval problem in PCB assembly. The International Journal of Flexible Manufacturing Systems, 8, 287-312.
9. Crama, Y., Flippo, O.E., Van de Klundert, J. and Spieksma, F.C.R. (1997) The assembly of printed circuit boards: a case with multiple machines and multiple board types. European Journal of Operational Research, 98, 457-472.
10. Crama, Y., Van de Klundert, J. and Spieksma, F.C.R. (1999) Production planning problems in printed circuit board assembly. Technical Report, GEMME 9925, Univeristy of Liege, Liege, Belgium.
11. De Souza, R. and Wu, L. (1995) Intelligent optimization of component onsertion in multi-head concurrent operation PCBA machines. Journal of Intelligent Manufacturing, 6(4), 235-243.
12. Feldmann, K., Franke, J. and Rothhaupt, A. (1993) Automated generating and simulation of insertion sequences, in Proceedings of the IEEE/CHMT International Electronics Manufacturing Technology Symposium, pp. 206-210.
13. Feo, T.A., Bard, J.F. and Holland, S.D. (1996) A GRASP for scheduling printed wiring board assembly. IIE Transactions, 28, 155-165.
14. Gavish, B. and Seidmann, A.(1988) Printed circuit board assembly automation-formulations and algorithms, in Recent Developments in Production Research, Midal A. (ed). Elsevier, St. Louis, MO, pp. 695-717.
15. Grotzinger, S. (1992) Feeder assignment models for concurrent placement machines. IIE Transactions, 24(4) 31-46.
16. Grotzinger, S. and Sciomachen A. (1988) A Petri net characterization of a speed placement machine, in Proceedings of The 38th Electronic Components Conference, Institute of Electrical Engineers, pp. 64-68.
17. Helsgaun, K. (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126, 106-130.
18. Ji, P. and Wan, Y.F. (2001) Planning for printed circuit board assembly: state-of-the-art review, International Journal of Computer Applications in Technology, 14(1), 1-9.
19. Karp, R.W. (1979) A patching algorithm for the nonsymmetric traveling salesman problem. SIAM Journal of Computing, 8, 561-583.
20. Kazaz, B. and Altinkemer, K. (1999) Optimization of printed circuit board manufacturing: a multi-feeder assignment approach. Working Paper Series, Loyola University, Chicago, IL.
21. LaPorte, G. (1992) The traveling salesman problem: an overview of exact and approximate algorithms. European Journal of Operational Research, 59, 231-247.
22. Lawler, E.L., Lenstra, J.K., Rinnoy, Kan, A.H.G. and Shmoys, D.B. (1990) The Traveling Salesman Problem, 4th edn, Wiley, New York, NY.
23. Lee, C.Y., Bard, J., Pinedo, M. and Wilhelm, W.E. (1993) Guidelines for reporting computational results. IIE Transactions, 25(6), 121-123.
24. Leipala, T. and Nevalainen, O. (1989) Optimization of the movements of a component placement machine. European Journal of Operational Research, 38, 167-177.
25. Lin, S. and Kernighan, B.W. (1973) An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21, 498-516.
26. McGinnis, L.F., Ammons, J.C., Carlyle, M., Cranmer, L., Depuy, G.W., Ellis, K.P., Tovey, C.A. and Xu, H. (1992) Automated process planning for printed circuit card assembly. IIE Transactions, 24(4), 18-30.
27. Moyer, L. and Gupta, S.M. (1996) Simultaneous component sequencing and feeder assignment for high speed chip shooter machines. Journal of Electronics Manufacturing, 6(4), 271-305.
28. Moyer, L. and Gupta, S.M. (1997) An efficient assembly sequencing heuristic for printed circuit board configurations. Journal of Electronics Manufacturing, 7(2), 143-160.
29. Moyer, L. and Gupta, S.M. (1998) Development of surface mount assembly process through an angular board orientation. International Journal of Production Research, 36(7), 1857-1881.
30. Nof, S.Y., Wilhelm, W.E. and Warnecke, H. (1997) Industrial Assembly, Chapman and Hall, London, UK.
31. Orlin, J.B. and Ahuja, R.K. (1992) New scaling algorithms for the assignment and minimum mean cycle problems. Mathematical Programming, 54, 41-56.
32. Spieksma, F., Crama, Y. and Van de Klundert, J. (2000) A bibliography of material on the assembly of printed circuit boards. Accessible at hhtp://www.math.unimaas.nl/PERSONAL/fritss/Bibliography/bibliogr.htm.
33. Stewart, W.R. (1987) Accelerated branch exchange heuristics for symmetric traveling salesman problems. Networks, 17, 423-437.
34. Vickson, R.G. and Lu, X. (1998) Optimal product and server locations in one-dimensional storage racks. European Journal of Operational Research, 105, 18-28.
35. Walas, R. and Askin, R. (1984) An algorithm for NC turret punch press tool location and hit sequencing. IIE Transactions, 16(3) 280-287.
36. Yeo, S.H. Low, C.W. and Yong, K.H. (1996) Rule-based frame system for concurrent assembly machines. International Journal of Advanced Manufacturing Technology, 12(5), 370-376.