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

DOI10.1016/J.COR.2015.04.019MaRDI QIDQ342034zbMATH OpenOpenAlexFDO

Authors 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

approximation modelsphase type distributionsqueueing networks

Mathematics Subject Classification ID

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

Recommendations

• Analysis of a three node queueing network
• Sojourn times in queuing networks with multiserver modes
• Numerical Computation of Sojourn-Time Distributions in Queuing Networks
• scientific article; zbMATH DE number 994727
• A Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks

Cites work

• PH/PH/1 queueing models in mathematica for performance evaluation
• Approximate Analysis of Central Server Models
• Approximations for the time spent in a dynamic job shop with applications to due-date assignment
• Calculation of the steady state waiting time distribution in GI/PH/c and MAP/PH/c queues
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 4119378 (Why is no real title available?)
• scientific article; zbMATH DE number 805121 (Why is no real title available?)
• Manufacturing Systems Modeling and Analysis
• Markov processes whose steady state distribution is matrix-exponential with an application to the GI/PH/1 queue
• Predicting departure times in multi-stage queueing systems
• Predicting queueing delays
• Representations for matrix-geometric and matrix-exponential steady-state distributions with applications to many-server queues

Cited in

(11)

• Analysis of a three node queueing network
• Predicting departure times in multi-stage queueing systems
• Sojourn time analysis for a cyclic-service tandem queueing model with general decrementing service
• Matrix-analytic solutions in production lines without buffers
• A queue-based aggregation approach for performance evaluation of a production system with an AMHS
• A new solution approach for multi-stage semi-open queuing networks: an application in shuttle-based compact storage systems
• A note on sojourn times in queuing networks with multiserver nodes
• A Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks
• Numerical Computation of Sojourn-Time Distributions in Queuing Networks
• Conditional expected sojourn times in insensitive queueing systems and networks
• Refined mean‐field approximation for discrete‐time queueing networks with blocking

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342034)