Incentives for Shared Services: Multiserver Queueing Systems with Priorities

Published Online:https://doi.org/10.1287/msom.2021.1034

References

  • Aksin OZ, Masini A (2008) Effective strategies for internal outsourcing and offshoring of business services: An empirical investigation. J. Oper. Management 26(2):239–256.CrossrefGoogle Scholar
  • Anily S, Haviv M (2010) Cooperation in service systems. Oper. Res. 58(3):660–673.LinkGoogle Scholar
  • Anily S, Haviv M (2017) Line balancing in parallel M/M/1 lines and loss systems as cooperative games. Production Oper. Management 26(8):1568–1584.CrossrefGoogle Scholar
  • Armony M, Roels G, Song H (2021) Pooling queues with strategic servers: The effects of customer ownership. Oper. Res. 69(1):13–29.LinkGoogle Scholar
  • Dijk NM, Sluis E (2008) To pool or not to pool in call centers. Production Oper. Management 17(3):296–305.CrossrefGoogle Scholar
  • Edmonds J (1970) Submodular Functions, Matroids, and Certain Polyhedra (Gordon and Breach, New York).Google Scholar
  • Federgruen A, Groenevelt H (1988a) Characterization and optimization of achievable performance in general queueing systems. Oper. Res. 36(5):733–741.LinkGoogle Scholar
  • Federgruen A, Groenevelt H (1988b) M/G/c queueing systems with multiple customer classes: Characterization and control of achievable performance under nonpreemptive priority rules. Management Sci. 34(9):1121–1138.LinkGoogle Scholar
  • Fujishige S (1980) Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5(2):186–196.LinkGoogle Scholar
  • Garcia-Sanz M, Fernández FR, Fiestras-Janeiro MG, García-Jurado I, Puerto J (2008) Cooperation in Markovian queueing models. Eur. J. Oper. Res. 188(2):485–495.CrossrefGoogle Scholar
  • Granot D (1986) A generalized linear production model: A unifying model. Math. Programming 34(2):212–222.Google Scholar
  • Guo P, Leng M, Wang Y (2013) A fair staff allocation rule for the capacity pooling of multiple call centers. Oper. Res. Lett. 41(5):490–493.CrossrefGoogle Scholar
  • He S, Zhang J, Zhang S (2012) Polymatroid optimization, submodularity, and joint replenishment games. Oper. Res. 60(1):128–137.LinkGoogle Scholar
  • Karsten F, Slikker M, van Houtum GJ (2014) Domain extensions of the Erlang loss function: Their scalability and its applications to cooperative games. Probab. Engrg. Inform. Sci. 28(4):473–488.CrossrefGoogle Scholar
  • Karsten F, Slikker M, Van Houtum GJ (2015) Resource pooling and cost allocation among independent service providers. Oper. Res. 63(2):476–488.LinkGoogle Scholar
  • Kleinrock L (1975) Queuing Systems (Wiley, New York).Google Scholar
  • Liu H, Yu Y, Benjaafar S, Wang H (2021) Price-directed cost sharing and demand allocation among service providers with multiple demand sources and multiple facilities. Manufacturing Service Oper. Management Forthcoming.LinkGoogle Scholar
  • Özen U, Reiman MI, Wang Q (2011) On the core of cooperative queueing games. Oper. Res. Lett. 39(5):385–389.CrossrefGoogle Scholar
  • Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17(6):1163–1170.CrossrefGoogle Scholar
  • Shanthikumar JG, Yao DD (1992) Multiclass queueing systems: Polymatroidal structure and optimal scheduling control. Oper. Res. 40(2):293–299.LinkGoogle Scholar
  • Smith DR, Whitt W (1981) Resource sharing for efficiency in traffic systems. Bell Systems Tech. J. 60(1):39–55.CrossrefGoogle Scholar
  • Stidham S Jr (1970) On the optimality of single-server queuing systems. Oper. Res. 18(4):708–732.LinkGoogle Scholar
  • Tekin E, Hopp WJ, Oyen MPV (2009) Pooling strategies for call center agent cross-training. IIE Trans. 41(6):546–561.CrossrefGoogle Scholar
  • Yu Y, Benjaafar S, Gerchak Y (2015) Capacity sharing and cost allocation among independent firms with congestion. Production Oper. Management 24(8):1285–1310.CrossrefGoogle Scholar
  • Zeng Y, Zhang L, Cai X, Li J (2018) Cost sharing for capacity transfer in cooperating queueing systems. Production Oper. Management 27(4):644–662.CrossrefGoogle Scholar
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.