메뉴 건너뛰기




Volumn 34, Issue 1, 1998, Pages 219-234

A comparison of setup strategies for printed circuit board assembly

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY MACHINES; PRINTED CIRCUIT BOARDS; PRODUCTION CONTROL;

EID: 0031627962     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(97)00162-9     Document Type: Article
Times cited : (35)

References (18)
  • 2
    • 0030257950 scopus 로고    scopus 로고
    • Replanning and analysis of partial setup strategies in printed circuit board assembly systems
    • Leon, V. J. and Peters, B. A. Replanning and analysis of partial setup strategies in printed circuit board assembly systems. International Journal of Flexible Manufacturing Systems, 8(4), 1996, 389-412.
    • (1996) International Journal of Flexible Manufacturing Systems , vol.8 , Issue.4 , pp. 389-412
    • Leon, V.J.1    Peters, B.A.2
  • 3
    • 0021487364 scopus 로고
    • On optimizing bin picking and insertion plans for assembly robots
    • Drezner, Z. and Nof, S. Y. On optimizing bin picking and insertion plans for assembly robots. IIE Transactions 16(3), 1984, 262-270.
    • (1984) IIE Transactions , vol.16 , Issue.3 , pp. 262-270
    • Drezner, Z.1    Nof, S.Y.2
  • 5
    • 0023981635 scopus 로고
    • Sequencing of insertions in printed circuit board assemblies
    • Ball, M. O. and Magazine, M. J. Sequencing of insertions in printed circuit board assemblies. Operations Research 36, 1988, 192-201.
    • (1988) Operations Research , vol.36 , pp. 192-201
    • Ball, M.O.1    Magazine, M.J.2
  • 6
    • 0024748687 scopus 로고
    • IC insertion: An application of the traveling salesman problem
    • Chan, D. and Mercier, D. IC insertion: an application of the Traveling Salesman Problem. International Journal of Production Research, 27(10), 1989, 1837-1841.
    • (1989) International Journal of Production Research , vol.27 , Issue.10 , pp. 1837-1841
    • Chan, D.1    Mercier, D.2
  • 8
    • 0004570334 scopus 로고
    • Printed circuit board assembly automation - Formulations and algorithms
    • Cincinnati, OH, August
    • Gavish, B. and Seidman, A. Printed circuit board assembly automation - formulations and algorithms. In Proceedings of IXth ICPR. Cincinnati, OH, August 1987.
    • (1987) Proceedings of IXth ICPR
    • Gavish, B.1    Seidman, A.2
  • 11
    • 0028480771 scopus 로고
    • Printed circuit board family grouping and component allocation for a multimachine, open-shop assembly cell
    • Askin, R. G., Dror, M. and Vakharia, A. J. Printed circuit board family grouping and component allocation for a multimachine, open-shop assembly cell. Naval Research Logistics, 41, 1994, 587-608.
    • (1994) Naval Research Logistics , vol.41 , pp. 587-608
    • Askin, R.G.1    Dror, M.2    Vakharia, A.J.3
  • 13
    • 0030126973 scopus 로고    scopus 로고
    • Analysis of partial setups strategies for solving the operational planning problem in parallel machine electronic assembly systems
    • to appear
    • Peters, B. A. and Subramanian, G. S. Analysis of partial setups strategies for solving the operational planning problem in parallel machine electronic assembly systems. International Journal of Production Research, to appear.
    • International Journal of Production Research
    • Peters, B.A.1    Subramanian, G.S.2
  • 14
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • Kernighan, B. W. and Lin, S. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49, 1970, 291-307.
    • (1970) The Bell System Technical Journal , vol.49 , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2
  • 16
    • 84953164255 scopus 로고
    • Application of the similarity coefficient method in group technology
    • September
    • Seifoddini, H. and Wolfe, P. M. Application of the similarity coefficient method in group technology. IIE Transactions, September 1986, 271-277.
    • (1986) IIE Transactions , pp. 271-277
    • Seifoddini, H.1    Wolfe, P.M.2
  • 17
    • 0023173192 scopus 로고
    • A shortest augmenting path algorithm for dense and sparse linear assignment problems
    • Jonker, R. and Volgenant, A. A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 39, 1987, 325-340.
    • (1987) Computing , vol.39 , pp. 325-340
    • Jonker, R.1    Volgenant, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.