An approximate product form for a class of degradable queueing networks
✍ Scribed by Bruno Müller-Clostermann
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 591 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0166-5316
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes fr
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 dierence equations; it is shown that t