On multiple priority multi-server queues with impatience
نویسندگان
چکیده
منابع مشابه
On multiple priority multi-server queues with impatience
We consider Markovian multi-server queues with two types of impatient customers: highand low-priority ones. The first type of customers has a non-preemptive priority over the other type. After entering the queue, a customer will wait a random length of time for service to begin. If service has not begun by this time he or she will abandon and be lost. We consider two cases where the discipline ...
متن کاملOn Two Priority Multi-Server Queues with Impatient Customers
This study considers a system of multi-server queues with two classes of impatient customers: high-priority and low-priority. Customers join the system according to a Poisson process and customers may abandon service after entering the queue for an exponentially distributed duration with distinct rates. In this paper, we consider last come-first served (LCFS) and first come-first served (FCFS...
متن کاملAnalysis of customers' impatience in queues with server vacations
Many models for customers impatience in queueing systems have been studied in the past; the source of impatience has always been taken to be either a long wait already experienced at a queue, or a long wait anticipated by a customer upon arrival. In this paper we consider systems with servers vacations where customers’ impatience is due to an absentee of servers upon arrival. Such a model, repr...
متن کاملOptimal Policies for Multi-server Non-preemptive Priority Queues
We consider a multi-server non-preemptive queue with high and low priority customers, and a decision maker who decides when waiting customers may enter service. The goal is to minimize the mean waiting time for high-priority customers while keeping the queue stable. We use a linear programming approach to find and evaluate the performance of an asymptotically optimal policy in the setting of ex...
متن کاملMulti-Server Queueing Systems with Multiple Priority Classes
We present the first near-exact analysis of an M/PH/k queue with m > 2 preemptive-resume priorityclasses. Our analysis introduces a new technique, which we refer to as Recursive Dimensionality Reduc-tion (RDR). The key idea in RDR is that the m-dimensionally infinite Markov chain, representing them class state space, is recursively reduced to a 1-dimensionally infinite Markov ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2014
ISSN: 0160-5682,1476-9360
DOI: 10.1057/jors.2012.153