A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity

DOI10.1016/S0377-2217(01)00317-4zbMath1081.90528OpenAlexW2080536029MaRDI QIDQ1847265

Kuo-Hsiung Wang, Jau-Chuan Ke

Publication date: 17 November 2002

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00317-4

zbMATH Keywords

G/M/1 queueSteady-state probabilityRecursive methodSupplementary variableRemovable server

Mathematics Subject Classification ID

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

Related Items

Design of a fuzzy finite capacity queuing model based on the degree of customer satisfaction: analysis and fuzzy optimization, Analysis of the GI/Geo/1 queue with \(N\)-policy, On an M/G/1 queue in random environment with Min(N, V) policy, Analytical and computational aspects of the infinite buffer single server \(N\) policy queue with batch renewal input, Cost optimization and ANFIS computing of an unreliable M/M/1 queueing system with customers' impatience under \(N\)-policy, On the distribution of the number stranded in bulk-arrival, bulk-service queues of the M/G/1 form, Random \(N\)-policy Geo/G/1 queue with startup and closedown times, The \(N\) threshold policy for the \(GI/M/1\) queue, Optimal control of an \(M/G/1/K\) queueing system with combined \(F\) policy and startup time, A discrete queue with double thresholds policy and its application to SVC systems, A recursive method for the \(F\)-policy \(G/M/1/K\) queueing system with an exponential startup time, Bootstrapping Computation of Availability for a Repairable System with Standby Subject to Imperfect Switching, Relationship between randomized \(F\)-policy and randomized \(N\)-policy in discrete-time queues, Analysis of an \(N\)-policy GI/M/\(1\) queue in a multi-phase service environment with disasters, Algorithmic computation of steady-state probabilities in an almost observable \(GI/M/c\) queue with or without vacations under state dependent balking and reneging, Optimal strategy analysis of an \(N\)-policy \(M[x/M/1\) queueing system with a removable and non-reliable server], Age-based Markovian approximation of the G/M/1 queue, The principal-agent problem for service rate event-dependency, Availability of a repairable retrial system with warm standby components

Cites Work

• Unnamed Item
• Unnamed Item
• \(M/G/1/K\) queues with \(N\)-policy and setup times
• 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 Poisson input queue under \(N\)-policy and with a general start up time
• On the \(M/G/1\) machine interference model with spares
• A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
• A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
• On the finite-buffer bulk-service queue with general independent arrivals: \(GI/M^{[b}/1/N\)]
• 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 strategy in N-policy production system with early set-up
• 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
• Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server