On the Control of Fork-Join Networks

References

• [1] Adler PS, Mandelbaum A, Nguyen V, Schwerer E (1995) From project to process management: An empirically-based framework for analyzing product development time. Management Sci. 41(3):458–484.Link, Google Scholar
• [2] Armony M, Israelit S, Mandelbaum A, Marmor YN, Tseytlin Y, Yom-Tov GB (2015) On patient flow in hospitals: A data-based queueing-science perspective. Stochastic Systems 5(1):146–194.Link, Google Scholar
• [3] Ata B, Kumar S (2005) Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies. Ann. Appl. Probab. 15(1A):331–391.Crossref, Google Scholar
• [4] Atar R, Mandelbaum A, Zviran A (2012) Control of fork-join networks in heavy traffic. Proc. 50th Ann. Allerton Conf. Comm. Control Comput. (IEEE, Piscataway, NJ), 823–830.Crossref, Google Scholar
• [5] Bell SL, Williams RJ (2001) Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11(3):608–649.Crossref, Google Scholar
• [6] Billingsley P (1999) Convergence of Probability Measures, 2nd ed. (Wiley, New York).Crossref, Google Scholar
• [7] Chen H, Mandelbaum A (1991) Stochastic discrete flow networks: Diffusion approximations and bottlenecks. Ann. Appl. Probab. 19(4):1463–1519.Crossref, Google Scholar
• [8] Chen H, Yao DD (2001) Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization (Springer, New York).Crossref, Google Scholar
• [9] Dai JG, Lin W (2008) Asymptotic optimality of maximum pressure policies in stochastic processing networks. Ann. Appl. Probab. 18(6):2239–2299.Crossref, Google Scholar
• [10] Dallery Y, Gershwin SB (1992) Manufacturing flow line systems: A review of models and analytical results. Queueing Systems 12(1–2):3–94.Crossref, Google Scholar
• [11] Ghamami S, Ward AR (2013) Dynamic scheduling of a two-server parallel server system with complete resource pooling and reneging in heavy traffic: Asymptotic optimality of a two-threshold policy. Math. Oper. Res. 38(4):761–824.Link, Google Scholar
• [12] Gurvich I, Ward A (2014) On the dynamic control of matching queues. Stochastic Systems 4(2):479–523.Link, Google Scholar
• [13] Harrison JM (1996) The BIGSTEP approach to flow management in stochastic processing networks. Kelly FP, Zachary S, Ziedins I, eds. Stochastic Networks: Theory and Applications (Oxford University Press, New York), 57–90.Crossref, Google Scholar
• [14] Harrison JM (1998) Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies. Ann. Appl. Probab. 8(3):822–848.Crossref, Google Scholar
• [15] Harrison JM (2006) Correction: Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 16(3):1703–1732.Crossref, Google Scholar
• [16] Harrison JM, López MC (1999) Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33(4):339–368.Crossref, Google Scholar
• [17] Harrison JM, Van Mieghem JA (1997) Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Probab. 7(3):747–771.Crossref, Google Scholar
• [18] Hublet L, Besbes O, Chan C (2011) Emergency department congestion at Saintemarie University Hospital. Columbia CaseWorks, case study (Columbia University, New York).Google Scholar
• [19] Larson RC, Cahn MF, Shell MC (1993) Improving the New York city arrest-to-arraignment system. Interfaces 23(1):76–96.Link, Google Scholar
• [20] Lu H, Pang G (2016) Gaussian limits for a fork-join network with nonexchangeable synchronization in heavy traffic. Math. Oper. Res. 41(2):560–595.Link, Google Scholar
• [21] Lu H, Pang G (2016) Heavy-traffic limits for a fork-join network in the Halfin-Whitt regime. Stochastic Systems 6(2):519–600.Link, Google Scholar
• [22] Lu H, Pang G (2017) Heavy-traffic limits for an infinite-server fork-join queueing system with dependent and disruptive services. Queueing Systems 85(1–2):67–115.Crossref, Google Scholar
• [23] Maglaras C (2003) Continuous-review tracking policies for dynamic control of stochastic networks. Queueing Systems 43(1–2):43–80.Crossref, Google Scholar
• [24] Mandelbaum A, Stolyar AL (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Oper. Res. 52(6):836–855.Link, Google Scholar
• [25] Meyn SP (2003) Sequencing and routing in multiclass queueing networks part II: Workload relaxations. SIAM J. Control Optim. 42(1):178–217.Crossref, Google Scholar
• [26] Nguyen V (1993) Processing networks with parallel and sequential tasks: Heavy traffic analysis and brownian limits. Ann. Appl. Probab. 3(1):28–55.Crossref, Google Scholar
• [27] Nguyen V (1994) The trouble with diversity: Fork-join networks with heterogeneous customer population. Ann. Appl. Probab. 4(1):1–25.Crossref, Google Scholar
• [28] Pedarsani R, Walrand J, Zhong Y (2014) Robust scheduling in a flexible fork-join network. IEEE Conf. Decision Control (CDC) (IEEE, Monticello, IL).Crossref, Google Scholar
• [29] Pedarsani R, Walrand J, Zhong Y (2014) Scheduling tasks with precedence constraints on multiple servers. Proc. Ann. Allerton Conf. Comm. Control Comput. (IEEE, Piscataway, NJ), 1196–1203.Crossref, Google Scholar
• [30] Schrage L (1968) Letter to the Editor—A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16(3):687–690.Link, Google Scholar
• [31] Skorokhod AV (1961) Stochastic equations for diffusion processes in a bounded region. Theory Probab. Appl. 6(3):264–274.Crossref, Google Scholar
• [32] Whitt W (1980) Some useful functions for functional limit theorems. Math. Oper. Res. 5(1):67–85.Link, Google Scholar
• [33] Whitt W (2002) Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues (Springer, New York).Crossref, Google Scholar
• [34] Williams RJ (1998) An invariance principle for semimartingale reflecting Brownian motions in an orthant. Queueing Systems 30(1–2):5–25.Crossref, Google Scholar
• [35] Xia CH, Liu Z, Towsley D, Lelarge M (2007) Scalability of fork/join queueing networks with blocking. ACM SIGMETRICS Performance Evaluation Rev. 35(1):133–144.Crossref, Google Scholar