분기 및 접합형태를 갖는 대기행렬 모형의 근사적인 분석An Approximate Analysis of the Fork-Join Queue
e present an approximate algorithmic approach for the m-server fork-join queueing system with infinite queue capacity. We analyze the system size and queue waiting time. We assume Poisson arrival process and independent exponential service times.
- Publisher
- 대한산업공학회
- Issue Date
- 1996
- Language
- Korean
- Citation
대한산업공학회지, v.22, no.3, pp.377 - 385
- ISSN
- 1225-0988
- Appears in Collection
- IE-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.