| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| We analyze customer losses in busy-periods of preemptive and non-preemptive oscillating MX/G/1/(n,a,b) systems. Specifically, we propose a recursive scheme to compute the probability function of the number of customer losses in busy-periods of such systems. The effectiveness and usefulness of the proposed method is illustrated through the presentation of numerical examples that consider different arrival rates and service time and group size distributions. | 1.86 MB | Adobe PDF |
Orientador(es)
Resumo(s)
We analyze customer losses in busy-periods of preemptive and non-preemptive oscillating MX/G/1/(n,a,b) systems. Specifically, we propose a recursive scheme to compute the probability function of the number of customer losses in busy-periods of such systems. The effectiveness and usefulness of the proposed method is illustrated through the presentation of numerical examples that consider different arrival rates and service time and group size distributions.
Descrição
Palavras-chave
Busy-period Customer losses Markov regenerative processes Non-preemptive systems Oscillating queues Preemptive systems
Contexto Educativo
Citação
Fátima Ferreira, António Pacheco, Helena Ribeiro, Distribution of the number of losses in busy-periods of oscillating MX/G/1/(n,a,b) systems, Computers & Operations Research, Volume 129, 2021, 105180, ISSN 0305-0548, https://doi.org/10.1016/j.cor.2020.105180.
Editora
Elsevier
