메뉴 건너뛰기




Volumn 47, Issue 11, 1996, Pages 1343-1354

Optimal robotic component placement

Author keywords

Integer programming; Production; Robotic component placement; Sequencing

Indexed keywords

INDUSTRIAL ROBOTS; INTEGER PROGRAMMING; OPERATIONS RESEARCH; PRINTED CIRCUIT MANUFACTURE; PRODUCTION; ROBOTICS;

EID: 0030290248     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.170     Document Type: Article
Times cited : (12)

References (11)
  • 1
    • 0024305240 scopus 로고
    • Optimization of the movements of a component placement machine
    • T. Leipala and O. Nevalainen (1989) Optimization of the movements of a component placement machine. Eur. J. Opl Res. 38, 167-177.
    • (1989) Eur. J. Opl Res , vol.38 , pp. 167-177
    • Leipala, T.1    Nevalainen, O.2
  • 2
    • 0021489573 scopus 로고
    • An algorithm for NC turret punch press tool location and hit sequencing
    • R. A. Walas and R. G. ASKIN (1984) An algorithm for NC turret punch press tool location and hit sequencing. HE Trans. 16, 280-287.
    • (1984) HE Trans , vol.16 , pp. 280-287
    • Walas, R.A.1    Askin, R.G.2
  • 3
    • 0023981635 scopus 로고
    • Sequencing of insertions in printed circuit board assembly
    • M. O. Ball and M. J. Magazine (1988) Sequencing of insertions in printed circuit board assembly. Ops. Res. 36, 192-201.
    • (1988) Ops. Res , vol.36 , pp. 192-201
    • Ball, M.O.1    Magazine, M.J.2
  • 4
    • 0002295039 scopus 로고
    • Probabilistic analysis of heuristics
    • E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, Eds.), Wiley, Chichester
    • R. M. Karp and J. M. Steele (1985) Probabilistic analysis of heuristics. In The Traveling Salesman Problem: a Guided Tour of Combinatorial Optimization. (E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, Eds.) pp 181-205. Wiley, Chichester.
    • (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , pp. 181-205
    • Karp, R.M.1    Steele, J.M.2
  • 5
    • 0002938224 scopus 로고
    • Branch and bound methods
    • E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, Eds.), Wiley, Chichester
    • E. Balas and P. Toth (1985) Branch and bound methods. In The Traveling Salesman Problem: a Guided tour of Combinatoral Optimization. (E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, Eds.) pp 361-401. Wiley, Chichester.
    • (1985) The Traveling Salesman Problem: A Guided Tour of Combinatoral Optimization , pp. 361-401
    • Balas, E.1    Toth, P.2
  • 6
    • 0023983796 scopus 로고
    • Component allocation and partitioning for a dual delivery placement machine
    • J. Ahmadi, S. Grotziner and D. Johnson (1988) Component allocation and partitioning for a dual delivery placement machine. Opns. Res. 36, 176-191.
    • (1988) Opns. Res , vol.36 , pp. 176-191
    • Ahmadi, J.1    Grotziner, S.2    Johnson, D.3
  • 7
    • 0027927407 scopus 로고
    • Staging problem of a dual delivery pick-and-place machine in printed card assembly
    • R. H. Ahmadi and P. Kouvelis (1994) Staging problem of a dual delivery pick-and-place machine in printed card assembly. Opns. Res. 42, 81-91.
    • (1994) Opns. Res , vol.42 , pp. 81-91
    • Ahmadi, R.H.1    Kouvelis, P.2
  • 8
    • 0002293349 scopus 로고
    • Matching, Euler tours and the Chinese Postman Problem
    • J. Edmonds and E. L. Johnson (1973) Matching, Euler tours and the Chinese Postman Problem. Math. Prog. 5, 88-124.
    • (1973) Math. Prog , vol.5 , pp. 88-124
    • Edmonds, J.1    Johnson, E.L.2


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