A semi-Markov queue with exponential service times

J. H. A. de Smit and G. J. K. Regterschot
Additional contact information
J. H. A. de Smit: Twente University of Technology
G. J. K. Regterschot: Twente University of Technology

A chapter in Semi-Markov Models, 1986, pp 369-382 from Springer

Abstract: Abstract In de Smit (1985) a general model for the single server semi-Markov queue was studied. Its solution was reduced to the Wiener-Hopf factorization of a matrix function. For the general case a formal factorization can be given in which the factors have probabilistic interpretations but cannot be calculated explicitly (see Arjas (1972)). Explicit factorizations can only be given in special cases. The present paper deals with the case in which customers arrive according to a Markov renewal process, while an arriving customer requires an exponential service time whose mean depends on the state of the Markov renewal process at his arrival. For this special case we shall obtain an explicit factorization. The model is formally described as follows.

Keywords: Queue Length; Imaginary Axis; Implicit Function Theorem; Busy Period; Interarrival Time (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:sprchp:978-1-4899-0574-1_20

Ordering information: This item can be ordered from
http://www.springer.com/9781489905741

DOI: 10.1007/978-1-4899-0574-1_20

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().