Approximating the tandem behaviour of a G|M|1 queueing system

DOI10.1080/00207728908910190zbMath0674.90034OpenAlexW2002804390MaRDI QIDQ3829330

Behnam Pourbabai

Publication date: 1989

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728908910190

zbMATH Keywords

heuristicdeparture processapproximation resultsG/M/1 queueing systeminfinite capacitytandem behaviour

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items

Optimal selection of buffers in a tandem finite capacity G/M/1 queueing system ⋮ Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines

Cites Work

• Unnamed Item
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Approximate Analysis of General Queuing Networks by Decomposition
• The Correlation Structure of the Output Process of Some Single Server Queueing Systems
• Some Inequalities in Queuing