<abstract xmlns="http://www.w3.org/1999/xhtml"><p> This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.</p></abstract>

This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability generating function approach, steady-state performance measures such as the first moments of the busy period of the queue content and of customers delay are obtained. Finally, some numerical examples to show the influence of the parameters on several performance characteristics are given.

A discrete-time queueing system with changes in the vacation times

Higher Polytechnic School University of Málaga, Campus de Teatinos, 29071 Málaga, Spain

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"A discrete-time queueing system with changes in the vacation times"}

This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or...

A discrete-time queueing system with changes in the vacation times

Publié en ligne: 02 juil. 2016

Pages: 379 - 390

Reçu: 09 juin 2015

Accepté: 18 janv. 2016

DOI: https://doi.org/10.1515/amcs-2016-0027

Mots clés
discrete-time queueing theory, changes in the remaining vacation times, busy period, sojourn times

© by Ivan Atencia

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

A discrete-time queueing system with changes in the vacation times

Publié en ligne: 02 juil. 2016

Pages: 379 - 390

Reçu: 09 juin 2015

Accepté: 18 janv. 2016

DOI: https://doi.org/10.1515/amcs-2016-0027

Mots clésdiscrete-time queueing theory, changes in the remaining vacation times, busy period, sojourn times

© by Ivan Atencia

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Mots clés
discrete-time queueing theory, changes in the remaining vacation times, busy period, sojourn times