✦ LIBER ✦

An approximate analysis for a class of assembly-like queues

✍ Scribed by F. Bonomi

Book ID: 112487910
Publisher: Springer US
Year: 1987
Tongue: English
Weight: 770 KB
Volume: 1
Category: Article
ISSN: 0257-0130
DOI: 10.1007/bf01149540

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation method for a class of q

An approximation method for a class of queueing systems

✍ Oliver C. Ibe; Kiyoshi Maruyama 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 544 KB

An approximate product form for a class

An approximate product form for a class of degradable queueing networks

✍ Bruno Müller-Clostermann 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Delay Analysis of Interacting Queues wit

Delay Analysis of Interacting Queues with an Approximate Model

✍ Ephremides, A.; Rong-Zhu Zhu 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 734 KB

An analysis of an approximation algorith

An analysis of an approximation algorithm for queueing networks

✍ Derek L Eager; Kenneth C Sevcik 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 628 KB

On a class of approximations for closed

On a class of approximations for closed queueing networks

✍ F. P. Kelly 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 384 KB

An approximation for computing the throu

An approximation for computing the throughput of closed assembly-type queueing networks

✍ Hayriye Ayhan; Martin A. Wortman 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 225 KB

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