Analytical and computational aspects of the infinite buffer single server \(N\) policy queue with batch renewal input

DOI10.1016/j.cor.2020.104916zbMath1458.90205OpenAlexW3005845762MaRDI QIDQ2185528

U. C. Gupta, F. P. Barbhuiya

Publication date: 4 June 2020

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.104916

zbMATH Keywords

waiting timedifference equationsupplementary variable\(N\) policybatch renewal

Mathematics Subject Classification ID

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

Related Items (1)

On the asymptotic expression of the time-dependent solution of an M/G/1 queueing model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of \(N\)-policy queues with disastrous breakdown
• \(M/G/1/K\) queues with \(N\)-policy and setup times
• Batch arrival queue with \(N\)-policy and at most \(J\) vacations
• Computational analysis of single-server bulk-arrival queues: GI X/M/1
• 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
• Operating characteristics of \(M^ X/G/1\) queue with \(N\)-policy
• A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
• The operating characteristic analysis on a general input queue with \(N\) policy and a startup time
• The analysis of a general input queue with \(N\) policy and exponential vacations
• The \(N\) threshold policy for the \(GI/M/1\) queue
• A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
• Analysis of the GI/Geo/1 queue with \(N\)-policy
• Strategic behavior and social optimization in a constant retrial queue with the \(N\)-policy
• Analysis of an \(N\)-policy GI/M/\(1\) queue in a multi-phase service environment with disasters
• A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity
• Modelling traffic queues at a signalized intersection with vehicle- actuated control and Markovian arrival processes
• A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
• Modified \(N\)-policy for \(M/G/1\) queues
• Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\)
• Analysis of queueing-time distributions for MAP/D_N/1 queue
• Control Policies for the M^X/G/1 Queueing System
• Analysis of the M^x/G/1 queue by N-policy and multiple vacations
• A difference equation approach for analysing a batch service queue with the batch renewal arrival process
• M^X/G/1 Vacation Models with N-Policy: Heuristic Interpretation of the Mean Waiting Time
• 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: Analytical and computational aspects of the infinite buffer single server \(N\) policy queue with batch renewal input