We consider a queueing system with multiple Poisson arrival queues and a single batch server that has infinite capacity and a fixed service time. The problem is to allocate the server at each moment to minimize the long-run average waiting cost. We propose a Cost-Arrival Weighted (CAW) policy...

We study an M/M/1/K queue where customers can reschedule their appointments. Rescheduled customers show up with higher probabilities, incurring lower no-show costs, but rescheduling also frees up slots that may not be filled later, leading to wasted service capacity and lower throughput. The...

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,...