Throughput equivalencies in fork/ join queueing networks with finite buffers and general service times

DOI10.1080/00207549508930174MaRDI QIDQ4398938zbMATH OpenOpenAlexFDO

Authors Chun-Hyun Paik, D.-W. Tcha

Publication date 16 June 1999

Published in International Journal of Production Research (Search for Journal in Brave)

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

zbMATH Keywords

finite-buffered fork/join queueing networksmulti-server case

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queues and service in operations research (90B22)

Recommendations

• Throughput scalability analysis of fork-join queueing networks
• Fork and Join Queueing Networks with Heavy Tails: Scaling Dimension and Throughput Limit
• Optimizing the throughput, service rate, and buffer allocation in finite queueing networks
• scientific article; zbMATH DE number 2196402
• Throughput maximization of queueing networks with simultaneous minimization of service rates and buffers
• scientific article; zbMATH DE number 148327
• scientific article; zbMATH DE number 2032442
• An Analytical Throughput Approximation for Closed Fork/Join Networks
• Throughput and Latency in Finite-Buffer Line Networks

Cites work

• Acyclic fork-join queuing networks
• Approximate analysis of a closed fork/join model
• Bounds and heuristics for assembly-like queues
• Cyclic Queuing Systems with Restricted Length Queues
• scientific article; zbMATH DE number 47258 (Why is no real title available?)
• scientific article; zbMATH DE number 98644 (Why is no real title available?)
• Note—A Note on the Reversibility and Duality of Some Tandem Blocking Queueing Systems
• Reversibility of Tandem Blocking Queueing Systems
• Server assignment for multi-stage production systems with finite buffers
• The Reversibility Property of Production Lines

Cited in

(8)

• Symmetry property of the throughput in closed tandem queueing networks with finite buffers
• Performance analysis and buffer allocations in some open assembly systems.
• Design and analysis of production control scheme for Kanban-based JIT environment
• A tight bound on the throughput of queueing networks with blocking
• Some equivalencies between closed queueing networks with blocking
• scientific article; zbMATH DE number 148327 (Why is no real title available?)
• An Analytical Throughput Approximation for Closed Fork/Join Networks
• Blocking, reordering, and the throughput of a series of servers

This page was built for publication: Throughput equivalencies in fork/ join queueing networks with finite buffers and general service times

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