Optimal Partition for a Multi-Type Queueing System

References

• [1] Allon G, Federgruen A (2008) Service competition with general queueing facilities. Oper. Res. 56(4):827–849.Link, Google Scholar
• [2] Andradóttir S, Ayhan H, Down DG (2017) Resource pooling in the presence of failures: Efficiency versus risk. Eur. J. Oper. Res. 256(1):230–241.Crossref, Google Scholar
• [3] Argon NT, Ziya S (2009) Priority assignment under imperfect information on customer type identities. Manufacturing Service Oper. Management 11(4):674–693.Link, Google Scholar
• [4] Baras J, Ma DJ, Makowski A (1985) K competing queues with geometric service requirements and linear costs: The μc-rule is always optimal. Systems Control Lett. 6(3):173–180.Crossref, Google Scholar
• [5] Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [6] Cao P, He S, Huang J, Liu Y (2021) To pool or not to pool: Queueing design for large-scale service systems. Oper. Res. 69(6):1866–1885.Link, Google Scholar
• [7] Cox DR, Smith WL (1961) Queues, Monographs on Statistics and Applied Probability, vol. 2 (Springer, Dordrecht, Netherlands).Google Scholar
• [8] Dieker A, Ghosh S, Squillante MS (2017) Optimal resource capacity management for stochastic networks. Oper. Res. 65(1):221–241.Link, Google Scholar
• [9] Feng H, Misra V, Rubenstein D (2005) Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems. Performance Evaluation 62(1–4):475–492.Crossref, Google Scholar
• [10] Haigh J (2013) Probability Models (Springer, London).Crossref, Google Scholar
• [11] Harchol-Balter M, Scheller-Wolf A, Young AR (2009) Surprising results on task assignment in server farms with high-variability workloads. Proc. Eleventh Internat. Joint Conf. Measurement Model. Comput. Systems SIGMETRICS ‘09 (Association for Computing Machinery, New York), 287–298.Google Scholar
• [12] Hassin R, Ravner L (2019) Delay-minimizing capacity allocation in an infinite server-queueing system. Stochastic Systems 9(1):27–46.Link, Google Scholar
• [13] Hassin R, Shaki YY, Yovel U (2015) Optimal service-capacity allocation in a loss system. Naval Res. Logist. 62(2):81–97.Crossref, Google Scholar
• [14] Hirayama T, Kijima M, Nishimura S (1989) Further results for dynamic scheduling of multiclass G/G/1 queues. J. Appl. Probab. 26(3):595–603.Crossref, Google Scholar
• [15] Hu B, Benjaafar S (2009) Partitioning of servers in queueing systems during rush hour. Manufacturing Service Oper. Management 11(3):416–428.Link, Google Scholar
• [16] Hung HC, Posner ME (2007) Allocation of jobs and identical resources with two pooling centers. Queueing Systems 55(3):179–194.Crossref, Google Scholar
• [17] Iyer AV, Jain A (2004) Modeling the impact of merging capacity in production-inventory systems. Management Sci. 50(8):1082–1094.Link, Google Scholar
• [18] Jouini O, Dallery Y, Nait-Abdallah R (2008) Analysis of the impact of team-based organizations in call center management. Management Sci. 54(2):400–414.Link, Google Scholar
• [19] Kleinrock L (1976): Computer Applications, Queueing Systems, vol. 2 (Wiley, Hoboken, NJ).Google Scholar
• [20] Mandelbaum A, Reiman MI (1998) On pooling in queueing networks. Management Sci. 44(7):971–981.Link, Google Scholar
• [21] 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
• [22] Nag K, Helal M (2017) Evaluating Erlang C and Erlang A models for staff optimization: A case study in an airline call center. 2017 IEEE Internat. Conf. Indust. Engrg. Engrg. Management IEEM (IEEE, Piscataway, NJ), 1–5.Google Scholar
• [23] Saghafian S, Hopp WJ, Van Oyen MP, Desmond JS, Kronick SL (2012) Patient streaming as a mechanism for improving responsiveness in emergency departments. Oper. Res. 60(5):1080–1097.Link, Google Scholar
• [24] Sakov A, Zeltyn S (2000) Empirical analysis of a call center. Technical report, Technion, Haifa, Israel.Google Scholar
• [25] Smith DR, Whitt W (1981) Resource sharing for efficiency in traffic systems. Bell System Tech. J. 60(1):39–55.Crossref, Google Scholar
• [26] Sunar N, Tu Y, Ziya S (2021) Pooled vs. dedicated queues when customers are delay-sensitive. Management Sci. 67(6):3785–3802.Link, Google Scholar
• [27] van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5(3):809–833.Crossref, Google Scholar
• [28] Whitt W (1999) Partitioning customers into service groups. Management Sci. 45(11):1579–1592.Link, Google Scholar
• [29] Xu S, Xu B, Peng D (2006) The waiting time distribution of a Pareto service self-similar queuing model for wireless network nodes. 2006 Internat. Conf. Wireless Commun. Networking Mobile Comput. (IEEE, Piscataway, NJ), 1–3.Google Scholar
• [30] Yu Y, Benjaafar S, Gerchak Y (2015) Capacity sharing and cost allocation among independent firms with congestion. Production Oper. Management 24(8):1285–1310.Crossref, Google Scholar