Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\)
type: Item
instance of: scholarly article
title: Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\)
zbMATH Open document ID: 1106.60073
author: Xiuli Chao
author: Ayyar Rahman
published in: Journal of Systems Science and Complexity
publication date: 2007-01-25T00:00:00Z
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 5118532
zbMATH Keywords: queue length distribution
zbMATH Keywords: recursive algorithm
zbMATH Keywords: removable server
zbMATH Keywords: state-dependent arrival
zbMATH Keywords: supplementary variable
MaRDI profile type: Publication
full work available at URL: s11424-006-0191-4
OpenAlex ID: W4231100539
cites work: Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\)
cites work: Q3227941
cites work: On Time Dependent Queuing Processes
cites work: Q5575243
cites work: Q4070100
cites work: A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
cites work: Optimal Operating Policies for M/G/1 Queuing Systems
cites work: Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server
cites work: Optimal Operation of an M/G/1 Priority Queue with Removable Server
cites work: The optimal strategy structure of an intermittently operated service channel
cites work: Optimal control of an M/G/1 queuing system with removable server via diffusion approximation
cites work: Optimal control of a removable server in an M/G/1 queue with finite capacity
cites work: Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies
cites work: Optimal Control of an M/Ek/1 Queueing System with a Removable Service Station
cites work: A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
cites work: On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes
cites work: A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes
cites work: A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues
DOI: 10.1007/S11424-006-0191-4
description: scientific article; zbMATH DE number 5118532