Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking

Tayfur Altiok
Additional contact information
Tayfur Altiok: Rutgers University, Piscataway, New Jersey

Operations Research, 1989, vol. 37, issue 4, 601-610

Abstract: Queues in series with phase-type service times and finite queue capacities are considered. Servers may get blocked due to the limited space in queues. An approximation method is developed to compute the steady state probability distributions of the number of units in each queue. Three cases are considered: the first queue has an infinite capacity; the first queue has a finite capacity; and the first server is always busy. The method decomposes the system of tandem queues into individual queues with revised arrival and service processes and with queue capacities. Then, each queue is analyzed in isolation within an iterative scheme which relates these queues to each other. The approximation method is computationally efficient and it appears to have an acceptable error level.

Keywords: production/scheduling: flow shops; queues; simulation: tandem queues (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.4.601 (application/pdf)

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:inm:oropre:v:37:y:1989:i:4:p:601-610

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().