The transient blended queue

This study aims to determine the transient behavior of the blended queue. Priority customers arrive over time and benefit from a threshold reservation policy, while non-priority ones can be contacted at any time. We show how to compute the Laplace transforms of the transient probabilities. Using the uniformization technique, we prove some monotonicty properties of the expected number of customers in the queue, explaining why the optimal transient reservation threshold should be lower than the stationary one.