Dynamic Scheduling for Parallel Server Systems in Heavy Traffic: Graphical Structure, Decoupled Workload Matrix and some Sufficient Conditions for Solvability of the Brownian Control Problem

References

• B. Ata and S. Kumar. Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies. Annals of Applied Probability, 15 (2005), 331–391. MR2115046Google Scholar
• B. Ata and W. Lin. Heavy traffic analysis of maximum pressure policies for stochastic processing with multiple bottlenecks, Queueing Systems, 59 (2008), 191–235. MR2439295Google Scholar
• B. Ata and J. A. Van Mieghem. The value of dynamic resource pooling: Should a service network be integrated or product-focused? Management Science, 55 (2009), 115–131.Link, Google Scholar
• R. Atar, A. Mandelbaum and G. Shaikhet. Queueing systems with many servers: Null controllability in heavy traffic. Annals of Applied Probability, 16 (2006), 1764–1804. MR2288704Google Scholar
• R. Atar and I. Gurvich, Scheduling parallel servers in the nondegenerate slowdown diffusion regime: Asymptotic optimality results, Annals of Applied Probability, 24 (2014), 760–810. MR3178497Google Scholar
• S. L. Bell and R. J. Williams. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Annals of Applied Probability, 11 (2001), 608–649. MR1865018Google Scholar
• S. L. Bell and R. J. Williams. Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Electronic J. of Probability, 10 (2005), 1044–1115. MR2164040Google Scholar
• C. Berge. Graphs, North Holland, Amsterdam 1985. MR0809587Google Scholar
• V. Bohm. On the continuity of the optimal policy set for linear programs. SIAM J. Appl. Math., 28 (1975), 303–306. MR0371390Google Scholar
• A. Budhiraja and A. P. Ghosh. A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic. Annals of Applied Probability, 15 (2005), 1887–1935. MR2152248Google Scholar
• A. Budhiraja and A. Ghosh, Controlled stochastic networks in heavy traffic: Convergence of value functions, Annals of Applied Probability, 22 (2012), 734–791. MR2953568Google Scholar
• M. Bramson and R. J. Williams. Two workload properties for Brownian networks. Queueing Systems, 45 (2003), 191–221. MR2024178Google Scholar
• J. G. Dai and W. Lin. Asymptotic optimality of maximum pressure policies in stochastic processing networks, Annals of Applied Probability, 18 (2008), 2239–2299. MR2473656Google Scholar
• J. M. Harrison. Brownian models of queueing networks with heterogeneous customer population. In Stochastic Differential Systems, Stochastic Control Theory and Their Applications, IMA Volume 10, W. Fleming and P. L. Lions (eds.), Springer Verlag, New York, 1988, 147–186. MR0934722Google Scholar
• J. M. Harrison. The BIGSTEP approach to flow management in stochastic processing networks. In Stochastic Networks: Theory and Applications, F. P. Kelly, S. Zachary and I. Ziedins (eds.), Oxford University Press 1996, 57–90.Google Scholar
• J. M. Harrison. Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete review policies. Annals of Applied Probability, 8 (1998), 822–848. MR1627791Google Scholar
• J. M. Harrison. Brownian models of open processing networks: Canonical representation of workload. Annals of Applied Probability, 10 (2000), 75–103. Correction: 13 (2003), 390–393. MR1765204Google Scholar
• J. M. Harrison and M. J. López. Heavy traffic resource pooling in parallel server systems. Queueing Systems, 33 (1999), 339–368. MR1742575Google Scholar
• J. M. Harrison and J. A.Van Mieghem. Dynamic control of Brownian networks: State space collapse and Equivalent Workload Formulations. Annals of Applied Probability, 7 (1997), 747–771. MR1459269Google Scholar
• J. M. Harrison and L. M. Wein. Scheduling networks of queues: Heavy traffic analysis of a simple open network. Queueing Systems, 5 (1989), 265–280. MR1030470Google Scholar
• J. M. Harrison and R. J. Williams. Workload reduction of a generalized Brownian network. Annals of Applied Probability, 15 (2005), 2255–2295. MR2187295Google Scholar
• F. P. Kelly and C. N. Laws. Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems, 13 (1993), 47–86. MR1218844Google Scholar
• H. J. Kushner and Y. N. Chen, Optimal control of assignment of jobs to processors under heavy traffic, Stochastics and Stochastics Reports, 68 (2000), 177–228. MR1746180Google Scholar
• H. J. Kushner and P. Dupuis, Numerical Methods for Stochastic Control Problems in Continuous Time, Springer-Verlag, New York 1992. MR1217486Google Scholar
• H. J. Kushner and L. F. Martins, Numerical methods for stochastic singular control problems, SIAM J. Control and Optimization, 29 (1991), 1443–1475. MR1132190Google Scholar
• C. N. Laws. Resource pooling in queueing networks with dynamic routing. Advances in Applied Probability, 24 (1992), 699–726. MR1174386Google Scholar
• C. N. Laws and G. M. Louth. Dynamic sequencing of a four station queueing network. Probab. Engrg. Inform. Sci., 4 (1990), 131–156.Google Scholar
• C. Maglaras. Continuous-review tracking policies for dynamic control of stochastic networks. Queueing Systems, 43 (2003), 43–80. MR1957806Google Scholar
• A. Mandelbaum and A. L. Stolyar. Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized cμ-rule. Operations Research 52 (2004), 836–855. MR2104141Link, Google Scholar
• L. F. Martins, S. E. Shreve and H. M. Soner. Heavy traffic convergence of a controlled, multiclass queueing system. SIAM J. Control Optim. 34 (1996), 2133–2171. MR1416504Google Scholar
• V. Pesic and R. J. Williams, Dynamic scheduling of a parallel server system with partial pooling: Heavy traffic analysis of a three-buffer, three-server system, in preparation.Google Scholar
• A. L. Stolyar. MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Annals of Applied Probability, 14 (2004), 1–53. MR2023015Google Scholar
• L. Wein. Scheduling networks of queues: Heavy traffic analysis of a multistation network with controlable inputs. Operations Research, 40 (1992), 312–334.Link, Google Scholar
• R. J. Williams. On dynamic scheduling of a parallel server system with complete resource pooling. In Analysis of Communication Networks: Call Centers, Traffic and Performance, D. R. McDonald and S. R. E. Turner (eds.), American Mathematical Society, Providence, RI, 2000, 49–71. MR1788708Google Scholar
• P. Yang. Least controls for a class of constrained linear stochastic systems. Mathematics of Operations Research, 10 (1993), 275–291. MR1250119Google Scholar