Sojourn times in G/M/1 fork‐join networks

DOI10.1002/nav.20294zbMath1209.90114OpenAlexW2004439486WikidataQ56525958 ScholiaQ56525958MaRDI QIDQ5393027

Richard F. Serfozo, Sung-Seok Ko

Publication date: 15 April 2011

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20294

zbMATH Keywords

queueingsynchronizationparallel processingsupply chainsfork-join networkcommunications networkassembly network

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Related Items (7)

Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services ⋮ Stochastic bounds in Fork-Join queueing systems under full and partial mapping ⋮ Mean sojourn times in two-queue fork-join systems: bounds and approximations ⋮ Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations ⋮ Reducing Response Time in Fork-Join Systems under Heavy Traffic Via Imbalance Control ⋮ Gaussian Limits for a Fork-Join Network with Nonexchangeable Synchronization in Heavy Traffic ⋮ Delay asymptotics and bounds for multitask parallel jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Stochastic-Process Limits
• On the Diffusion Approximation to a Fork and Join Queueing Model
• Two Parallel Queues Created by Arrivals with Two Demands I
• Two Parallel Queues Created by Arrivals with Two Demands II
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds

This page was built for publication: Sojourn times in G/M/1 fork‐join networks