Have a personal or library account? Click to login
A discrete-time queueing system with changes in the vacation times Cover

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

By: Ivan Atencia  
Open Access
|Jul 2016

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.

DOI: https://doi.org/10.1515/amcs-2016-0027 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 379 - 390
Submitted on: Jun 9, 2015
Accepted on: Jan 18, 2016
Published on: Jul 2, 2016
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2016 Ivan Atencia, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.