A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times

Authors:
Mohan L. Chaudhry;Nam K. Kim
Affiliations:
Department of Mathematics and Computer Science, Royal Military College of Canada, P.O. Box 17000, Kingston, Ont., Canada K7K 7B4;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Daejon, 305-701, South Korea
Venue:
Operations Research Letters
Year:
2003

Citing 5
Cited 4

Deriving delay characteristics from queue length statistics in discrete-time queues with multiple servers

Performance Evaluation
Computing waiting-time probabilities in the discrete-time queue: GIX/G/1

Performance Evaluation
An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions

Operations Research
Analysis of discrete-time multiserver queueing models with constant service times

Operations Research Letters
Queue length distributions from probability generating functions via discrete fourier transforms

Operations Research Letters

Modeling and Performance Analysis of a Finite-Buffer Queue with Batch Arrivals, Batch Services, and Setup Times: The MX/GY/1/K + B Queue with Setup Times

INFORMS Journal on Computing
An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions

Operations Research
Performance analysis of a GI[X]/Geo/m/N queue with partial- and total-batch rejection

Computers & Mathematics with Applications
Sample-path analysis of general arrival queueing systems with constant amount of work for all customers

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A complete distribution for the system content of a discrete-time multi-server queue with an infinite buffer is presented, where each customer arriving in a group requires a deterministic service time that could be greater than one slot. In addition, when the service time equals one slot, a complete distribution for the delay is also presented.