Strong convexity results for queueing systems
Operations Research
Convexity properties of the Erlang loss formula
Operations Research
Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System
Queueing Systems: Theory and Applications
A Diffusion Approximation for a Markovian Queue with Reneging
Queueing Systems: Theory and Applications
Designing a Call Center with Impatient Customers
Manufacturing & Service Operations Management
A Note on the Covexity of the Probability of a Full buffer in the M/M1/K Queue
A Note on the Covexity of the Probability of a Full buffer in the M/M1/K Queue
Probability in the Engineering and Informational Sciences
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Call Centers with Impatient Customers: Many-Server Asymptotics of the M/M/n + G Queue
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We consider a markovian multiserver queue with a finite waiting line in which a customer may decide to leave and give up service if its waiting time in queue exceeds its random deadline. We focus on the performance measure in terms of the probability of being served under both transient and stationary regimes. We investigate monotonicity properties of first and second order of this performance with respect to the buffer size, say k. Under the stationary regime, we prove that our service level is strictly increasing and concave in k, whereas we prove under the transient regime that it is only increasing in k.