Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

Fluid Models of Parallel Service Systems Under FCFS

Published Online:27 Aug 2021https://doi.org/10.1287/opre.2021.2102

References

  • Adan I, Weiss G (2011) Exact FCFS matching rates for two infinite multi-type sequences. Oper. Res. 60(2):475–489.Link, Google Scholar
  • Adan I, Weiss G (2014) A queue with skill based service under FCFS-ALIS: steady state, overloaded system, and behavior under abandonments. Stochastic Systems 4(1):250–299.Link, Google Scholar
  • Adan I, Boon M, Weiss G (2019) Design heuristic for parallel many server systems. Eur. J. Oper. Res. 273(1):259–277.Crossref, Google Scholar
  • Adan I, Busic A, Mairesse J, Weiss G (2018) Reversibility and further properties of FCFS infinite bipartite matching. Math. Oper. Res. 43(2):598–621.Link, Google Scholar
  • Adan I, Foss S, Shneer S, Weiss G (2020) Local stability in a transient Markov chain. Statistics & Probability Letters 165, article no. 108855.Google Scholar
  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall).Google Scholar
  • Armony M, Ward AR (2010) Fair dynamic routing in large-scale heterogeneous-server systems. Oper. Res. 58(3):624–637.Link, Google Scholar
  • 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. Probabilities 11(3):608–649.Crossref, Google Scholar
  • Bramson M (1994) Instability of FIFO queueing networks. Ann. Appl. Probabilities 4(2):414–431.Crossref, Google Scholar
  • Bramson M (2008) Stability of Queueing Networks (Springer, Berlin).Google Scholar
  • Buke B, Chen H (2015) Stabilizing policies for probabilistic matching systems. Queueing Systems 80(1):35–69.Crossref, Google Scholar
  • Buke B, Chen H (2017) Fluid and diffusion approximations of probabilistic matching systems. Queueing Systems 86(1):1–33.Crossref, Google Scholar
  • Dai JG (1995) On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Probabilities 5(1):49–77.Crossref, Google Scholar
  • Dai JG (1996) A fluid limit model criterion for instability of multiclass queueing networks. Ann. Appl. Probabilities 6(3):751–757.Google Scholar
  • Dai JG, Lin W (2005) Maximum pressure policies in stochastic processing networks. Oper. Res. 53(2):197–218.Link, Google Scholar
  • Dai JG, Weiss G (1996) Stability and instability of fluid models for reentrant lines. Math. Oper. Res. 21(1):115–134.Link, Google Scholar
  • Dai JG, Hasenbein JJ, Vande Vate JH (2004) Stability and instability of a two-station queueing network. Ann. Appl. Probabilities 14(1):326–327.Google Scholar
  • Fazel-Zarandi M, Kaplan E (2018) Approximating the FCFS stochastic matching model with Ohm’s law. Oper. Res. 66(5):1423–1432.Google Scholar
  • Foss S, Chernova N (1998) On the stability of a partially accessible multistation queue with state-dependent routing. Queueing Systems 29(1):55–73.Crossref, Google Scholar
  • Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2):79–141.Link, Google Scholar
  • Gass SJ (2003) Linear Programming: Methods and Applications (Dover Publications).Google Scholar
  • 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 twothreshold policy. Math. Oper. Res. 38(4):761–824.Link, Google Scholar
  • Goodman JB, Massey WA (1984) The non-ergodic Jackson network. J. Appl. Probabilities 21(4):860–869.Crossref, Google Scholar
  • Green L (1985) A queueing system with genera-use and limited-use servers. Oper. Res. 33(2):162–182.Google Scholar
  • Gurvich I, Whitt W (2009) Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. 34(2):363–396.Link, Google Scholar
  • Gurvich I, Whitt W (2010) Service-level differentiation in many-server service system via queue-ratio routing. Oper. Res. 58(2):316–328.Link, Google Scholar
  • Harchol-Balter M, Crovella ME, Murta CD (1999) On choosing a task assignment policy for a distributed server system. J. Parallel Distribution Comput. 59(2):204–228.Crossref, Google Scholar
  • Harrison JM (1996) The BIGSTEP approach to flow management in stochastic processing networks. Kelly F, Zachary S, Ziedins I, eds. Stochastic Networks: Theory and Applications (Oxford University Press, Oxford, UK), 147–186.Google Scholar
  • Harrison JM (2003) A broader view of Brownian networks. Ann. Appl. Probabilities 13(3):1119–1150.Crossref, Google Scholar
  • Harrison JM, Lopez MJ (1999) Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33(4):339–368.Crossref, Google Scholar
  • Harrison JM, Van Mieghem JA (1997) Dynamic control of Brownain networks: State-space collapse and equivalent workload formulation. Ann. Appl. Probabilities 6(2):747–771.Google Scholar
  • Harrison JM, Wein LM (1990) Scheduling networks of queues: Heavy traffic analysis of a two-station closed network. Oper. Res. 38(6):1052–1064.Link, Google Scholar
  • Harrison JM, Zeevi A (2005) A method for staffing large call centers based on stochastic fluid models. Manufacturing Service Oper. Management 7(1):20–36.Link, Google Scholar
  • Kaplan EH (1986) Tenant assignment models. Oper. Res. 34(6):832–843.Link, Google Scholar
  • Krzanowski WJ (2000) Principles of Multivariate Analysis (Oxford University Press, Oxford, UK).Google Scholar
  • Laws C, Louth G (1990) Dynamic scheduling of a four-station queueing networks. Probability. Engrg. Inform. Sci. 4(1):131–156.Crossref, Google Scholar
  • Madwar S (2011) United States officials propose further retreat from first-come, first-served organ donation. Canadian Medical Assoc. J. 183(10):E639–E640.Crossref, Google Scholar
  • Mairesse J, Moyal P (2016) Stability of the stochastic matching model. J. Appl. Probab. 53(4):1064–1077.Crossref, Google Scholar
  • 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
  • Meyn SP (2008) Control Techniques for Complex Networks (Cambridge University Press, Cambridge, UK).Google Scholar
  • Meyn SP, Tweedie RL (1993) Markov Chains and Stochastic Stability (Springer, Berlin).Crossref, Google Scholar
  • Moyal P, Perry O (2017) On the instability of matching queues. Ann. Appl. Probab. 27(6):3385–3434.Crossref, Google Scholar
  • Nazarathy Y, Weiss G (2009) Near optimal control of queueing networks over a finite time horizon. Ann. Oper. Res. 170(1):233–249.Crossref, Google Scholar
  • Nazarathy Y, Weiss G (2010) Positive Harris recurrence and diffusion scale analysis of a push pull queueing network. Performance Evaluations 67(4):201–217.Crossref, Google Scholar
  • Neuts MF (1989) Structured Stochastic Matrices of M/G/1 Type and their Applications (Marcel Dekker, New York).Google Scholar
  • Rubino M, Ata B (2009) Dynamic control of a make-to-order, parallel-server system with cancellations. Oper. Res. 57(1):94–108.Link, Google Scholar
  • Squillante MS, Xia CH, Yao DD, Zhang L (2001) Threshold-based priority policies for parallel-server systems with affinity scheduling. Proc. 2001 Amer. Control Conf. (IEEE, New York), 2992–2999.Google Scholar
  • Talreja R, Whitt W (2008) Fluid models for overloaded multi-class many-service queueing systems with FCFS routing. Management Sci. 54(7):1513–1527.Link, Google Scholar
  • Tezcan T (2013) Stability analysis of N-model systems under a static priority rule. Queueing Systems 73(3):235–259.Crossref, Google Scholar
  • Tezcan T, Dai JG (2010) Dynamic control of N-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. 58(1):94–110.Link, Google Scholar
  • Veeger CPL, Etman FP, Rooda V (2008) Generating cycle timethroughput-product mix surfaces using effective process time based aggregate modeling. Markus R, ed. Advances in Simulation for Production and Logistics Applications (Fraunhofer IRB Verlag, Stuttgart), 519–529.Google Scholar
  • Visschers J, Adan IG, Weiss G (2012) A product form solution to a system with multi-type customers and multi-type servers. Queueing Systems 70(2):269–298.Crossref, Google Scholar
  • Wallace RB, Whitt W (2005) A staffing algorithm for call centers with skill-based routing. Manufacturing Service Oper. Management 7(4):276–294.Link, Google Scholar
  • Ward AR, Armony M (2013) Blind fair routing in large-scale service systems with heterogeneous customers and servers. Oper. Res. 61(1):228–243.Link, Google Scholar
  • Wein LM (1992) Scheduling networks of queues: Heavy traffic analysis of a multistation network with controllable inputs. Oper. Res. 40:S312–S334.Link, Google Scholar
  • Whitt W (1980) Some useful functions in functional central limit theorems. Math. Oper. Res. 5(1):67–85.Link, Google Scholar
  • Williams RJ (2000) On dynamic scheduling of a parallel server system with complete resource pooling. Fields Institute Comm. 28:49–71.Google Scholar
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree