Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\)

DOI10.1007/s11424-006-0036-1zbMath1106.60072OpenAlexW2035127129MaRDI QIDQ863002

Xiuli Chao, Ayyar Rahman

Publication date: 25 January 2007

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-006-0036-1

zbMATH Keywords

supplementary variableremovable serverrecursive algorithm: queue length distributionstate-dependent service and vacations

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (6)

Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\) ⋮ A recursive algorithm for state dependent \(GI/M/1/N\) queue with Bernoulli-schedule vacation ⋮ Analysis of \(GI/M(n)/1/N\) queue with state-dependent multiple working vacations ⋮ Analysis of general input state dependent working vacation queue with changeover time ⋮ Development of computational algorithm for multiserver queue with renewal input and synchronous vacation ⋮ Discrete-time renewal input state dependent queue with working vacations and change over time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\)
• Optimal control of a removable server in an M/G/1 queue with finite capacity
• Queueing systems with vacations - a survey
• The optimal strategy structure of an intermittently operated service channel
• Optimal control of an M/G/1 queuing system with removable server via diffusion approximation
• Analysis of multi-server queues with station and server vacations
• A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues
• A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
• The GI/M/1 queue with exponential vacations
• On the finite-buffer bulk-service queue with general independent arrivals: \(GI/M^{[b}/1/N\)]
• GI/M/1 Queue with Server Vacations
• Control Policies for the M^X/G/1 Queueing System
• A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes
• Utilization of Idle Time in an M/G/1 Queueing System
• Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies
• Optimal Operation of an M/G/1 Priority Queue with Removable Server
• Optimal Control of an M/E_k/1 Queueing System with a Removable Service Station
• The Finite Capacity GI/M/1 Queue with Server Vacations
• Optimal Operating Policies for M/G/1 Queuing Systems
• Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server

This page was built for publication: Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\)