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

DOI10.1080/00207549508930174zbMath0915.90114OpenAlexW2145938897MaRDI QIDQ4398938

D.-W. Tcha, Chun-Hyun Paik

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

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

Related Items (1)

Design and analysis of production control scheme for Kanban-based JIT environment

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate analysis of a closed fork/join model
• Bounds and heuristics for assembly-like queues
• Reversibility of Tandem Blocking Queueing Systems
• Note—A Note on the Reversibility and Duality of Some Tandem Blocking Queueing Systems
• Acyclic fork-join queuing networks
• The Reversibility Property of Production Lines
• Server assignment for multi-stage production systems with finite buffers
• Cyclic Queuing Systems with Restricted Length Queues

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