Optimal Control of Service Systems with Heterogeneous Servers and Priority Customers

References

• Abouee-Mehrizi H, Baron O, Berma O, Chen D (2019) Managing perishable inventory systems with multiple priority classes. Production Oper. Management 28(9):2305–2322.Crossref, Google Scholar
• Afèche P (2013) Incentive-compatible revenue management in queueing systems: Optimal strategic delay. Manufacturing Service Oper. Management 15(3):423–443.Link, Google Scholar
• Akgun OT, Righter R, Wolff R (2011) Multiple-server system with flexible arrivals. Adv. Appl. Probab. 43(4):985–1004.Crossref, Google Scholar
• Akgun OT, Righter R, Wolff R (2012) Understanding the marginal impact of customer flexibility. Queueing Syst. 71(1–2):5–23.Crossref, Google Scholar
• Altman E, Gaujal B, Hordijk A (2000) Multimodularity, convexity, and optimization properties. Math. Oper. Res. 25(2):324–347.Link, Google Scholar
• Ata B, Kumar S (2005) Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policies. Ann. Appl. Probab. 15(1A):331–391.Crossref, Google Scholar
• Athey S (2001) Single crossing properties and the existence of pure strategy equilibria in games of incomplete information. Econometrica 69(4):861–889.Crossref, Google Scholar
• Athey S (2002) Monotone comparative statics under uncertainty. Quart. J. Econom. 117(1):187–223.Crossref, Google Scholar
• Baron O, Berman O, Krass D, Wang J (2014) Using strategic idleness to improve customer service experience in service networks. Oper. Res. 62(1):123–140.Link, Google Scholar
• Baron O, Berman O, Krass D, Wang J (2017) Strategic idleness and dynamic scheduling in an open-shop service network: Case study and analysis. Manufacturing Service Oper. Management 19(1):52–71.Link, Google Scholar
• Bassamboo A, Randhawa RS, Van Mieghem JA (2012) A little flexibility is all you need: On the asymptotic value of flexible capacity in parallel queuing systems. Oper. Res. 60(6):1423–1435.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. Probab. 11(3):608–649.Crossref, Google Scholar
• Buzacott JA, Mandelbaum M (2008) Flexibility in manufacturing and services: Achievements, insights and challenges. Flex. Serv. Manufacturing J. 20(1–2):13–58.Crossref, Google Scholar
• Cachon GP, Netessine S (2006) Game theory in supply chain analysis. INFORMS TutORials in Operations Research (INFORMS, Catonsville, MD), 200–233.Google Scholar
• Chou MC, Queyranne M, Simchi-Levi D (2006) The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates. Math. Programming 106(1):137–157.Crossref, Google Scholar
• Dinitz M, Moseley B (2022) Scheduling for weighted flow and completion times in reconfigurable networks. Working paper, Johns Hopkins University, Baltimore.Google Scholar
• Gail HR, Hantler SL, Taylor BA (1988) Analysis of a non-preemptive priority multiserver queue. Adv. Appl. Probab. 20(4):852–879.Crossref, Google Scholar
• Gail HR, Hantler SL, Taylor BA (1992) On a preemptive markovian queue with multiple servers and two priority classes. Math. Oper. Res. 17(2):365–391.Link, 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
• Gurumurthi S, Benjaafar S (2004) Modeling and analysis of flexible queueing systems. Naval Res. Logist. 51(5):755–782.Crossref, Google Scholar
• Hajek B (1985) Extremal splittings of point processes. Math. Oper. Res. 10(4):543–556.Link, Google Scholar
• Harrison JM, López MJ (1999) Heavy traffic resource pooling in parallel-server systems. Queueing Syst. 33(4):339–368.Crossref, Google Scholar
• He Q, Chen Y (2018) Revenue-maximizing pricing and scheduling strategies in service systems with flexible customers. Oper. Res. Lett. 46(1):134–137.Crossref, Google Scholar
• He Y, Down DG (2009) On accommodating customer flexibility in service systems. INFOR Inf. Syst. Oper. Res. 47(4):289–295.Crossref, Google Scholar
• Iravani SMR, Kolfal B, Van Oyen MP (2007) Call-center labor cross-training: It’s a small world after all. Management Sci. 53(7):1102–1112.Link, Google Scholar
• Jewitt I (1987) Risk aversion and the choice between risky prospects: The preservation of comparative statics results. Rev. Econom. Stud. 54(1):73–85.Crossref, Google Scholar
• Kanet JJ, Sridharan V (2000) Scheduling with inserted idle time: Problem taxonomy and literature review. Oper. Res. 48(1):99–110.Link, Google Scholar
• Kella O, Yechiali U (1985) Waiting times in the non-preemptive priority M/M/c queue. Stoch. Models 1(2):257–262.Crossref, Google Scholar
• Kim JH, Ahn H, Righter R (2011) Managing queues with heterogeneous servers. J. Appl. Probab. 48(2):435–452.Crossref, Google Scholar
• Koole G (1995) A simple proof of the optimality of a threshold policy in a two-server queueing system. Systems Control Lett. 26(5):301–303.Crossref, Google Scholar
• Koole G (2004) Convexity in tandem queues. Probab. Engrg. Inform. Sci. 18(1):13–31.Crossref, Google Scholar
• Li Q, Yu P (2014) Multimodularity and its applications in three stochastic dynamic inventory problems. Manufacturing Service Oper. Management 16(3):455–463.Link, Google Scholar
• Lin W, Kumar P (1984) Optimal control of a queueing system with two heterogeneous servers. IEEE Trans. Automat. Control 29(8):696–703.Crossref, Google Scholar
• Lippman SA (1975) Applying a new device in the optimization of exponential queuing systems. Oper. Res. 23(4):687–710.Link, Google Scholar
• Luh HP, Viniotis I (2002) Threshold control policies for heterogeneous server systems. Math. Methods Oper. Res. 55(1):121–142.Crossref, Google Scholar
• Maglaras C, Zeevi A (2005) Pricing and design of differentiated services: Approximate analysis and structural insights. Oper. Res. 53(2):242–262.Link, Google Scholar
• Miller DR (1981) Computation of steady-state probabilities for M/M/1 priority queues. Oper. Res. 29(5):945–958.Link, Google Scholar
• Murota K (1998) Discrete convex analysis. Math. Programming 83(1):313–371.Crossref, Google Scholar
• Peköz EA (2002) Optimal policies for multi-server non-preemptive priority queues. Queueing Syst. 42(1):91–101.Crossref, Google Scholar
• Quah JKH, Strulovici B (2012) Aggregating the single crossing property. Econometrica 80(5):2333–2348.Crossref, Google Scholar
• Rubinovitch M (1985) The slow server problem. J. Appl. Probab. 22(1):205–213.Crossref, Google Scholar
• Schaack C, Larson RC (1986) An N-server cutoff priority queue. Oper. Res. 34(2):257–266.Link, Google Scholar
• Shioura A (2017) Algorithms for L-convex function minimization: Connection between discrete convex analysis and other research fields. J. Oper. Res. Soc. Japan 60(3):216–243.Crossref, Google Scholar
• Tsitsiklis JN, Xu K (2012) On the power of (even a little) resource pooling. Stoch. Syst. 2(1):1–66.Link, Google Scholar
• Tsitsiklis JN, Xu K (2017) Flexible queueing architectures. Oper. Res. 65(5):1398–1413.Link, 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
• Wang J, Baron O, Scheller-Wolf A (2015) M/M/c queue with two priority classes. Oper. Res. 63(3):733–749.Link, Google Scholar
• Weber R (1993) On a conjecture about assigning jobs to processors of differing speeds. IEEE Trans. Automat. Control 38(1):166–170.Crossref, Google Scholar
• Yin Y, Cheng S, Wu C (2014) Parallel-machine scheduling to minimize flowtime, holding, and batch delivery costs. Asia-Pac. J. Oper. Res. 31(6):1450044.Crossref, Google Scholar