Self-Selecting Priority Queues with Burr Distributed Waiting Costs
نویسندگان
چکیده
منابع مشابه
Self-Selecting Priority Queues with Burr Distributed Waiting Costs
Service providers, in the presence of congestion and heterogeneity of customer waiting costs, often introduce a fee-based premier option using which the customers selfsegment themselves. Examples of this practice are found in health care (concierge medicine), amusement parks, government (consular services), and transportation. Using a single-server queuing system with customer waiting costs mod...
متن کاملHerding in Queues with Waiting Costs: Rationality and Regret
We study how consumers with waiting cost disutility choose between two congested services of unknown service value. Consumers observe an imperfect private signal indicating which service facility may provide better service value, as well as the queue lengths at the service facilities before making their choice. If more consumers choose the same service facility because of their private informat...
متن کاملOn priority queues with priority jumps
In this paper, we investigate a simplified head-of-the-line with priority jumps (HOL-PJ) scheduling discipline. Therefore, we consider a discrete-time single-server queueing system with two priority queues of infinite capacity and with a newly introduced HOL-PJ priority scheme. We derive expressions for the probability generating function of the system contents and the packet delay. Some perfor...
متن کاملwaiting time improvement in human queues by using first-best customer priority rule algorithm
in this paper we introduced a new priority rule algorithm in human queues. the suggested method is applicable in human lines with different demands (serving times) for different customers. in this method, the waiting time for each customer is related to the volume of demand. a common example of such a system is a bakery line. the usual priority rule algorithm in this kind of queue is first-in-f...
متن کامل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.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2014
ISSN: 1556-5068
DOI: 10.2139/ssrn.2499146