𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Threshold policies for controlled retrial queues with heterogeneous servers

✍ Scribed by Dimitri frosinin; L. Breuer

Publisher
Springer US
Year
2006
Tongue
English
Weight
584 KB
Volume
141
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Markovian queueing systems with retrials
Markovian queueing systems with retrials and heterogeneous servers
✍ B. Pourbabai πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 410 KB

The asymptotic performances of a random access and an ordered entry G/M/K/O queueing system with a stationary counting arrival process, K heterogeneous parallel servers, no waiting room and retrials are approximated based on a two-parameter method. In a random access system, units upon arrival are r

Threshold control by a single-server ret
Threshold control by a single-server retrial queue with batch arrivals and group services
✍ Che Soong Kim; Aliaksandr Kanechny; Alexander Dudin πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 192 KB

A controlled single-server retrial queueing system is investigated. Customers arrive according to batch Markovian arrival process. The system has several operation modes which are controlled by means of a threshold strategy. The stationary distribution is calculated. Optimization problem is consider

Stochastic inequalities for retrial queu
Stochastic inequalities for retrial queues with vacations and constant retrial policy
✍ Mohamed Boualem; Natalia Djellab; Djamil AΓ―ssani πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 430 KB

In this paper, we consider an M/G/1 retrial queue with vacations and we derive several stochastic comparison properties in the sense of strong stochastic ordering and convex ordering. The stochastic inequalities provide simple insensitive bounds for the stationary queue length distribution.

Dynamic server assignment policies for a
Dynamic server assignment policies for assembly-type queues with flexible servers
✍ Yi-Chun Tsai; Nilay TanΔ±k Argon πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 194 KB

## Abstract We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a