On the Optimal Control of Parallel Processing Networks with Resource Collaboration and Multitasking

References

• 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.Google Scholar
• Billingsley P (1999) Convergence of Probability Measures, 2nd ed. (Wiley, New York).Google Scholar
• Bo Y, Dawande M, Huh WT, Janakiraman G, Nagarajan M (2019) Determining process capacity: Intractability and efficient special cases. Manufacturing Service Oper. Management 21(1):139–153.Abstract, Google Scholar
• Brucker P, Drexl A, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112(1):3–41.Google Scholar
• Budhiraja A, Johnson D (2020) Control policies approaching hierarchical greedy ideal performance in heavy traffic for resource sharing networks. Math. Oper. Res. 45(3):797–832.Link, Google Scholar
• Courcoubetis C, Reiman MI (1987) Optimal control of a queueing system with simultaneous service requirements. IEEE Trans. Automatic Control 32(8):717–727.Google Scholar
• Czajkowski K, Fitzgerald S, Foster I, Kesselman C (2001) Grid information services for distributed resource sharing. Proc. 10th IEEE Internat. Sympos. High Performance Distributed Comput. (IEEE, San Francisco, CA), 181–194.Google Scholar
• Dai JG, Lin W (2005) Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2):197–218.Link, Google Scholar
• Dobson G, Lee HH, Sainathan A, Tilson V (2012) A queueing model to evaluate the impact of patient “batching” on throughput and flow time in a medical teaching facility. Manufacturing Service Oper. Management 14(4):584–599.Link, Google Scholar
• Glynn PW (1990) Diffusion approximations. Heyman DP, Sobel MJ, eds. Handbooks in Operations Research and Management Science, vol. 2 (North-Holland: Elsevier), 145–198.Google Scholar
• Gurvich I, Van Mieghem JA (2015) Collaboration and multitasking in networks: Architectures, bottlenecks, and capacity. Manufacturing Service Oper. Management 17(1):16–33.Link, Google Scholar
• Gurvich I, Van Mieghem JA (2018) Collaboration and multitasking in networks: Prioritization and achievable capacity. Management. Sci. 64(5):2390–2406.Link, Google Scholar
• Gurvich I, O’Leary KJ, Wang L, Mieghem JAV (2020) Collaboration, interruptions and changeover times: Workflow model and empirical study of hospitalist charting. Manufacturing Service Oper. Management 22(4):754–774.Link, Google Scholar
• Han L, Camlibel MK, Pang JS, Heemels WPMH (2012) A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints. Optim. Methods Software 27(4–5):761–799.Google Scholar
• Harrison JM (1988) Brownian models of queueing networks with heterogeneous customer populations. Fleming W, Lions PL, eds. Stochastic Differential Systems, Stochastic Control Theory and Their Applications, The IMA Volumes in Mathematics and Its Applications, vol. 10 (Springer, New York), 147–186.Google Scholar
• 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.Google Scholar
• Harrison JM (2000) Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10(1):75–103.Google Scholar
• Harrison JM, Mandayam C, Shah D, Yang Y (2014) Resource sharing networks: Overview and an open problem. Stochastic Systems 4(2):524–555.Link, Google Scholar
• Hindman B, Konwinski A, Zaharia M, Ghodsi A, Joseph AD, Katz R, Shenker S, Stoica I (2011) Eighth USENIX Sympos. Networked Systems Design Implementation (NSDI 11), Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center (Usenix, Boston), 1–14.Google Scholar
• Maglaras C (2003) Continuous-review tracking policies for dynamic control of stochastic networks. Queueing Systems 43:43–80.Google Scholar
• Meyn SP (2003) Sequencing and routing in multiclass queueing networks part II: Workload relaxations. SIAM J. Control Optim. 42(1):178–217.Google Scholar
• Özkan E, Ward AR (2019) On the control of fork-join networks. Math. Oper. Res. 44(2):532–564.Link, Google Scholar
• Pesic V, Williams RJ (2016) 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. Stochastic Systems 6(1):26–89.Link, Google Scholar
• Schrijver A (1998) Theory of Linear and Integer Programming (Wiley, New York).Google Scholar
• Shah D, Walton N, Zhong Y (2014) Optimal queue-size scaling in switched networks. Ann. Appl. Probab. 24(6):2207–2245.Google Scholar
• Vavasis SA (2009) Complexity theory: Quadratic programming. Floudas C, Pardalos P, eds. Encyclopedia of Optimization, 2nd ed. (Springer, Boston), 451–454.Google Scholar
• Whitt W (2002) Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues (Springer, New York).Google Scholar
• Williams RJ (1998) An invariance principle for semimartingale reflecting Brownian motions in an orthant. Queueing Systems 30:5–25.Google Scholar
• Yu CH, Doppler K, Ribeiro CB, Tirkkonen O (2011) Resource sharing optimization for device-to-device communication underlaying cellular networks. IEEE Trans. Wireless Comm. 10(8):2752–2763.Google Scholar
• Zychlinski N, Chan CW, Dong J (2019) Managing queues with different resource requirements. Working paper, Columbia University, New York.Google Scholar