Predicting departure times in multi-stage queueing systems
From MaRDI portal
Publication:1762163
DOI10.1016/j.cor.2011.10.011zbMath1251.90091OpenAlexW2075922318MaRDI QIDQ1762163
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
Related Items (1)
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