.png){kind=icon}
Return
Throughput bounding and simple approximation methods for exponential fork join queueing networks with blocking
.png){kind=icon}
PRE
AI
DOI：10.1016/S0360-8352(98)00159-4.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Exponential fork/join queueing networks (FJQNs) with finite buffers have been used as a major tool for evaluating the performances of manufacturing systems. In this study, we first suggest the throughput upper and lower bounds. Our upper-bounding method is elaborated on with general network configuration (acyclic configuration), while our lower bounds can be obtained only for networks with more specialized configuration. Next developed is a simple approximation method for throughputs, which are based on decomposition/aggregation principles and structurally equivalent relations between different configurations. (C) 1998 Elsevier Science Ltd. All rights reserved.
Keywords:
fork/join queueing networks
bounds
approximations
equivalencies
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave no more
no more