Discrete-time modified number- and time-limited vacation queues

Dieter Claeys () and Stijn De Vuyst ()
Additional contact information
Dieter Claeys: Ghent University
Stijn De Vuyst: Ghent University

Queueing Systems: Theory and Applications, 2019, vol. 91, issue 3, No 5, 297-318

Abstract: Abstract A vast amount of literature has appeared on vacation queues. In the well-known number- and time-limited vacation policies, the server goes on vacation if the number of customers, respectively, work (time slots) served since the previous vacation reaches a specified value, or if the system becomes empty, whichever occurs first. However, in practice, the server does not always go on vacation when the system is empty if the number of customers/work to be served has not yet reached the specified amount. Therefore, we study modified number- and time-limited vacation policies, where we account for this feature. We complement our recent work on these vacation policies by considering a discrete time, instead of a continuous-time, setting. We therefore adopt a different analysis approach, which enables us to obtain similar as well as new results as compared to our previous work. The results in this paper are valid for a memoryless distribution, but also for distributions with finite support, and a mixture of geometric distributions.

Keywords: Modified vacation policies; Queueing; Discrete time; Matrix generating functions; Decomposition; 60K25; 68M20; 90B22 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-018-9596-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:91:y:2019:i:3:d:10.1007_s11134-018-9596-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-018-9596-8

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().