메뉴 건너뛰기




Volumn 24, Issue 9-10, 2004, Pages 752-763

A systematic approach for automatic assembly sequence plan generation

Author keywords

Assembly sequences planning; Liaison matrix Precedence relations

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER PROGRAMMING; COMPUTER SIMULATION; CONSTRAINT THEORY; FORMAL LOGIC; GRAPH THEORY;

EID: 9944252896     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-1760-5     Document Type: Article
Times cited : (46)

References (25)
  • 2
    • 0023537240 scopus 로고
    • Simplified generation of all mechanical assembly sequences
    • De Fazio TL, Whitney DE (1987) Simplified generation of all mechanical assembly sequences. IEEE J Robot Autom 3(6):640-658
    • (1987) IEEE J Robot Autom , vol.3 , Issue.6 , pp. 640-658
    • De Fazio, T.L.1    Whitney, D.E.2
  • 6
    • 0030130245 scopus 로고    scopus 로고
    • Boundary models for assembly knowledge representation
    • Thomas JP, Nissanke N, Baker KD (1996) Boundary models for assembly knowledge representation. IEEE Trans Robot Autom 12(2):302-312
    • (1996) IEEE Trans Robot Autom , vol.12 , Issue.2 , pp. 302-312
    • Thomas, J.P.1    Nissanke, N.2    Baker, K.D.3
  • 10
    • 0027052183 scopus 로고
    • Automated sequencing subassembly detection in assembly planning
    • Dini G, Santochi M (1992) Automated sequencing subassembly detection in assembly planning. Ann CIRP 41(1)1-4
    • (1992) Ann CIRP , vol.41 , Issue.1 , pp. 1-4
    • Dini, G.1    Santochi, M.2
  • 11
    • 0029483649 scopus 로고
    • An integrated approach to the generation of assembly sequences
    • Gottipolu RB, Ghosh K (1995) An integrated approach to the generation of assembly sequences. Int J Comput Appl Technol8: 125-138
    • (1995) Int J Comput Appl Technol , vol.8 , pp. 125-138
    • Gottipolu, R.B.1    Ghosh, K.2
  • 13
    • 0242648739 scopus 로고
    • Automatic precedence relationship extraction for assembly sequence generation
    • Linn RJ, Tu H Y (1993) Automatic precedence relationship extraction for assembly sequence generation. J Des Manuf 3:105-119
    • (1993) J des Manuf , vol.3 , pp. 105-119
    • Linn, R.J.1    Tu, H.Y.2
  • 15
    • 0030129093 scopus 로고    scopus 로고
    • Minimal precedence constraints for integrated assembly execution planning
    • Rajan VN, Nof SY (1996) Minimal precedence constraints for integrated assembly execution planning. IEEE Trans Robot Autom 12(2): 175-186
    • (1996) IEEE Trans Robot Autom , vol.12 , Issue.2 , pp. 175-186
    • Rajan, V.N.1    Nof, S.Y.2
  • 17
    • 0027066109 scopus 로고
    • Planning of products assembly disassembly
    • Laperrière L, El Maraghy HA (1992) Planning of products assembly disassembly. Ann CIRP 41(1):5-9
    • (1992) Ann CIRP , vol.41 , Issue.1 , pp. 5-9
    • Laperrière, L.1    El Maraghy, H.A.2
  • 18
    • 0029707115 scopus 로고    scopus 로고
    • ASPEN: Computer-aided assembly sequence planning evaluation system based on predetermined time standard
    • Kanai S, Takahashi H, Makino H (1996) ASPEN: computer-aided assembly sequence planning evaluation system based on predetermined time standard. Ann CIRP 45(1):35-39
    • (1996) Ann CIRP , vol.45 , Issue.1 , pp. 35-39
    • Kanai, S.1    Takahashi, H.2    Makino, H.3
  • 19
    • 0028603951 scopus 로고
    • Assembly sequences planning for simultaneous engineering applications
    • Laperrière L, El Maraghy HA (1994) Assembly sequences planning for simultaneous engineering applications. Int J Adv Manuf Technol 9:231-244
    • (1994) Int J Adv Manuf Technol , vol.9 , pp. 231-244
    • Laperrière, L.1    El Maraghy, H.A.2
  • 21
    • 0035866455 scopus 로고    scopus 로고
    • Disassembly sequence plan generation using a branch-and-bound algorithm
    • Güngör A, Gupta M (2001) Disassembly sequence plan generation using a branch-and-bound algorithm. Int J Prod Res 39(1):481-509
    • (2001) Int J Prod Res , vol.39 , Issue.1 , pp. 481-509
    • Güngör, A.1    Gupta, M.2
  • 23
    • 0007951148 scopus 로고
    • A methodology for analysis operations' difficulty
    • Ben-Arieh D (1994) A methodology for analysis operations' difficulty. Int J Prod Res 32(8):1879-1895
    • (1994) Int J Prod Res , vol.32 , Issue.8 , pp. 1879-1895
    • Ben-Arieh, D.1
  • 24
    • 0032689335 scopus 로고    scopus 로고
    • Generation of optimized assembly sequences using genetic algorithms
    • Dini G, Failli F, Lazzerini B, Marcelloni F (1999) Generation of optimized assembly sequences using genetic algorithms. Ann CIRP 48(1):17-20
    • (1999) Ann CIRP , vol.48 , Issue.1 , pp. 17-20
    • Dini, G.1    Failli, F.2    Lazzerini, B.3    Marcelloni, F.4


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