Flexible Server Allocation and Customer Routing Policies for Two Parallel Queues When Service Rates Are Not Additive

References

• Andradóttir S, Ayhan H, Down DG. Queueing systems with synergistic servers. Oper. Res. (2011) 59(3):772–780Link, Google Scholar
• Armony M. Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems: Theory Appl. (2005) 51(3):287–329Crossref, Google Scholar
• Bell SL, Williams RJ. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. (2001) 11(3):608–649Crossref, Google Scholar
• Buyukkoc C, Varaiya P, Walrand J. The cμ-rule revisited. Adv. Appl. Probab. (1985) 17(1):237–238Crossref, Google Scholar
• Derman C, Lieberman GJ, Ross SM. On the optimal assignment of servers and a repairman. J. Appl. Probab. (1980) 17(2):577–581Crossref, Google Scholar
• Down DG, Lewis ME. The N-network model with upgrades. Probab. Engrg. Inform. Sci. (2010) 24(2):171–200Crossref, Google Scholar
• Green L. Queueing system with general-use and limited-use servers. Oper. Res. (1985) 33(1):168–182Link, Google Scholar
• Harrison JM. Dynamic scheduling of a multiclass queue: Discount optimality. Oper. Res. (1975a) 23(2):370–382Google Scholar
• Harrison JM. A priority queue with discounted linear costs. Oper. Res. (1975b) 23(2):260–269Link, Google Scholar
• Harrison JM. Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies. Ann. Appl. Probab. (1998) 8(3):822–848Crossref, Google Scholar
• Harrison JM, López MJ. Heavy traffic resource pooling in parallel-server systems. Queueing Systems: Theory Appl. (1999) 33(4):339–368Crossref, Google Scholar
• Hordijk A, Koole G. On the optimality of the generalized shortest queue policy. Probab. Engrg. Inform. Sci. (1990) 4(4):477–487Crossref, Google Scholar
• Hordijk A, Koole G. On the assignment of customers to parallel queues. Probab. Engrg. Inform. Sci. (1992) 6:495–511Crossref, Google Scholar
• Kingman JFC. Two similar queues in parallel. Ann. Math. Statist. (1961) 32(4):1314–1323Crossref, Google Scholar
• Lippman SA. Applying a new device in the optimization of exponential queueing system. Oper. Res. (1975) 23(4):687–710Link, Google Scholar
• Sennott LI. Stochastic Dynamic Programming and the Control of Queueing Systems (1999) (John Wiley & Sons, New York) Wiley Series in Probability and StatisticsGoogle Scholar
• Serfozo RF. An equivalence between continuous and discrete time Markov decision processes. Oper. Res. (1978) 27(3):616–620Link, Google Scholar
• Weber RR. On the optimal assignment of customers to parallel servers. J. Appl. Probab. (1978) 15(2):406–413Crossref, Google Scholar
• Winston W. Assignment of customers to servers in a heterogeneous queueing system with switching. Oper. Res. (1977a) 25(3):469–483Link, Google Scholar
• Winston W. Optimal dynamic rules for assigning customers to servers in a heterogeneous queueing system. Naval Res. Logist. Quart. (1977b) 24(2):293–300Crossref, Google Scholar
• Winston W. Optimality of the shortest line discipline. J. Appl. Probab. (1977c) 14:181–189Crossref, Google Scholar