Adan, I., and Weiss, G. 2005. A two-node Jackson network with infinite supply of work. Probability in the Engineering and Informational Sciences, 19(02), 191–212.Google Scholar

Adan, I., and Weiss, G. 2006. Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy. Queueing Systems, 54(3), 169–183.Google Scholar

Adan, I., and Weiss, G. 2012a. Exact FCFS matching rates for two infinite multitype sequences. Operations Research, 60(2), 475–489.CrossRefGoogle Scholar

Adan, I., and Weiss, G. 2012b. A loss system with skill-based servers under assign to longest idle server policy. Probability in the Engineering and Informational Sciences, 26(3), 307–321.Google Scholar

Adan, I., and Weiss, G. 2014. A skill based parallel service system under FCFS-ALIS – steady state, overloads, and abandonments. Stochastic Systems, 4(1), 250–299.Google Scholar

Adan, I., Wessels, J., and Zijm, H. 1990. Analysis of the symmetric shortest queue problem. Stochastic Models, 6, 691–713.Google Scholar

Adan, I., Wessels, J., and Zijm, H. 1991. Analysis of the asymmetric shortest queue problem with threshold jockeying. Communications in Statistics. Stochastic Models, 7(4), 615–627.Google Scholar

Adan, I., Wessels, J., and Zijm, H. 1993. A compensation approach for two-dimensional Markov processes. Advances in Applied Probability, 783–817.Google Scholar

Adan, I., VanHoutum, G. J., and Vander Wal, J. 1994. Upper and lower bounds for the waiting time in the symmetric shortest queue system. Annals of Operations Research, 48(2), 197–217.Google Scholar

Adan, I., Hurkens, C., andWeiss, G. 2010. A reversible Erlang loss systemwith multitype customers and multitype servers. Probability in the Engineering and Informational Sciences, 24(4), 535–548.Google Scholar

Adan, I., Kleiner, I., Righter, R., and Weiss, G. 2018a. FCFS parallel service systems and matching models. Performance Evaluation, 127, 253–272.Google Scholar

Adan, I., Busic, A., Mairesse, J., and Weiss, G. 2018b. Reversibility and further properties of FCFS infinite bipartite matching. Mathematics of Operations Research, 43(2), 598–621.Google Scholar

Adan, I., Boon, M., and Weiss, G. 2019. Design heuristic for parallel many server systems. European Journal of Operational Research, 273(1), 259–277.Google Scholar

Adan, I., Foss, S., Shneer, S., and Weiss, G. 2020. Local stability in a transient Markov chain. Statistics and Probability Letters, 165, 108855.Google Scholar

Aghajani, R., and Ramanan, K. 2019. The hydrodynamic limit of a randomized load balancing network. Annals of Applied Probability, 29(4), 2114–2174.Google Scholar

Aghajani, R., Li, X., and Ramanan, K. 2015. Mean-field dynamics of load-balancing networks with general service distributions. arXiv:1512.05056.Google Scholar

Al Hanbali, A., Mandjes, M., Nazarathy, Y., and Whitt, W. 2011. The asymptotic variance of departures in critically loaded queues. Advances in Applied Probability, 43(1), 243–263.Google Scholar

Asmussen, S. 2003. Applied Probability and Queues. Springer-Verlag.Google Scholar

Asmussen, S., and Glynn, P.W. 2007. Stochastic Simulation: Algorithms and Analysis. Vol. 57. Springer Science & Business Media.Google Scholar

Ayesta, U., Bodas, T., Dorsman, J.L., and Verloop, I.M. 2019. A token-based central queue with order-independent service rates. arXiv:1902.02137.Google Scholar

Baccelli, F., and Brémaud, P. 2013. Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences. Vol. 26. Springer Science & Business Media.Google Scholar

Baccelli, F., and Foss, S. 1994. Ergodicity of Jackson-type queueing networks. Queueing Systems, 17(1-2), 5–72.Google Scholar

Baccelli, F., and Hebuterne, G. 1981. On Queues with Impatient Customers. Tech. rept. RR-0094 inria-00076467. INRIA Rapports de Recherthe.Google Scholar

Baccelli, F., and Massey, W.A. 1989. A sample path analysis of the M/M/1 queue. Journal of Applied Probability, 26(2), 418–422.CrossRefGoogle Scholar

Baskett, F., Chandy, K.M., Muntz, R.R., and Palacios, F.G. 1975. Open, closed, and mixed networks of queues with different classes of customers. Journal of the ACM (JACM), 22(2), 248–260.Google Scholar

Bell, S., and Williams, R.J. 2005. Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Electronic Journal of Probability, 10, 1044–1115.CrossRefGoogle Scholar

Bell, S.L., and Williams, R.J. 2001. 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(3), 608–649.Google Scholar

Bellman, R.E. 1957. Dynamic Programming. Princeton University Press.Google Scholar

Berman, A., and Plemmons, R.J. 1994. Nonnegative Matrices in the Mathematical Sciences. SIAM.CrossRefGoogle Scholar

Bertsimas, D., Gamarnik, D., and Tsitsiklis, J.N. 1996. Stability conditions for multiclass fluid queueing networks. IEEE Transactions on Automatic Control, 41(11), 1618– 1631.Google Scholar

Bertsimas, D., Gamarnik, D., and Tsitsiklis, J.N. 2001. Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions. Annals of Applied Probability, 11(4), 1384–1428.CrossRefGoogle Scholar

Bickel, P.J., and Wichura, M.J. 1971. Convergence criteria for multiparameter stochastic processes and some applications. Annals of Mathematical Statistics, 1656–1670.Google Scholar

Billingsley, P. 1999. Convergence of Probability Measures. Wiley.Google Scholar

Borovkov, A.A. 1964. Some limit theorems in the theory of mass service. Theory of Probability & Its Applications, 9(4), 550–565.Google Scholar

Borovkov, A.A. 1965. Some limit theorems in the theory of mass service, II multiple channels systems. Theory of Probability & Its Applications, 10(3), 375–400.Google Scholar

Borovkov, A.A. 1967. On limit laws for service processes in multi-channel systems. Siberian Mathematical Journal, 8(5), 746–763.Google Scholar

Borovkov, A.A. 1984. Asymptotic Methods in Queuing Theory. Wiley.Google Scholar

Borovkov, A.A., and Foss, S. 1992. Stochastically recursive sequences and their generalizations. Siberian Advances in Mathematics, 2(1), 16–81.Google Scholar

Botvich, D. D., and Zamyatin, A. A. 1992. Ergodicity of conservative communication networks. Rapport de Recherche, INRIA, 1772.Google Scholar

Boxma, O.J., and Daduna, H. 1990. Sojourn times in queueing networks. Pages 401–450 of: Takagi, H. (ed), Stochastic Analysis of Computer and Communication Systems. North-Holland.Google Scholar

Bramson, M. 1994. Instability of FIFO queueing networks. Annals of Applied Probability, 4(2), 414–431.Google Scholar

Bramson, M. 1996. Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks. Queueing Systems, 23(1-4), 1– 26.Google Scholar

Bramson, M. 1998. State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems, 30(1-2), 89–140.Google Scholar

Bramson, M. 1999. A stable queueing network with unstable fluid model. Annals of Applied Probability, 818–853.Google Scholar

Bramson, M. 2001. Stability of earliest-due-date, first-served queueing networks. Queueing Systems, 39(1), 79–102.Google Scholar

Bramson, M. 2008. Stability of Queueing Networks. Springer.Google Scholar

Bramson, M., andWilliams, R.J. 2003. Two workload properties for Brownian networks. Queueing Systems, 45(3), 191–221.Google Scholar

Brandt, A., Franken, P., and Lisek, B. 1990. Stationary Stochastic Models. Vol. 227. Wiley.Google Scholar

Breiman, L. 1992. Probability. SIAM.Google Scholar

Browne, S., Whitt, W., and Dshalalow, J.H. 1995. Piecewise-linear diffusion processes. Advances in Queueing: Theory, Methods, and Open Problems, 4, 463–480.Google Scholar

Budhiraja, A., and Ghosh, A.P. 2006. Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function. Annals of Applied Probability, 16(4), 1962–2006.Google Scholar

Budhiraja, A., and Ghosh, A.P. 2012. Controlled stochastic networks in heavy traffic: convergence of value functions. Annals of Applied Probability, 22(2), 734–791.Google Scholar

Caldentey, R., Kaplan, E.H., and Weiss, G. 2009. FCFS infinite bipartite matching of servers and customers. Advances in Applied Probability, 41(03), 695–730.Google Scholar

Chao, X., Pinedo, M., and Miyazawa, M. 1999. Queueing Networks: Customers, Signals and Product Form Solutions. Wiley.Google Scholar

Chen, H. 1995. Fluid approximations and stability of multiclass queueing networks: work-conserving disciplines. Annals of Applied Probability, 5(3), 637–665.Google Scholar

Chen, H., and Mandelbaum, A. 1991. Stochastic discrete flow networks: Diffusion approximations and bottlenecks. Annals of Probability, 19(4), 1463–1519.Google Scholar

Chen, H., and Mandelbaum, A. 1994a. Hierarchical modeling of stochastic networks, Part I: Fluid models. Pages 47–105 of: Stochastic Modeling and Analysis of Manufacturing Systems. Springer.Google Scholar

Chen, H., and Mandelbaum, A. 1994b. Hierarchical modeling of stochastic networks, Part II: Strong approximations. Pages 107–131 of: Stochastic Modeling and Analysis of Manufacturing Systems Springer.Google Scholar

Chen, H., and Yao, D.D. 2001. Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization. Springer.Google Scholar

Chen, H., and Zhang, H. 1997. Stability of multiclass queueing networks under FIFO service discipline. Mathematics of Operations Research, 22(3), 691–725.Google Scholar

Chen, H., and Zhang, H. 2000. Stability of multiclass queueing networks under priority service disciplines. Operations Research, 48(1), 26–37.Google Scholar

Chen, H., Harrison, J.M., Mandelbaum, A., Van Ackere, A., and Wein, L.M. 1988. Empirical evaluation of a queueing network model for semiconductor wafer fabrication. Operations Research, 36(2), 202–215.CrossRefGoogle Scholar

Cohen, Jacob Willem. 2012. The Single Server Queue. Elsevier.Google Scholar

Cottle, R.W., Pang, J.S., and Stone, R.E. 2009. The Linear Complementarity Problem. SIAM.Google Scholar

Cox, D.R., and Smith, W.L. 1961. Queues. Methuen.Google Scholar

Daduna, H. 1991. On network flow equations and splitting formulas for sojourn times in queueing networks. Journal of Applied Mathematics and Stochastic Analysis, 4(2), 111–116.Google Scholar

Dai, J.G. 1995. On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Annals of Applied Probability, 5(1), 49–77.Google Scholar

Dai, J.G. 1996. A fluid limit model criterion for instability of multiclass queueing networks. Annals of Applied Probability, 6(3), 751–757.Google Scholar

Dai, J.G., and Harrison, J.M. 1991. Steady-state analysis of RBM in a rectangle: numerical methods and a queueing application. Annals of Applied Probability, 1(1), 16–35.Google Scholar

Dai, J.G., and Harrison, J.M. 1992. Reflected Brownian motion in an orthant: numerical methods for steady-state analysis. Annals of Applied Probability, 2(1), 65–86.Google Scholar

Dai, J.G., and He, S. 2010. Customer abandonment in many-server queues. Mathematics of Operations Research, 35(2), 347–362.Google Scholar

Dai, J.G., and He, S. 2013. Many-server queues with customer abandonment: Numerical analysis of their diffusion model. Stochastic Systems, 3(1), 96–146.Google Scholar

Dai, J.G., and Lin, W. 2005. Maximum pressure policies in stochastic processing networks. Operations Research, 53(2), 197–218.Google Scholar

Dai, J.G., and Lin, W. 2008. Asymptotic optimality of maximum pressure policies in stochastic processing networks. Annals of Applied Probability, 18(6), 2239–2299.Google Scholar

Dai, J.G., and Meyn, S.P. 1995. Stability and convergence of moments for multiclass queueing networks via fluid limit models. IEEE Transactions on Automatic Control, 40(11), 1889–1904.Google Scholar

Dai, J.G., and Miyazawa, M. 2011. Reflecting Brownian motion in two dimensions: Exact asymptotics for the stationary distribution. Stochastic Systems, 1(1), 146–208.Google Scholar

Dai, J.G., and Neuroth, S. 2002. DPPS scheduling policies in semiconductor wafer fabs. Pages 194–199 of: Proceedings of the 2002 International Conference on Modeling and Analysis of Semiconductor Manufacturing MASM.Google Scholar

Dai, J.G., and Prabhakar, B. 2000. The throughput of data switches with and without speedup. Pages 556–564 of: INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings Volume 2. IEEE.Google Scholar

Dai, J.G., and Vande Vate, J.H. 2000. The stability of two-station multitype fluid networks. Operations Research, 48(5), 721–744.Google Scholar

Dai, J.G., and Wang, Y. 1993. Nonexistence of Brownian models for certain multiclass queueing networks. Queueing Systems, 13(1-3), 41–46.Google Scholar

Dai, J.G., and Weiss, G. 1996. Stability and instability of fluid models for reentrant lines. Mathematics of Operations Research, 21(1), 115–134.CrossRefGoogle Scholar

Dai, J.G., Hasenbein, J.J., and Vande Vate, J.H. 1999. Stability of a three-station fluid network. Queueing Systems, 33(4), 293–325.Google Scholar

Dai, J.G., Hasenbein, J.J., and Vande Vate, J.H. 2004. Stability and instability of a two-station queueing network. Annals of Applied Probability, 14(1), 326–377.Google Scholar

Dai, J.G., He, S., and Tezcan, T. 2010. Many-server diffusion limits for G/Ph/n+ GI queues. Annals of Applied Probability, 20(5), 1854–1890.Google Scholar

Davis, M. 1984. Piecewise-deterministic Markov processes: a general class of non-diffusion stochastic models. Journal of the Royal Statistical Society. Series B (Methodological), 46(3), 353–388.Google Scholar

Donsker, M.D. 1951. An invariance principle for certain probability limit theorems. Memoirs of the American Mathematical Society, 6, 1–10.Google Scholar

Down, , D.G, Gromoll, H.C., and Puha, A.L. 2009. Fluid limits for shortest remaining processing time queues. Mathematics of Operations Research, 34(4), 880–911.Google Scholar

Dubins, L.E. 1968. On a theorem of Skorohod. Annals of Mathematical Statistics, 39(6), 2094–2097.Google Scholar

Erlang, A.K. 1909. The theory of probabilities and telephone conversations. Nyt Tidsskrift for Matematik B, 20(33-39), 16.Google Scholar

Erlang, A.K. 1917. Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Elektrotkeknikeren, 13, 5–13.Google Scholar

Eschenfeldt, P., and Gamarnik, D. 2016. Supermarket queueing system in the heavy traffic regime. Short queue dynamics. arXiv:1610.03522.Google Scholar

Eschenfeldt, P., and Gamarnik, D. 2018. Join the shortest queue with many servers. The heavy-traffic asymptotics. Mathematics of Operations Research, 43(3), 867–886.Google Scholar

Feller, W. 1971. An Introduction to Probability Theory and Its Applications. (Vol 2), 2nd ed. Wiley.Google Scholar

Fleischer, L., and Sethuraman, J. 2005. Efficient algorithms for separated continuous linear programs: the multicommodity flow problem with holding costs and extensions. Mathematics of Operations Research, 30(4), 916–938.Google Scholar

Foss, S., and Konstantopoulos, T. 2004. An overview of some stochastic stability methods. Journal of the Operations Research Society of Japan-Keiei Kagaku, 47(4), 275–303.Google Scholar

Foster, F.G. 1953. On the stochastic matrices associated with certain queuing processes. Annals of Mathematical Statistics, 24(3), 355–360.Google Scholar

Frostig, E., and Weiss, G. 2016. Four proofs of Gittins multiarmed bandit theorem. Annals of Operations Research, 241(1-2), 127–165.Google Scholar

Gamarnik, D., and Hasenbein, J.J. 2005. Instability in stochastic and fluid queueing networks. Annals of Applied Probability, 15(3), 1652–1690.Google Scholar

Gamarnik, D., Tsitsiklis, J.N., and Zubeldia, M. 2018. Delay, memory, and messaging tradeoffs in distributed service systems. Stochastic Systems, 8(1), 45–74.Google Scholar

Gänssler, P., and Stute, W. 1979. Empirical processes: a survey of results for independent and identically distributed random variables. Annals of Probability, 7(2), 193–243.Google Scholar

Gardner, K., and Righter, R. 2020. Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview. Queueing Systems, 96(1), 3–51.Google Scholar

Gardner, K., Zbarsky, S., Doroudi, S., Harchol-Balter, M., Hyytiä, E., and Scheller-Wolf, A. 2016. Queueing with redundant requests: exact analysis. Queueing Systems, 83(3-4), 227–259.Google Scholar

Gelenbe, E. 1991. Product-form queueing networks with negative and positive customers. Journal of Applied Probability, 28(3), 656–663.Google Scholar

Gittins, J., Glazebrook, K., and Weber, R.R. 2011. Multi-Armed Bandit Allocation Indices. Wiley.Google Scholar

Gittins, J.C., and Jones, D.M. 1974. A dynamic allocation index for the sequential design of experiments. In: Gani, J., Sarkadi, K., and Vince, I. (eds), Progress in Statistics European Meeting of Statisticians (Hungary) 1972. Volume 1. North-Holland.Google Scholar

Glynn, P.W. 1990. Diffusion approximations. Handbooks in Operations Research and Management Science, 2, 145–198.Google Scholar

Glynn, P.W., and Whitt, W. 1991. A new view of the heavy-traffic limit theorem for infinite-server queues. Advances in Applied Probability, 23(1), 188–209.Google Scholar

Gondran, M., and Minoux, M. 1984. Graphs and Algorithms. Wiley.Google Scholar

Goodman, J.B., and Massey, W.A. 1984. The non-ergodic Jackson network. Journal of Applied Probability, 21(4), 860–869.Google Scholar

Gordon, W.J., and Newell, G.F. 1967. Closed queuing systems with exponential servers. Operations Research, 15(2), 254–265.Google Scholar

Gromoll, H.C. 2004. Diffusion approximation for a processor sharing queue in heavy traffic. Annals of Applied Probability, 14(2), 555–611.Google Scholar

Gromoll, H.C., Puha, A.L., and Williams, R.J. 2002. The fluid limit of a heavily loaded processor sharing queue. Annals of Applied Probability, 12(3), 797–859.Google Scholar

Guo, Y., Lefeber, E., Nazarathy, Y., Weiss, G., and Zhang, H. 2014. Stability of multiclass queueing networks with infinite virtual queues. Queueing Systems, 76(3), 309–342.Google Scholar

Gurvich, I., and Whitt, W. 2009. Queue-and-idleness-ratio controls in many-server service systems. Mathematics of Operations Research, 34(2), 363–396.Google Scholar

Gurvich, I., and Whitt, W. 2010. Service-level differentiation in many-server service systems via queue-ratio routing. Operations Research, 58(2), 316–328.Google Scholar

Hajek, B. 1985. Extremal splittings of point processes. Mathematics of Operations Research, 10(4), 543–556.Google Scholar

Halfin, S., and Whitt, W. 1981. Heavy-traffic limits for queues with many exponential servers. Operations Research, 29(3), 567–588.Google Scholar

Harchol-Balter, M. 2013. Performance Modeling and Design of Computer Systems Queueing Theory in Action. Cambridge University Press.Google Scholar

Harrison, J.M. 1985. Brownian Motion and Stochastic Flow Systems. Wiley.Google Scholar

Harrison, J.M. 1988. Brownian models of queueing networks with heterogeneous customer populations. Pages 147–186 of: Stochastic Differential Systems, Stochastic Control Theory and Applications. Springer.Google Scholar

Harrison, J.M. 1996. The BIGSTEP approach to flow management in stochastic processing networks. Chap. 4, pages 147–186 of: Kelly, F.P., Zachary, S., and Ziedins, I. (eds), Stochastic Networks: Theory and Applications. Clarendon.Google Scholar

Harrison, J.M. 2000. Brownian models of open processing networks: canonical representation of workload. Annals of Applied Probability, 10(1), 75–103.Google Scholar

Harrison, J.M. 2002. Stochastic networks and activity analysis. Pages 53–76 of: Suhov, Yu.M. (ed), Analytic Methods in Applied Probability: In Memory of Fridrikh Karpelevich. Vol 207. Translations of the American Mathematical Society-Series.Google Scholar

Harrison, J.M. 2003. A broader view of Brownian networks. Annals of Applied Probability, 13(3), 1119–1150.Google Scholar

Harrison, J.M. 2013. Brownian Models of Performance and Control. Cambridge University Press.Google Scholar

Harrison, J.M., and Reiman, M.I. 1981. On the distribution of multidimensional reflected Brownian motion. SIAM Journal on Applied Mathematics, 41(2), 345–361.Google Scholar

Harrison, J.M., and Taksar, M.I. 1983. Instantaneous control of Brownian motion. Mathematics of Operations Research, 8(3), 439–453.Google Scholar

Harrison, J.M., and Taylor, A.J. 1978. Optimal control of a Brownian storage system. Stochastic Processes and Their Applications, 6(2), 179–194.Google Scholar

Harrison, J.M., and Van Mieghem, J.A. 1997. Dynamic control of Brownian networks: state space collapse and equivalent workload formulations. Annals of Applied Probability, 7(3), 747–771.Google Scholar

Harrison, J.M., and Wein, L.M. 1989. Scheduling networks of queues: heavy traffic analysis of a simple open network. Queueing Systems, 5(4), 265–279.Google Scholar

Harrison, J.M., and Wein, L.M. 1990. Scheduling networks of queues: heavy traffic analysis of a two-station closed network. Operations Research, 38(6), 1052–1064.Google Scholar

Harrison, J.M., and Williams, R.J. 1987a. Brownian models of open queueing networks with homogeneous customer populations. Stochastics, 22(2), 77–115.Google Scholar

Harrison, J.M., andWilliams, R.J. 1987b. Multidimensional reflected Brownian motions having exponential stationary distributions. Annals of Probability, 15(1), 115–137.Google Scholar

Haviv, M. 2013. Queues: A Course in Queueing Theory. Springer.Google Scholar

Henderson, W. 1983. Insensitivity and reversed Markov processes. Advances in Applied Probability, 15(4), 752–768.Google Scholar

Iglehart, D.L. 1965. Limiting diffusion approximations for the many server queue and the repairman problem. Journal of Applied Probability, 2(02), 429–441.Google Scholar

Iglehart, D.L. 1973. Weak convergence in queueing theory. Advances in Applied Probability, 5(3), 570–594.Google Scholar

Iglehart, D.L., and Whitt, W. 1970a. Multiple channel queues in heavy traffic. I. Advances in Applied Probability, 2(1), 150–177.Google Scholar

Iglehart, D.L., and Whitt, W. 1970b. Multiple channel queues in heavy traffic. II. Advances in Applied Probability, 2(2), 355–369.Google Scholar

Jackson, J.R. 1963. Jobshop-like queueing systems. Management Science, 10(1), 131– 142.Google Scholar

Kang, W.N., and Williams, R.J. 2012. Diffusion approximation for an input-queued packet switch operating under a maximum weight algorithm. Stochastic Systems, 2(2), 277–321.Google Scholar

Keilson, J., and Servi, L.D. 1988. A distributional form of Little’s law. Operations Research Letters, 7(5), 223–227.Google Scholar

Kelly, F.P. 1979. Reversibility and Stochastic Networks. Wiley, reprinted Cambridge University Press, 2011.Google Scholar

Kelly, F.P., and Laws, C.N. 1993. Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling. Queueing Systems, 13(1-3), 47–86.Google Scholar

Kendall, D.G. 1953. Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. Annals of Mathematical Statistics, 24(3), 338–354.Google Scholar

Kiefer, J., and Wolfowitz, J. 1955. On the theory of queues with many servers. Transactions of the American Mathematical Society, 78(1), 1–18.Google Scholar

Kingman, J.F.C. 1961. Two similar queues in parallel. Annals of Mathematical Statistics, 32(4), 1314–1323.Google Scholar

Kingman, J.F.C. 1962. On queues in heavy traffic. Journal of the Royal Statistical Society: Series B (Methodological), 24(2), 383–392.Google Scholar

Kleinrock, L. 1975. Queuing Systems, Volume 1: Theory. Wiley.Google Scholar

Kleinrock, L. 1976. Queueing Systems, Volume 2: Computer Applications. Wiley.Google Scholar

Klimov, G.P. 1975. Time-sharing service systems. I. Theory of Probability & Its Applications, 19(3), 532–551.Google Scholar

Komlós, J., Major, P., and Tusnády, G. 1975. An approximation of partial sums of independent RV’-s, and the sample DF. I. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 32(1), 111–131.Google Scholar

Komlós, J., Major, P., and Tusnády, G. 1976. An approximation of partial sums of independent RV’s, and the sample DF. II. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 34(1), 33–58.Google Scholar

Kopzon, A., Nazarathy, Y., and Weiss, G. 2009. A push–pull network with infinite supply of work. Queueing Systems, 62(1-2), 75–111.Google Scholar

Krichagina, E.V., and Puhalskii, A.A. 1997. A heavy-traffic analysis of a closed queueing system with a GI/∞ service center. Queueing Systems, 25(1-4), 235–280.Google Scholar

Kruk, L., Lehoczky, J., Ramanan, K., and Shreve, S.E. 2007. An explicit formula for the Skorokhod map on [0, a]. Annals of Probability, 35(5), 1740–1768.Google Scholar

Kumar, P.R. 1993. Re-entrant lines. Queueing Systems, 13(1-3), 87–110.Google Scholar

Kumar, P.R., and Meyn, S.P. 1996. Duality and linear programs for stability and performance analysis of queuing networks and scheduling policies. IEEE Transactions on Automatic Control, 41(1), 4–17.Google Scholar

Kumar, P.R., and Seidman, T.I. 1990. Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems. IEEE Transactions on Automatic Control, 35(3), 289–298.Google Scholar

Kurtz, T.G. 1981. Approximation of Population Processes. SIAM.Google Scholar

Kushner, H.J. 1990. Numerical methods for stochastic control problems in continuous time. SIAM Journal on Control and Optimization, 28(5), 999–1048.Google Scholar

Kushner, H.J. 2001. Heavy Traffic Analysis of Controlled Queueing and Communication Networks. Springer.Google Scholar

Latouche, G., and Taylor, P. 2000. Advances in Algorithmic Methods for Stochastic Models, Proceedings of the 3rd International Conference on Matrix Analytic Methods. Notable Publications Inc.Google Scholar

Latouche, G., and Taylor, P. 2002. Matrix-Analytic Methods: Theory and Applications, Proceedings of the 4th International Conference on Matrix Analytic Methods. World Scientific.Google Scholar

Latouche, G., Ramaswami, V., Sethuraman, J., Sigman, K., Squillante, M.S., and Yao, D. 2012. Matrix-Analytic Methods in Stochastic Models. Vol. 27. Springer Science & Business Media.Google Scholar

Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B. 1993. Sequencing and scheduling: algorithms and complexity. Handbooks in Operations Research and Management Science, 4, 445–522.Google Scholar

Laws, C.N. 1992. Resource pooling in queueing networks with dynamic routing. Advances in Applied Probability, 24(3), 699–726.Google Scholar

Laws, C.N., and Louth, G.M. 1990. Dynamic scheduling of a four-station queueing network. Probability in the Engineering and Informational Sciences, 4(01), 131– 156.Google Scholar

Lemoine, A.J. 1987. On sojourn time in Jackson networks of queues. Journal of Applied Probability, 24(2), 495–510.Google Scholar

Lindley, D.V. 1952. The theory of queues with a single server. Mathematical Proceedings of the Cambridge Philosophical Society, 48(02), 277–289.Google Scholar

Loynes, R.M. 1962. The stability of a queue with non-independent inter-arrival and service times. Mathematical Proceedings of the Cambridge Philosophical Society, 58(03), 497–520.Google Scholar

Lu, S.H., and Kumar, P.R. 1991. Distributed scheduling based on due dates and buffer priorities. IEEE Transactions on Automatic Control, 36(12), 1406–1416.Google Scholar

Maguluri, S.T., and Srikant, R. 2016. Heavy traffic queue length behavior in a switch under the MaxWeight algorithm. Stochastic Systems, 6(1), 211–250.Google Scholar

Mairesse, J., and Moyal, P. 2016. Stability of the stochastic matching model. Journal of Applied Probability, 53(4), 1064–1077.Google Scholar

Major, P. 1976. The approximation of partial sums of independent rv’s. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 35(3), 213–220.Google Scholar

Mandelbaum, A., and Momcilovic, P. 2012. Queues with many servers and impatient customers. Mathematics of Operations Research, 37(1), 41–65.Google Scholar

Martins, L.F., Shreve, S.E., and Soner, H.M. 1996. Heavy traffic convergence of a controlled, multiclass queueing system. SIAM Journal on Control and Optimization, 34(6), 2133–2171.Google Scholar

Matloff, N.S. 1989. On the value of predictive information in a scheduling problem. Performance Evaluation, 10(4), 309–315.Google Scholar

Meyer, P.A. 1971. Sur un article de Dubins. Pages 170–176 of: Séminaire de Probabilités V Université de Strasbourg. Springer.Google Scholar

Meyn, S.P. 2008. Control Techniques for Complex Networks. Cambridge University Press.Google Scholar

Meyn, S.P., and Down, D.G. 1994. Stability of generalized Jackson networks. Annals of Applied Probability, 4(1), 124–148.Google Scholar

Meyn, S.P., and Tweedie, R.L. 1993. Markov Chains and Stochastic Stability. Springer-Verlag.Google Scholar

Mitzenmacher, M. 1996. The Power of Two Choices in Randomized Load Balancing. Ph.D. thesis, University of California at Berkeley.Google Scholar

Mitzenmacher, M. 2001. The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems, 12(10), 1094–1104.Google Scholar

Moyal, P., and Perry, O. 2017. On the instability of matching queues. Annals of Applied Probability, 27(6), 3385–3434.Google Scholar

Moyal, P., Busic, A., and Mairesse, J. 2021. A product form for the general stochastic matching model. Journal of Applied Probability, 58(2), 449–468.Google Scholar

Mukherjee, D., Borst, S., Van Leeuwaarden, J., and Whiting, P. 2018. Universality of power-of-d load balancing in many-server systems. Stochastic Systems, 8(4), 265–292.Google Scholar

Nazarathy, Y., and Weiss, G. 2009. Near optimal control of queueing networks over a finite time horizon. Annals of Operations Research, 170(1), 233–249.Google Scholar

Nazarathy, Y., and Weiss, G. 2010. Positive Harris recurrence and diffusion scale analysis of a push pull queueing network. Performance Evaluation, 67(4), 201–217.Google Scholar

Nazarathy, Y., Rojas-Nandayapa, L., and Salisbury, T.S. 2013. Non-existence of stabilizing policies for the critical push–pull network and generalizations. Operations Research Letters, 41(3), 265–270.Google Scholar

Neuts, M.F. 1974. Probability Distributions of Phase Type. Purdue University. Department of Statistics.Google Scholar

Neuts, M.F. 1981. Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach. Courier Corporation, reprinted Dover Publications 1994.Google Scholar

Obłój, J. 2004. The Skorokhod embedding problem and its offspring. Probability Surveys, 1, 321–392.Google Scholar

Oksendal, B. 2013. Stochastic Differential Equations: an Introduction with Applications. Springer Science & Business Media.Google Scholar

Perel, N., and Yechiali, U. 2014. The Israeli queue with infinite number of groups. Probability in the Engineering and Informational Sciences, 28(1), 1.Google Scholar

Pinedo, M.L. 2012. Scheduling: Theory, Algorithms, and Systems. Springer.Google Scholar

Ramanan, K. 2006. Reflected diffusions defined via the extended Skorokhod map. Electronic Journal of Probability, 11, 934–992.Google Scholar

Reed, J. 2009. The G/GI/N queue in the Halfin–Whitt regime. Annals of Applied Probability, 19(6), 2211–2269.Google Scholar

Reiman, M.I. 1984a. Open queueing networks in heavy traffic. Mathematics of Operations Research, 9(3), 441–458.Google Scholar

Reiman, M.I. 1984b. Some diffusion approximations with state space collapse. Pages 207–240 of: Modelling and Performance Evaluation Methodology. Springer.Google Scholar

Ross, S.M. 1983. Introduction to Stochastic Dynamic Programming. Academic Press.Google Scholar

Ross, S.M. 2009. Introduction to Probability Models. 10 edn. Elsevier Academic Press.Google Scholar

Rybko, A.N., and Stolyar, A.L. 1992. Ergodicity of stochastic processes describing the operation of open queueing networks. Problemy Peredachi Informatsii, Translation Problems of Information Transmission, 28(3), 3–26.Google Scholar

Schassberger, R. 1986. Two remarks on insensitive stochastic models. Advances in Applied Probability, 18(3), 791–814.Google Scholar

Schrage, L.E. 1968. Proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16(3), 687–690.Google Scholar

Schrage, L.E., and Miller, L.W. 1966. The queue M/G/1 with the shortest remaining processing time discipline. Operations Research, 14(4), 670–684.Google Scholar

Seneta, E. 1981. Non-negative Matrices and Markov Chains. Springer Science & Business Media.Google Scholar

Serfozo, R. 1999. Introduction to Stochastic Networks. Vol. 44. Springer Science & Business Media.Google Scholar

Servi, L.D., and Finn, S.G. 2002. M/M/1 queues with working vacations (m/m/1/wv). Performance Evaluation, 50(1), 41–52.Google Scholar

Sevast’Yanov, B.A. 1957. An ergodic theorem for Markov processes and its application to telephone systems with refusals. Theory of Probability & Its Applications, 2(1), 104–112.Google Scholar

Sevcik, K.C., and Mitrani, I. 1981. The distribution of queuing network states at input and output instants. Journal of the ACM (JACM), 28(2), 358–371.Google Scholar

Shah, D., andWischik, D. 2012. Switched networks with maximumweight policies: fluid approximation and multiplicative state space collapse. Annals of Applied Probability, 22(1), 70–127.Google Scholar

Shindin, E., Masin, M., Zadorojniy, A., and Weiss, G. 2021. Revised Simplex-Type Algorithm for SCLP with Application to Large-scale Fluid Processing Networks. arXiv:2103.04405.Google Scholar

Sigman, K. 1990. The stability of open queueing networks. Stochastic Processes and Their Applications, 35(1), 11–25.Google Scholar

Skorokhod, A.V. 1961. Stochastic equations for diffusion processes in a bounded region. Theory of Probability & Its Applications, 6(3), 264–274.Google Scholar

Smith, W.L. 1953. On the distribution of queueing times. Mathematical Proceedings of the Cambridge Philosophical Society, 49(03), 449–461.Google Scholar

Smith, W.L. 1958. Renewal theory and its ramifications. Journal of the Royal Statistical Society: Series B (Methodological), 20(2), 243–284.Google Scholar

Stolyar, A.L. 2004. Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Annals of Applied Probability, 14(1), 1–53.Google Scholar

Stolyar, A.L. 2015. Pull-based load distribution in large-scale heterogeneous service systems. Queueing Systems, 80(4), 341–361.Google Scholar

Stone, C. 1963. Limit theorems for random walks, birth and death processes, and diffusion processes. Illinois Journal of Mathematics, 7(4), 638–660.Google Scholar

Tassiulas, L. 1995. Adaptive back-pressure congestion control based on local information. IEEE Transactions on Automatic Control, 40(2), 236–250.Google Scholar

Tassiulas, L., and Ephremides, A. 1992. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12), 1936–1948.Google Scholar

Van den Berg, J.L., and Boxma, O.J. 1989. Sojourn times in feedback queues. Pages 247–257 of: Operations Research Proceedings 1988. Springer.Google Scholar

Van den Berg, J.L., and Boxma, O.J. 1993. Sojourn Times in Feedback and Processor Sharing Queues. Vol. 97. Centrum voor Wiskunde en Informatica.Google Scholar

Van der Boor, M., Borst, S., Van Leeuwaarden, J., and Mukherjee, D. 2019. Scalable load balancing in networked systems: universality properties and stochastic coupling methods. Pages 3893–3923 of: Proceedings of the International Congress of Mathematicians (ICM 2018),. World Scientific.Google Scholar

Van Dijk, N.M. 1993. Queueing Networks and Product Forms: a Systems Approach. Wiley.Google Scholar

Van Houtum, G., Zijm, H., Adan, I., and Wessels, J. 1998. Bounds for performance characteristics: a systematic approach via cost structures. Stochastic Models, 14(1-2), 205–224.Google Scholar

Van Leeuwaarden, J., Mathijsen, B., and Zwart, B. 2019. Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin–Whitt Heavy-Traffic Regime. SIAM Review, 61(3), 403–440.Google Scholar

Van Zant, P. 2014. Microchip Fabrication: A Practical Guide to Semiconductor Processing, 6th Edition. McGraw-Hill.Google Scholar

Visschers, J. 2000. Random Walks with Geometric Jumps. Ph.D. thesis, Technische Universiteit Eindhoven.Google Scholar

Visschers, J., Adan, I., and Weiss, G. 2012. A product form solution to a system with multi-type jobs and multi-type servers. Queueing Systems, 70(3), 269–298.Google Scholar

Vvedenskaya, N., Dobrushin, R., and Karpelevich, F. 1996. Queueing system with selection of the shortest of two queues: An asymptotic approach. Problemy Peredachi Informatsii, 32(1), 20–34.Google Scholar

Walrand, J. 1988. An Introduction to Queueing Networks. Prentice-Hall.Google Scholar

Ward, A.R. 2012. Asymptotic analysis of queueing systems with reneging: a survey of results for FIFO, single class models. Surveys in Operations Research and Management Science, 17(1), 1–14.Google Scholar

Weber, R.R. 1978. On the optimal assignment of customers to parallel servers. Journal of Applied Probability, 15(2), 406–413.Google Scholar

Wein, L.M. 1988. Scheduling semiconductor wafer fabrication. IEEE Transactions on Semiconductor Manufacturing, 1(3), 115–130.Google Scholar

Wein, L.M. 1990a. Optimal control of a two-station Brownian network. Mathematics of Operations Research, 15(2), 215–242.Google Scholar

Wein, L.M. 1990b. Scheduling networks of queues: heavy traffic analysis of a two-station network with controllable inputs. Operations Research, 38(6), 1065–1078.Google Scholar

Wein, L.M. 1991. Brownian networks with discretionary routing. Operations Research, 39(2), 322–340.Google Scholar

Wein, L.M. 1992. Scheduling networks of queues: heavy traffic analysis of a multistation network with controllable inputs. Operations Research, 40(3, supplement 2), S312– S334.Google Scholar

Weiss, G. 1995. On optimal draining of fluid reentrant lines. Pages 91–103 of: Kelly, F.P., and Williams, R.J. (eds), Stochastic Networks. IMA series, Vol. 71, Springer.Google Scholar

Weiss, G. 2005. Jackson networks with unlimited supply of work. Journal of Applied Probability, 42(3), 879–882.Google Scholar

Weiss, G. 2008. A simplex based algorithm to solve separated continuous linear programs. Mathematical Programming, 115(1), 151–198.Google Scholar

Weiss, G. 2020. Directed FCFS infinite bipartite matching. Queueing Systems, 96(3–4), 387–418.Google Scholar

Whitt, W. 1982. On the heavy-traffic limit theorem for GI/G/∞ queues. Advances in Applied Probability, 14(1), 171–190.Google Scholar

Whitt, W. 1986. Deciding which queue to join: some counterexamples. Operations Research, 34(1), 55–62.Google Scholar

Whitt, W. 2002. Stochastic Process Limits. Springer.Google Scholar

Whitt, W. 2006. Fluid models for multiserver queues with abandonments. Operations Research, 54(1), 37–54.Google Scholar

Whittle, P. 1986. Systems in Stochastic Equilibrium. Wiley.Google Scholar

Williams, R.J. 1998. Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Systems, 30(1), 27–88.Google Scholar

Winston, W. 1977. Optimality of the shortest line discipline. Journal of Applied Probability, 14(1), 181–189.Google Scholar

Wolff, R.W. 1982. Poisson arrivals see time averages. Operations Research, 30(2), 223–231.Google Scholar

Wolff, R.W. 1989. Stochastic Modeling and the Theory of Queues. Prentice-Hall.Google Scholar

Yang, J.K. 2009. A Simple proof for the stability of global FIFO queueing networks. Acta Mathematicae Applicatae Sinica, English Series, 25(4), 647–654.Google Scholar

Zeltyn, S., and Mandelbaum, A. 2005. Call centers with impatient customers: many-server asymptotics of the M/M/n+ G queue. Queueing Systems, 51(3-4), 361–402.Google Scholar