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

DOI10.1080/00207728908910190MaRDI QIDQ3829330zbMATH OpenOpenAlexFDO

Authors Behnam Pourbabai

Publication date 1989

Published in International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)

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

zbMATH Keywords

approximation resultsdeparture processG/M/1 queueing systemheuristicinfinite capacitytandem behaviour

Mathematics Subject Classification ID

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

Recommendations

• Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm
• Tandem behaviour of a finite-capacity G/M/1 queueing system with instantaneous Bernoulli feedback: an algorithm
• M/G/ tandem queues
• Mean waiting time approximation of tandem queueing systems based on performance ratio
• Asymptotic behaviour of the tandem queueing system with identical service times at both queues
• scientific article; zbMATH DE number 3868390
• APPROXIMATION OF TANDEM QUEUES VIA ISOMORPHS
• An Approximation Method for the Analysis of GI/G/1 Queues

Cites work

• Approximate Analysis of General Queuing Networks by Decomposition
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• Some Inequalities in Queuing
• The Correlation Structure of the Output Process of Some Single Server Queueing Systems

Cited in

(5)

• Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
• Endogenous queue number determination in \(G/m/s\) systems
• Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm
• Tandem behaviour of a finite-capacity G/M/1 queueing system with instantaneous Bernoulli feedback: an algorithm
• Optimal selection of buffers in a tandem finite capacity G/M/1 queueing system

This page was built for publication: Approximating the tandem behaviour of a G|M|1 queueing system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3829330)