Cycle times in single server cyclic Jackson networks.

DOI10.1016/J.ORL.2003.12.001zbMath1054.90013OpenAlexW2011645373MaRDI QIDQ703253

Michael A. Zazanis

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.12.001

zbMATH Keywords

Jackson networksArrival theoremCycle time distributionCyclic networksOutput process

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Markov renewal processes, semi-Markov processes (60K15) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (3)

The cyclic queue and the tandem queue ⋮ Lead-time analysis and a control policy for production lines ⋮ THE TIME-TO-EMPTY FOR TANDEM JACKSON NETWORKS

Cites Work

• Unnamed Item
• Unnamed Item
• Formulas and representations for cyclic Markovian networks via Palm calculus
• A note on cycle times in tree-like queueing networks
• Sojourn times in closed queueing networks
• Technical Note—On Normalizing Constants in Queueing Networks
• Sojourn times in queuing networks with multiserver modes
• The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
• The Cycle Time Distribution of Exponential Cyclic Queues
• Passage times for overtake-free paths in Gordon–Newell networks
• On response time and cycle time distributions in a two-stage cyclic queue
• The Time for a Round Trip in a Cycle of Exponential Queues
• Conditional job-observer property for multitype closed queueing networks

This page was built for publication: Cycle times in single server cyclic Jackson networks.