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

DOI10.1016/S0377-2217(97)00390-1zbMATH Open0940.90021OpenAlexW2066197419MaRDI QIDQ1806887FDOQ1806887

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

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

Cites Work

• Title not available (Why is that?)
• Stochastic orders
• Title not available (Why is that?)
• Title not available (Why is that?)
• Estimating the throughput of an exponential CONWIP assembly system
• Estimating the throughput of a cyclic assembly system

Cited In (4)

• Estimating the throughput of an exponential CONWIP assembly system
• An Analytical Throughput Approximation for Closed Fork/Join Networks
• Approximate Analysis Of Bulk Closed Queueing Networks
• Approximate Description of Dynamics of a Closed Queueing Network Including Multi-servers

   Recommendations

• Estimating the throughput of an exponential CONWIP assembly system 👍 👎
• Estimating the throughput of a cyclic assembly system 👍 👎
• An approximate analysis for a class of assembly-like queues 👍 👎
• Queueing-model based analysis of assembly lines with finite buffers and general service times 👍 👎
• Bounds and heuristics for assembly-like queues 👍 👎

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

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