A DISCRETE-TIME QUEUEING SYSTEM WITH CHANGES IN THE VACATION TIMES

作者：Atencia Ivan^*

来源：International Journal of Applied Mathematics and Computer Science, 2016, 26(2): 379-390.

DOI：10.1515/amcs-2016-0027

• discrete-time queueing theory
• changes in the remaining vacation times
• busy period
• sojourn 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 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.

• 出版日期2016-6