Search results

This book introduces the most advanced and recent theoretical research on innovative priority mechanisms in service settings. It covers cutting-edge topics on service innovations such as line-sitting, service-position-trading, referral priority programs, queue-scalping, distance-based priority, and dynamic priority policy. It also contains a variety of practical examples and applications which help managers to make better decisions and to develop a coherent business strategy. This book appeals to a wide readership, from academics and Ph.D. students who are interested in priority mechanisms, to service managers and researchers in the service industry. This is an open access book.

AbstractSimhon et al. (2016) proved that disclosing queue length to customers when the queue is shorter than some threshold and concealing the information otherwise cannot maximize the throughout of M/M/1 queues—when customers are familiar with the policy and the threshold. We show that said policy indeed maximizes throughput when customers do not have information of the policy. Furthermore, we prove that the socially optimal disclosure policy under this setting contains a "hole," that is, it is socially optimal to disclose queue length to the customers when the queue is sufficiently short or sufficiently long but not disclose otherwise.