A decomposition approximation for assembly-disassembly queueing networks with finite buffer and blocking
From MaRDI portal
Publication:1290200
DOI10.1023/A:1018933003046zbMath0923.90060OpenAlexW2006071379MaRDI QIDQ1290200
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018933003046
Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (1)
This page was built for publication: A decomposition approximation for assembly-disassembly queueing networks with finite buffer and blocking
