Predicting departure times in multi-stage queueing systems

DOI10.1016/J.COR.2011.10.011zbMath1251.90091OpenAlexW2075922318MaRDI QIDQ1762163

Hyun Ho Kim, Kevin R. Gue

Publication date: 15 November 2012

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

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

zbMATH Keywords

queueingMarkov processesphase-type distributionssojourn time distributions

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong approximation for Markovian service networks
• 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
• Calculation of the steady state waiting time distribution in GI/PH/\(c\) and MAP/PH/\(c\) queues

This page was built for publication: Predicting departure times in multi-stage queueing systems