A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking

DOI10.1080/03155986.1994.11732258zbMath0824.90066OpenAlexW2399553990MaRDI QIDQ4834080

Attahiru Sule Alfa, Elias Yannopoulos

Publication date: 23 May 1995

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmqueueing networksblockingaverage sojourn time

Mathematics Subject Classification ID

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

Related Items (2)

Examples of Applications of Queueing Theory in Canada ⋮ A recursive algorithm for generating the transition matrices of multistation multiserver exponential reliable queueing networks

This page was built for publication: A Simple And Quick Approximation Algorithm For Tandem, Split And Merge Queueing Networks With Blocking