An approximation model for sojourn time distributions in acyclic multi-server queueing networks

DOI10.1016/j.cor.2015.04.019zbMath1349.90218OpenAlexW1981846602MaRDI QIDQ342034

Kevin R. Gue, Hyun Ho Kim

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.019

zbMATH Keywords

queueing networksapproximation modelsphase type distributions

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (4)

A new solution approach for multi-stage semi-open queuing networks: an application in shuttle-based compact storage systems ⋮ Matrix-analytic solutions in production lines without buffers ⋮ Refined mean‐field approximation for discrete‐time queueing networks with blocking ⋮ A queue-based aggregation approach for performance evaluation of a production system with an AMHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Predicting departure times in multi-stage queueing systems
• Predicting Queueing Delays
• Approximations for the time spent in a dynamic job shop with applications to due-date assignment
• Markov processes whose steady state distribution is matrix-exponential with an application to the GI/PH/1 queue
• Approximate Analysis of Central Server Models
• Representations for matrix-geometric and matrix-exponential steady-state distributions with applications to many-server queues
• Manufacturing Systems Modeling and Analysis
• Calculation of the steady state waiting time distribution in GI/PH/\(c\) and MAP/PH/\(c\) queues

This page was built for publication: An approximation model for sojourn time distributions in acyclic multi-server queueing networks