✦ LIBER ✦

The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach

✍ Scribed by W. Böhm; S.G. Mohanty

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 508 KB
Volume: 34
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(93)90031-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lattice path approach to transient solut

Lattice path approach to transient solution of M/M/1 with (0,k) control policy

✍ Kanwar Sen; J.L. Jain; J.M. Gupta 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 469 KB

Transient solution of a finite-capacity

Transient solution of a finite-capacity M/Ga,b/1 queueing system

✍ M. J. Jacob; A. Krishnamoorthy; T. P. Madhusoodanan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

Workload analysis of an M/G/1 queue unde

Workload analysis of an M/G/1 queue under the policy with a set-up time

✍ Jiyeon Lee; Jongwoo Kim 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Reliability of a controllable M/M/2 syst

Reliability of a controllable M/M/2 system with warm standbys operating under the triadic (0, Q, N, M) policy

✍ K.-H. Wang; C.-L. Chang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 704 KB

Analytical solution of the state-depende

Analytical solution of the state-dependent Erlangian queue: M/Ej/1/N with balking

✍ R.O. Al-Seedy 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 205 KB

173 A descriptor approach to the solutio

173 A descriptor approach to the solution of the one-block discrete time distance problem: M.M. Al-Husari, I.M. Jaimoukha, D.J.N. Limebeer, pp 759–762

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 111 KB

## 537 state space of the Mafltov chain is assumed to be infinitely countable and the omt functional to be mirdmiz~l is the infinite time horizon quadratic cost. It is shown that this optimization preblem is equivalent to the mlution of an infinity mumal~ set of coupled algebraic Riccai equstiom (