USING PARALLEL ITERATION FOR APPROXIMATE ANALYSIS OF A MULTIPLE SERVER QUEUEING SYSTEM

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. The authors 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.

• Corporate Authors:

  Operations Research Society of America

  Mount Royal and Guilford Avenue
  Baltimore, MD  United States  21202
• Authors:
  • Birge, J R
  • Pollock, S M
• Publication Date: 1989-9

Media Info

• Features: Appendices; Figures; References; Tables;
• Pagination: p. 769-779
• Serial:
  • OPERATIONS RESEARCH
  • Volume: 37
  • Issue Number: 5
  • Publisher: NEWELL, GORDON F.

Subject/Index Terms

• TRT Terms: Iterative methods; Mathematical models; Police patrol; Probability; Queuing
• Uncontrolled Terms: Occupancy; Probabilistic analysis
• Subject Areas: Data and Information Technology; Highways; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 00489582
• Record Type: Publication
• Files: TRIS
• Created Date: Nov 30 1989 12:00AM