Non-stationary waiting times in a closed exponential tandem queue (Q1919818): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Queueing Networks: A Survey of Their Random Processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5538132 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Joint distributions in Poissonian tandem queues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the waiting time of a two-stage queueing system with blocking / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The waiting-time process of a queueing system with gamma-type input and blocking / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Transient Behaviour of a Tandem Queue / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Fourier-series method for inverting transforms of probability distributions / rank | |||
Normal rank |
Revision as of 13:43, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Non-stationary waiting times in a closed exponential tandem queue |
scientific article |
Statements
Non-stationary waiting times in a closed exponential tandem queue (English)
0 references
28 July 1996
0 references
The paper considers a pair of single servers in series. Service times are exponentially distributed and the service discipline is FIFO at both the stations. Initially there are \(m\) \((n)\) customers in station 1 (2). No new customers enter the system. Using an imbedded random walk of the queueing process, the author shows that the distributions of (i) the time \(S_k\) spent in the system by the \(k\)th customer at station 1 and (ii) the time \(T\) needed to service all the \((m+n)\) customers, are expressible in terms of certain Erlang distributions. Thus only numerical integrations are required to obtain the densities of \(S_k\) and \(T\).
0 references
pair of single servers in series
0 references
queueing process
0 references
Erlang distributions
0 references