An analysis of queueing systems with multi-task servers.

DOI10.1016/S0377-2217(03)00015-8zbMath1056.90041MaRDI QIDQ1429937

Zhe George Zhang, Nai-shuo Tian

Publication date: 27 May 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00015-8

zbMATH Keywords

\(M/M/c\) queue; Asynchronous vacations; Matrix geometric solutions; Multi-tasks; Quasi-birth and death process; Stochastic decomposition

Mathematics Subject Classification ID

90B22: Queues and service in operations research

Related Items

Analysis of a batch service multi-server polling system with dynamic service control, Unreliable multiserver queueing system with modified vacation policy, On the modelling and performance measurement of service networks with heterogeneous customers, \(\mathrm{M}/\mathrm{M}/c\) multiple synchronous vacation model with gated discipline, A two threshold vacation policy in multiserver queueing systems, The Israeli Queue with Priorities, AN M/M/1 QUEUE IN RANDOM ENVIRONMENT WITH DISASTERS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Control of the service process in a queueing system
• Queueing systems with vacations - a survey
• Exponential two server queue with \(N\)-policy and general vacations
• Analysis of multi-server queues with station and server vacations
• Phase-type representations for matrix-geometric solutions
• Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
• Exponential Queues with Server Vacations
• Optimal Operation of an M/M/2 Queue with Removable Servers
• Technical Note—Turning Off a Server with Customers Present: Is This Any Way to Run an M/M/c Queue with Removable Servers?
• An M/M/s Queue With Servers’ Vacations
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Conditional stochastic decompositions in the M/M/c queue with server vacations
• Decomposition formulas for single server queues with vacations : a unified approach by the rate conservation law
• A conservation law for a wide class of queueing disciplines