The Analysis of a General Input Queue with N Policy and Exponential Vacations

Authors:
Jau-Chuan Ke
Affiliations:
Department of Statistics, National Taichung Institute of Technology, Taichung 404, Taiwan, R.O.C. jauchuan@mail.ntit.edu.tw
Venue:
Queueing Systems: Theory and Applications
Year:
2003

Citing 7
Cited 5

Stochastic modelling and analysis: a computational approach

Stochastic modelling and analysis: a computational approach
Queueing systems with vacations—a survey

Queueing Systems: Theory and Applications
Control policies for the MX/g/1 queueing system

Management Science
The GI/M/1 queue with exponential vacations

Queueing Systems: Theory and Applications
Batch arrival queue with N-policy and single vacation

Computers and Operations Research
Analysis of a bulk queue with N-policy multiple vacations and setup times

Computers and Operations Research
On the finite-buffer bulk-service queue with general independent arrivals: GI/M[b]/1/N

Operations Research Letters

Discrete-time GI/Geo/1 queue with multiple working vacations

Queueing Systems: Theory and Applications
Entropy maximization and NT vacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system size

International Journal of Computer Mathematics
Near optimal buffer allocation in remanufacturing systems with N-policy

Computers and Industrial Engineering
Busy period analysis for the GI/M/1 queue with exponential vacations

Operations Research Letters
On stochastic decomposition in the GI/M/1 queue with single exponential vacation

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies a single removable server in a G/M/1 queueing system with finite capacity where the server applies an N policy and takes multiple vacations when the system is empty. We provide a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining interarrival time, to develop the steady-state probability distributions of the number of customers in the system. The method is illustrated analytically for exponential and deterministic interarrival time distributions. We establish the distributions of the number of customers in the queue at pre-arrival epochs and at arbitrary epochs, as well as the distributions of the waiting time and the busy period.