A transient M [ X ] / M ( k, K ) /1 queue with reneging and setup time for service

Aliakbar Montazer Haghighi and Dimitar P. Mishev

International Journal of Mathematics in Operational Research, 2025, vol. 31, issue 2, 164-181

Abstract: In this paper, we analyse a transient queuing model, in which tasks arrival in bulks of varying sizes with compound Poisson process. There is a single server serving batches of tasks with limited sizes with a minimum and a maximum, according with exponential distribution, with setup times for service with also exponential distribution, and impatient tasks that may renege while the server is busy with also exponential distribution. The transient probability generating function for the number in the system, special cases to verify it and some performance measures have been found.

Keywords: transient queue; Markov process; Poisson; reneging; exponential service; setup time; probability generating function; moments. (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=147025 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijmore:v:31:y:2025:i:2:p:164-181

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().