An approximation for computing the throughput of closed assembly-type queueing networks

DOI10.1016/S0377-2217(97)00390-1zbMath0940.90021OpenAlexW2066197419MaRDI QIDQ1806887

Hayriye Ayhan, Martin A. Wortman

Publication date: 8 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00390-1

zbMATH Keywords

queueing networkMarkovian analysisassembly-type

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cites Work

• Estimating the throughput of an exponential CONWIP assembly system
• Stochastic orders
• Estimating the throughput of a cyclic assembly system
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation for computing the throughput of closed assembly-type queueing networks