메뉴 건너뛰기




Volumn 42, Issue 4, 2004, Pages 651-675

Exact analysis of a discrete material three-station one-buffer merge system with unreliable machines

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTER SIMULATION; INSPECTION; JOB ANALYSIS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; QUALITY CONTROL;

EID: 1342308560     PISSN: 00207543     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207540310001602838     Document Type: Article
Times cited : (36)

References (16)
  • 1
    • 0024070564 scopus 로고
    • An efficient algorithm for the analysis of transfer lines with unreliable machines and finite buffers
    • Dallery, Y., David, R. and Xie, X., 1988, An efficient algorithm for the analysis of transfer lines with unreliable machines and finite buffers. IIE Transactions, 20(3), 280-283.
    • (1988) IIE Transactions , vol.20 , Issue.3 , pp. 280-283
    • Dallery, Y.1    David, R.2    Xie, X.3
  • 2
    • 34249834508 scopus 로고
    • Manufacturing flow line systems: A review of models and analytical results
    • Special issue on queuing models of manufacturing systems
    • Dallery, Y., and Gershwin, S. B., 1992, Manufacturing flow line systems: A review of models and analytical results. Queueing Systems Theory and Applications, 12, 3-94: Special issue on queuing models of manufacturing systems.
    • (1992) Queueing Systems Theory and Applications , vol.12 , pp. 3-94
    • Dallery, Y.1    Gershwin, S.B.2
  • 3
    • 84873013614 scopus 로고
    • Modeling and analysis of assembly systems with unreliable machines and finite buffers
    • Di Mascolo, M., David, R., and Dallery, Y., 1991, Modeling and Analysis of assembly systems with unreliable machines and finite buffers. IIE Transactions, 23(4), 315-331.
    • (1991) IIE Transactions , vol.23 , Issue.4 , pp. 315-331
    • Di Mascolo, M.1    David, R.2    Dallery, Y.3
  • 4
    • 0023315347 scopus 로고
    • An efficient decomposition algorithm for the approximate evaluation of tandem queues with finite storage space and blocking
    • Gershwin, S. B., 1987, An efficient decomposition algorithm for the approximate evaluation of tandem queues with finite storage space and blocking. Operations Research, 35, 291-305.
    • (1987) Operations Research , vol.35 , pp. 291-305
    • Gershwin, S.B.1
  • 5
    • 0000440767 scopus 로고
    • Assembly/disassembly systems: An efficient decomposition algorithm for tree structured networks
    • Gershwin, S. B., 1991, Assembly/disassembly systems: An efficient decomposition Algorithm for tree structured networks. IIE Transactions, 23(4), 302-314.
    • (1991) IIE Transactions , vol.23 , Issue.4 , pp. 302-314
    • Gershwin, S.B.1
  • 7
    • 0034288452 scopus 로고    scopus 로고
    • Design and operation of manufacturing systems: The control-point policy
    • Gershwin, S. B., 2000, Design and operation of manufacturing systems: the control-point policy. IIE Transactions, 32, 891-906.
    • (2000) IIE Transactions , vol.32 , pp. 891-906
    • Gershwin, S.B.1
  • 9
    • 0002630866 scopus 로고    scopus 로고
    • Decomposition of unreliable assembly/disassembly networks with limited buffer capacity and random processing times
    • Helber, S., 1998, Decomposition of unreliable assembly/disassembly networks with limited buffer capacity and random processing times. European Journal of Operational Research, 109, 24-42.
    • (1998) European Journal of Operational Research , vol.109 , pp. 24-42
    • Helber, S.1
  • 11
    • 24444440566 scopus 로고    scopus 로고
    • Exact analysis of a continuous material merge system with limited buffer capacity and three stations
    • D-38678, Clausthal-Zellerfeld
    • Helber, S., and Mehrtens, N., 2001, Exact analysis of a continuous material merge system with limited buffer capacity and three stations. D-38678, Clausthal-Zellerfeld.
    • (2001)
    • Helber, S.1    Mehrtens, N.2
  • 12
    • 0024699977 scopus 로고
    • A recursive algorithm for generating the transition matrices of multistation series production lines
    • Papadopoulos, H. T., and O'Kelly, M. E. J., 1989, A Recursive algorithm for generating the transition matrices of multistation series production lines. Computers in Industry, 12, 227-240.
    • (1989) Computers in Industry , vol.12 , pp. 227-240
    • Papadopoulos, H.T.1    O'Kelly, M.E.J.2
  • 14
    • 0035831088 scopus 로고    scopus 로고
    • A three station merge system with unreliable stations and a shared buffer
    • Tan, B., 2001. A three station merge system with unreliable stations and a shared buffer. Mathematical and Computer Modeling, 33, 1011-1026.
    • (2001) Mathematical and Computer Modeling , vol.33 , pp. 1011-1026
    • Tan, B.1
  • 15
    • 0030916278 scopus 로고    scopus 로고
    • Analysis of multistation production systems with limited buffer capacity, Part II
    • Tan, B., and Yeralan, S., 1997, Analysis of multistation production systems with limited buffer capacity, Part II. Mathematical and Computer Modelling, 25(11), 109-123.
    • (1997) Mathematical and Computer Modelling , vol.25 , Issue.11 , pp. 109-123
    • Tan, B.1    Yeralan, S.2
  • 16
    • 0030916278 scopus 로고    scopus 로고
    • Analysis of multistation production systems with limited buffer capacity, Part I
    • Yeralan, S., and Tan, B., 1997, Analysis of multistation production systems with limited buffer capacity, Part I. Mathematical and Computer Modeling, 25(7), 109-122.
    • (1997) Mathematical and Computer Modeling , vol.25 , Issue.7 , pp. 109-122
    • Yeralan, S.1    Tan, B.2


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