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

DOI10.1016/S0377-2217(97)00390-1MaRDI QIDQ1806887zbMATH OpenOpenAlexFDO

Authors 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)

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

Cites work

• scientific article; zbMATH DE number 3125948 (Why is no real title available?)
• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• Estimating the throughput of a cyclic assembly system
• Estimating the throughput of an exponential CONWIP assembly system
• Stochastic orders

Cited in

(6)

• Approximate Analysis Of Bulk Closed Queueing Networks
• Bounds and heuristics for assembly-like queues
• Approximate Description of Dynamics of a Closed Queueing Network Including Multi-servers
• Estimating the throughput of an exponential CONWIP assembly system
• CONWIP: closed or semi-open queuing network?
• An Analytical Throughput Approximation for Closed Fork/Join Networks

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)