.png){kind=icon}
Return
Queue decomposition & finite closed queueing network models
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2014.08.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Closed, finite queueing networks are applicable to many different manufacturing and service system settings. The incorporation of material handling and transportation networks in finite buffer closed queueing networks is studied. A novel queue decomposition approach using state dependent queues to capture the buffer of finite M/M/1/K queues is shown to be a viable approach for modelling these systems. Each M/M/1/K queue is replaced with a coupled state dependent queue plus an M/M/1 queue. An extended mean value analysis (MVA) algorithm is employed to demonstrate the integration of the state dependent queues for the buffers in the approach. Under certain restrictions concerning the network population, finite queueing networks with the state dependent queues acting as buffers should have a product form distribution. This paper focuses on M/M/1/K queues and their transformation while future papers will treat the multi-server case. Several different closed series (i.e. cyclic), merge, and split topological systems of finite queues are analyzed and presented. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Closed
Finite networks
M/M/1/K
M/M/c/K
M/G/c/c Queues
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
Cost analysis of chronic heart failure management in Malaysia: A multi-centred retrospective study
OAAI
OAAIShareSaveShareSave
View more