Using Parallel Iteration for Approximate Analysis of a Multiple Server Queueing System

John Birge and Stephen M. Pollock
Additional contact information
Stephen M. Pollock: University of Michigan, Ann Arbor, Michigan

Operations Research, 1989, vol. 37, issue 5, 769-779

Abstract: This paper describes an iterative approach to the analysis of Markovian service systems. The method is approximate unless an assumption of independence among servers is valid. Nevertheless, useful results are attainable that hold intuitive appeal and provide a geometric reduction in the number of states (hence, computation) needed to obtain solutions. We demonstrate the usefulness of the procedure through an error analysis of a simple system. The practical utility of the approach is further justified in a comparison with simulation results for a police patrol model with over 50 million states.

Keywords: government; services; police: patrol probability analysis; queues; approximations: multiserver systems; queues; multichannel: approximate solutions (search for similar items in EconPapers)
Date: 1989
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.37.5.769 (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:5:p:769-779

Access Statistics for this article

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