Cycle Times in a Serial Fork-Join Network
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 PhrasesFork-join network queueing Palm probability communication network parallel processing supply chains
Unable to display preview. Download preview PDF.