메뉴 건너뛰기




Volumn , Issue , 2007, Pages 251-258

Sequence planning to minimize complexity in mixed-model assembly lines

Author keywords

[No Author keywords available]

Indexed keywords

ASSEMBLY MACHINES; COMPLEX NETWORKS; DYNAMIC PROGRAMMING; MANUFACTURE;

EID: 47849092584     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isam.2007.4288481     Document Type: Conference Paper
Times cited : (23)

References (12)
  • 4
    • 0004160242 scopus 로고
    • chapter 7, Englewood Cliffs, N.J, Prentice Hall
    • K. G. Murty. Network Programming, chapter 7, pages 405-435. Englewood Cliffs, N.J.: Prentice Hall, 1992.
    • (1992) Network Programming , pp. 405-435
    • Murty, K.G.1
  • 5
    • 0032178371 scopus 로고    scopus 로고
    • Product family-based assembly sequence design methodology
    • S. Gupta and V. Krishnan. Product family-based assembly sequence design methodology. IIE Transactions, 30:933-945, 1998.
    • (1998) IIE Transactions , vol.30 , pp. 933-945
    • Gupta, S.1    Krishnan, V.2
  • 10
    • 0000672192 scopus 로고
    • Stimulus information as a determinant of reaction time
    • R. Hyman. Stimulus information as a determinant of reaction time. Journal of Experimental Psychology, 45:188-196, 1953.
    • (1953) Journal of Experimental Psychology , vol.45 , pp. 188-196
    • Hyman, R.1
  • 12
    • 0038572653 scopus 로고
    • Exact and heuristic procedures for the traveling salesman problem with precedence constraints based on dynamic programming
    • L. Bianco, A. Mingozzi, S. Ricciardelli, and M. Spadoni. Exact and heuristic procedures for the traveling salesman problem with precedence constraints based on dynamic programming. INFOR, 32(1):19-31, 1994.
    • (1994) INFOR , vol.32 , Issue.1 , pp. 19-31
    • Bianco, L.1    Mingozzi, A.2    Ricciardelli, S.3    Spadoni, M.4


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