Queueing systems with a procrastinating server

Authors:
Micha Hofri
Affiliations:
Department of Computer Science, Technion, Haifa, 32000 Israel
Venue:
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Year:
1986

Citing 1
Cited 3

Queueing systems with vacations—a survey

Queueing Systems: Theory and Applications

Queuing analysis of polling models

ACM Computing Surveys (CSUR)
A new approach to the queue length and waiting time of BMAP/G/1 queues

Computers and Operations Research
An analysis of multiple-class vacation queues with individual thresholds

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two related problems are analyzed and discussed:A queueing system that differs from the standard M/G/1 only in that at the end of a busy-period the server takes a sequence of vacations, inspecting the state of the queue at the end of each. When the length of the queue exceeds a predetermined level m it returns to serve the queue exhaustively.Two queues, with Poisson arrivals and general service-time distributions are attended by a single server. When the server is positioned at a certain queue it will serve the latter exhaustively, and at busy-period end will only switch to the other if the queue length there exceeds in size a predetermined threshold mi.The treatment combines analytic and numerical methods. Only steady-state results are presented.