A general decomposition algorithm for parallel queues with correlated arrivals

S. M.R. Iravani, K. L. Luangkesorn, D. Simchi-Levi

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


Queueing with correlated arrivals occurs when customers arrive at a set of queues simultaneously. The difficulty in analyzing systems with correlated arrivals is due to the fact that the individual queueing systems are stochastically dependent. Exact methods for analyzing these systems are computationally intensive and are limited to only a few special cases. In this paper, we consider a system of parallel queues with bulk service and correlated arrivals. We show how the matrix-geometric approach can be used to obtain the performance measures of the system. We also develop an algorithm for large systems that efficiently approximates the performance measures by decomposing it into individual queueing systems. Finally, we describe how the principles of our decomposition algorithm can be extended to analyze a variety of different parallel queueing systems with correlated arrivals. We then evaluate the accuracy of our algorithm through a numerical study.

Original languageEnglish (US)
Pages (from-to)313-344
Number of pages32
JournalQueueing Systems
Issue number4
StatePublished - Aug 2004


  • assemble-to-order
  • correlated arrivals
  • heuristics
  • matrix decomposition approach
  • produce-to-stock

ASJC Scopus subject areas

  • Statistics and Probability
  • Computer Science Applications
  • Management Science and Operations Research
  • Computational Theory and Mathematics


Dive into the research topics of 'A general decomposition algorithm for parallel queues with correlated arrivals'. Together they form a unique fingerprint.

Cite this