Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
M/G/1/N queue with vacation time and limited service discipline
Performance Evaluation
Performance modeling of automated manufacturing systems
Performance modeling of automated manufacturing systems
Transform-free analysis of M / G / 1 / K and related queues
Mathematics of Operations Research
Queueing systems with state dependent parameters
Frontiers in queueing
Distributed Systems: Principles and Paradigms
Distributed Systems: Principles and Paradigms
Modelling and analysis of M/G^{a,b}/1/N queue – A simple alternative approach
Queueing Systems: Theory and Applications
An MX/G/1 queueing system with a setup period and a vacation period
Queueing Systems: Theory and Applications
Dynamic Load Balancing on Web-Server Systems
IEEE Internet Computing
Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GIX/Geom/m
INFORMS Journal on Computing
Analysis, Design, and Control of Queueing Systems
Operations Research
DYNAMIC VISIT-ORDER RULES FOR BATCH-SERVICE POLLING
Probability in the Engineering and Informational Sciences
Analysis of the discrete-time bulk-service queue Geo/GY/1/N+B
Operations Research Letters
On the batch arrival batch service queue with finite buffer under server's vacation: MX/GY/1/N queue
Computers & Mathematics with Applications
| Hi-index | 0.00 |
In this paper, we consider a finite-buffer MX/GY/1/K + B queue with setup times, which has a wide range of applications. The primary purpose of this paper is to discuss both exact analytic and computational aspects of this system. For this purpose, we present a modern applied approach to queueing theory. First, we present a set of linear equations for the stationary queue-length distribution at a departure epoch based on the embedded Markov-chain technique. Next, using two simple approaches that are based on the conditioning of the system states and discrete renewal theory, we establish two numerically stable relationships for the stationary queue-length distributions at three different epochs: departure, random, and arrival. Finally, based on these relationships, we present useful performance measures of interest such as the moments of the stationary queue lengths at three different epochs, the blocking probability, the mean delay in queue, and the probability that the server is busy, with computational experience.