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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Ko, S. S. (2007). Cycle times in a serial fork-join network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4705 LNCS, pp. 758–766). Springer Verlag. https://doi.org/10.1007/978-3-540-74472-6_62
Mendeley helps you to discover research relevant for your work.