.png){kind=icon}
.png){kind=icon}
Return
An approximation for computing the throughput of closed assembly-type queueing networks
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00390-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we examine throughput (mean number of completed assemblies per unit time) of closed assembly type queueing networks where machine processing times are drawn from general distributions. The system dynamics are characterized via a set of stochastic difference equations; it is shown that the system state can be modeled by a discrete index Markov chain on a continuous state space. Standard Markovian analysis is employed to derive an approximate expression for system throughput, following discretisation of state space. Four examples of CONWIP (CONstant Work IN Process) systems are given that illustrate the results. (C) 1999 Published by Elsevier Science B.V. All rights reserved.
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
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available