A simple approximation for mean waiting time in M/G/1 queue with vacations and limited service discipline

Authors:
Zhe Zhang;Raymond G Vickson
Affiliations:
Department of Management Sciences, Faculty of Engineering University of Waterloo Waterloo, Ontario, Canada, N2L 3G1;Department of Management Sciences, Faculty of Engineering University of Waterloo Waterloo, Ontario, Canada, N2L 3G1
Venue:
Operations Research Letters
Year:
1993

Citing 7
Cited 0

Queueing systems with vacations—a survey

Queueing Systems: Theory and Applications
Dynamics of the M/G/1 vacation model

Operations Research
State dependence in M/G/1 server-vacation models

Operations Research
On stochastic decomposition in M/G/1 type queues with generalized server vacations

Operations Research
M/G/1/N queue with vacation time and limited service discipline

Performance Evaluation
Stochastic bounds for queueing systems with limited service schedules

Performance Evaluation - Selected papers from the international seminar on performance of distributed and parallel systems
Symmetric queues served in cyclic order

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the M/G/1 queueing system with multiple vacations and E-limited service disciplines. In this kind of system, the server continues serving customers until either a prespecified number of customers have been served consecutively or the system becomes empty; then he goes on multiple vacations. Using stochastic decomposition and conditional probability arguments, we develop a new transform-free approximation for the mean waiting time in the system. In some special cases, the results become exact. Numerical tests indicate that the approximation is acceptably accurate.