Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm

DOI10.1016/0377-2217(90)90013-2zbMath0718.90032OpenAlexW2049798380MaRDI QIDQ2639763

Behnam Pourbabai

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90013-2

zbMATH Keywords

simulationapproximationheuristicsingle Markovian servertandem behaviorfinite capacity G/M/1 queueing system

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines ⋮ The principal-agent problem for service rate event-dependency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Queueing Networks: A Survey of Their Random Processes
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Characterising the Finite Capacity GI/M/1 Queue with Renewal Output
• Queueing output processes
• Approximate Analysis of General Queuing Networks by Decomposition

This page was built for publication: Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm