Abstract
In this paper we consider the GI/M/1 queueing model with infinite waiting-room capacity. The customer arriving at t = 0 will find k — 1 customers waiting. The latter customers belong to a second priority class, whereas the ones arriving in [0,∞) belong to a first priority class and have the higher priority. Within each class we have a first-in-first-out queueing discipline. A customer, once at the service-point, remains there until his service is completed. Then the next customer for service is the one of highest priority among those queueing.For this model we derive the transient waiting times for customers belonging to both priority classes. The results are of special interest in appointment systems where customers may not turn up.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Reference6 articles.
1. Some explicit results for the queue GI/M/1 with group service;Bhat;Sankhya,1967
2. On the transient waiting time for GI/M/1 with a ‘head of the line’ priority discipline (abstract);Dalen;Adv. Appl. Prob.,1978
3. Some first passage problems and their application to queues;Prabhu;Sankya,1963
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Priority Queue;Wiley StatsRef: Statistics Reference Online;2014-09-29
2. Lattice path approach for busy period density of GIa/Gb/1 queues using C2 Coxian distributions;Applied Mathematical Modelling;2010-06
3. Lattice Path Approach for Busy Period Density ofGIb/G/1 Queues UsingC2Coxian Distributions;Journal of Statistical Theory and Practice;2007-06
4. Priority Queue;Encyclopedia of Statistical Sciences;2006-08-15
5. Busy Period Analysis Of Gibim/1/N Queues—Lattice Path Approach;Advances on Methodological and Applied Aspects of Probability and Statistics;2003-04-24