A Markov Chain Description of A Workstation with Infinite Capacity

DOI10.1080/0233193031000079847zbMath1031.60066OpenAlexW1966483237MaRDI QIDQ4430669

Wolfgang Stadje

Publication date: 12 October 2003

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0233193031000079847

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cites Work

• Delay analysis for discrete-time queueing systems with multiple randomly interrupted servers
• Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queues
• Deriving delay characteristics from queue length statistics in discrete-time queues with multiple servers
• On the queueing system
• The queueing system B_DG D_∞^∗∗

This page was built for publication: A Markov Chain Description of A Workstation with Infinite Capacity