Computational Science and Its Applications – ICCSA 2007

Volume 4705 of the series Lecture Notes in Computer Science pp 758-766

Cycle Times in a Serial Fork-Join Network

  • Sung-Seok KoAffiliated withDepartment of Industrial Engineering, Konkuk University 1 Hwayang-dong,Gwangjin-Gu, Seoul, 143-701

* Final gross prices may vary according to local VAT.

Get Access


This paper presents formulas for approximating the distribution of the cycle time of a job in a two-stage fork-join network in equilibrium. The key step is characterizing the departure process from the first node. Statistical tests justify that the approximate distribution is a good fit to the actual one. We discuss related approximations for m-stage networks, and present a formula for approximating the mean cycle time in a m-stage fork-join network.

Keywords and Phrases

Fork-join network queueing Palm probability communication network parallel processing supply chains