Busy periods of two‐stage tandem service systems and their algorithmic implementation

X.-M. Yuan

Annals of Operations Research, 1999, vol. 87, issue 0, 319-332

Abstract: Busy periods of finite buffer tandem service systems have not been addressed in the available literature. This paper defines the stage‐I and stage‐II busy periods of a two‐stagetandem service system M (x) /M/c → /PH (r) /1/K, analytically obtains their distributions, and presents efficient algorithms for the distributions with uniform error in time. The detailed analysis and algorithmic implementation for the two‐stage tandem service system are completed, and the theoretical basis for its potential practical applications is provided. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018945305772 (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:spr:annopr:v:87:y:1999:i:0:p:319-332:10.1023/a:1018945305772

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

DOI: 10.1023/A:1018945305772

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().