1.Ayhan, H. & Kim, J.K. (2007). A general class of closed fork and join queues with subexponential service times. Stochastic Models 23: 523–535.
2.Baccelli, F. (1985). Two parallel queues created by arrivals with two demands: The M/G/2 symmetrical case. Technical report 426, INRIA-Rocquencourt.
3.Baccelli, F., Makowski, A.M., & Shwartz, A. (1989). The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds. Advances in Applied Probability 21: 629–660.
4.Chao, X. & Zheng, S. (2000). Triggered concurrent batch arrivals and batch departures in queueing networks. Discrete Event Dynamic Systems 10: 115–129.
5.Chen, R.J. (2001). A hybrid solution of fork/join synchronization in parallel queues. IEEE Transactions on Parallel and Distributed Systems 12: 829–845.
6.Flatto, L. (1985). Two parallel queues created by arrivals with two demands II. SIAM Journal on Applied Mathematics 45: 861–878.
7.Flatto, L. & Hahn, S. (1984). Two parallel queues created by arrivals with two demands I. SIAM Journal on Applied Mathematics 44: 1041–1053.
8.Heidelberger, P. & Trivedi, K.S. (1983). Queueing network models for parallel processing with asynchronous tasks. IEEE Transactions on Computers 32: 73–82.
9.Ko, S.S. & Serfozo, R.F. (2004). Response times in M/M/s fork-join networks. Advances in Applied Probability 36: 854–871.
10.Nelson, R. & Tantawi, A.N. (1988). Approximate analysis of fork/join synchronization in parallel queues. IEEE Transactions on Computers 37: 739–743.
11.Nelson, R. & Towsley, D. (1993). A performance evaluation of several priority policies for parallel processing systems. Journal of the ACM 40: 714–740.
12.Pinotsi, D. & Zazanis, M.A. (2005). Synchronized queues with deterministic arrivals. Operations Research Letters 33: 560–566.
13.Song, J.S., Xu, S.H., & Liu, B. (1999). Order-fulfillment performance measures in an assemble-to-order system with stochastic leadtimes. Operations Research 47: 131–149.
14.Shwartz, A. & Weiss, A. (1993). Induced rare events: analysis via large deviations and time reversal. Advances in Applied Probability 25: 667–689.
15.Tan, X. & Knessl, C. (1996). A fork-join queueing model: Diffusion approximation, integral representations and asymptotics. Queueing Systems 22: 287–322.
16.Varki, E. (1999). Mean value technique for closed fork-join networks. ACM SIGMETRICS Performance Evaluation Review 27: 103–112.
17.Varma, S. & Makowski, A.M. (1994). Interpolation approximation for symmetric fork-join queues. Performance Evaluation 20: 245–265.
18.Wright, P.E. (1992). Two parallel queues with coupled inputs. Advances in Applied Probability 24: 986–1007.
19.Zhang, Z. (1990). Analytical results for waiting time and system size distributions in two parallel queueing systems. SIAM Journal on Applied Mathematics 50: 1176–1193.