Waiting times in queues with relative priorities
نویسندگان
چکیده
This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Technical Note - A Note on Waiting Times in Single Server Queues
EVANS, R. V. 1981. Markov Chain Design Problems. Opns. Res. 29, 959-970. KUMIN, H. J. 1973. On Characterizing the Extrema of a Function of Two Variables, One of Which Is Discrete. Mgmt. Sci. 20, 126-129. MILLER, B. 1971. On Minimizing Nonseparable Functions Defined on the Integers With an Inventory Application. SIAM J. Apple. Math. 2 1, 166-185. ROLFE, A. 1971. A Note on Marginal Allocation in ...
متن کاملWaiting times in nonpreemptive M k / Gk / 1 /
This paper studies and gives an analysis of a particular queuing model. It considers a non-preemptive priority queuing system with K ( ≥ 2 ) classes of jobs. The system consists of a single processor. It represents the model of discrete dynamic scheduling problems associated with M k / Gk / 1 / ∞ endogenous priority queues. The processor schedule jobs arriving according to a Markov arrival proc...
متن کاملMixed gated/exhaustive service in a polling model with priorities
In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue, a gate is set behind all customers. High priority customers receive priority in the sense that t...
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملInterpolation Approximations for the Mean Waiting Time in a Multi-server Queue
This paper gives numerical validation of a couple of interpolation approximations for the mean waiting time in a Cl/C/s queue, which are provided by a unified approach similar to that in Kimura (1991). Both approximations are represented as certain combinations of the mean waiting times for the Cl/M/5 and Cl / D / 5 queues in which the arrival processes and the mean service times are the same a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 35 شماره
صفحات -
تاریخ انتشار 2007