In this study, we analyze the reneging behavior of customers in a Markovian M/M/1 queue with an alternating service process, representing a normal operation mode and a working repair mode with reduced service speed. The customers are strategic and, as they continuously observe the system’s state, they decide whether to stay or to renege. For this model, we derive equilibrium customer reneging strategies and the corresponding performance measures of the system, considering both the baseline model with discrete units of customers and its fluid counterpart. To capture the effect of reneging, we compare their performance with similar systems, operating under a no-reneging policy. Both theoretical findings, as well as numerical experiments, reveal that allowing reneging significantly affects system performance. Finally, to assess the quality of the fluid approximation we conduct a numerical comparison between the fluid and the baseline version of the model.
Kanavetas, Odysseas, Logothetis, Dimitrios, Manou, Athanasia. Strategic reneging in service systems with working breakdowns. // Queueing Systems. – 2026. – DOI: 10.1007/s11134-026-09988-z. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s11134-026-09988-z
Kanavetas, Odysseas, Logothetis, Dimitrios, Manou, & Athanasia (2026). Strategic reneging in service systems with working breakdowns. Queueing Systems. https://doi.org/10.1007/s11134-026-09988-z
Kanavetas, et al. “Strategic reneging in service systems with working breakdowns.” Queueing Systems, 2026. doi:10.1007/s11134-026-09988-z.
@article{Kanavetas2026,
title = {Strategic reneging in service systems with working breakdowns},
author = {Kanavetas and Odysseas and Logothetis and Dimitrios and Manou and Athanasia},
journal = {Queueing Systems},
year = {2026},
doi = {10.1007/s11134-026-09988-z},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s11134-026-09988-z}
}
We introduce several dynamic models of sources of “posts” publishing them on a “newsfeed” in e.g. some social media. All of them have a product-form stationary distribution. We define four metrics relevant to these newsfeeds and compute...
We study a restricted version of the Erlang-R queueing model that has both server and space constraints, in which the space restriction is administered by two types of admission policies: blocking or holding in a pre-entrant queue. This...
Single-server queues with customer abandonment arise in call centers and other service systems, yet their steady-state performance is analytically tractable only in special cases. We develop Robust Queueing approximations for the mean...
Semimartingale reflecting Brownian motions (SRBMs) are an integral part of queueing theory. Fluid paths are a standard tool for demonstrating positive recurrence of SRBMs, and their convergence provides both necessary and sufficient...
We study a non-stationary state-dependent Hawkes single-server queueing model with both time-varying arrival and service rates, under the first-come first-served discipline. The arrival process is a Hawkes process with a time-varying...