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

DOI10.1007/S11424-006-0191-4zbMath1106.60073OpenAlexW4231100539MaRDI QIDQ863019

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-0191-4

zbMATH Keywords

recursive algorithmqueue length distributionsupplementary variableremovable serverstate-dependent arrival

Mathematics Subject Classification ID

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

Related Items (3)

Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\)
• Optimal control of a removable server in an M/G/1 queue with finite capacity
• 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
• A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
• 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
• On Time Dependent Queuing Processes
• A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes
• 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
• Optimal Operating Policies for M/G/1 Queuing Systems
• On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes
• 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. II: \newline \(M(n)/G/1/K\)