Learning-Based Optimal Admission Control in a Single-Server Queuing System

References

• Adler S, Moharrami M, Subramanian V (2022) Learning a discrete set of optimal allocation rules in queueing systems with unknown service rates. Preprint, submitted February 4, https://arxiv.org/abs/2202.02419.Google Scholar
• Agrawal S, Jia R (2022) Learning in structured MDPs with convex cost functions: Improved regret bounds for inventory management. Oper. Res. 70(3):1646–1664.Link, Google Scholar
• Atar R, Castiel E, Shadmi Y (2022) Scheduling in the high uncertainty heavy traffic regime. Preprint, submitted April 12, https://arxiv.org/abs/2204.05733.Google Scholar
• Balsubramani A (2014) Sharp finite-time iterated-logarithm martingale concentration. Preprint, submitted May 12, https://arxiv.org/abs/1405.2639.Google Scholar
• Bertsekas D (2019) Reinforcement Learning and Optimal Control (Athena Scientific, Belmont, MA).Google Scholar
• Buyukkoc C, Varaiya P, Walrand J (1985) The cμ rule revisited. Adv. Appl. Probab. 17(1):237–238.Google Scholar
• Chen Y, Hasenbein JJ (2020) Knowledge, congestion, and economics: Parameter uncertainty in Naor’s model. Queueing Systems 96(1–2):83–99.Google Scholar
• Chen X, Liu Y, Hong G (2023) An online learning approach to dynamic pricing and capacity sizing in service systems. Oper. Res., ePub ahead of print June 12, https://doi.org/10.1287/opre.2020.612.Google Scholar
• Choudhury T, Joshi G, Wang W, Shakkottai S (2021) Job dispatching policies for queueing systems with unknown service rates. Proc. 22nd Internat. Sympos. Theory Algorithmic Foundations Protocol Design Mobile Networks Mobile Comput. (Association for Computing Machinery, New York), 181–190.Google Scholar
• Cohen A (2019a) Asymptotic analysis of a multiclass queueing control problem under heavy traffic with model uncertainty. Stochastic Systems 9(4):359–391.Link, Google Scholar
• Cohen A (2019b) Brownian control problems for a multiclass M/M/1 queueing problem with model uncertainty. Math. Oper. Res. 44(2):739–766.Link, Google Scholar
• Cohen A, Saha S (2021) Asymptotic optimality of the generalized cμ rule under model uncertainty. Stochastic Processes Appl. 136:206–236.Google Scholar
• Cox DR, Smith WL (1961) Queues. Methuen’s Monographs on Statistical Subjects, Methuen & Co., Ltd., London (John Wiley & Sons, Inc., New York).Google Scholar
• Csörgő M (1968) On the strong law of large numbers and the central limit theorem for martingales. Trans. Amer. Math. Soc. 131:259–275.Google Scholar
• Durrett R (2016) Essentials of Stochastic Processes, Springer Texts in Statistics (Springer, Cham, Switzerland).Google Scholar
• Jia H, Shi C, Shen S (2022) Online learning and pricing for service systems with reusable resources. Oper. Res., ePub ahead of print November 10, https://doi.org/10.1287/opre.2022.2381.Link, Google Scholar
• Johansen SG, Stidham S Jr (1980) Control of arrivals to a stochastic input-output system. Adv. Appl. Probab. 12(4):972–999.Google Scholar
• Knudsen NC (1972) Individual and social optimization in a multiserver queue with a general cost-benefit structure. Econometrica 40:515–528.Google Scholar
• Krishnasamy S, Arapostathis A, Johari R, Shakkottai S (2018a) On learning the cµ rule in single and parallel server networks. Preprint, submitted February 2, https://arxiv.org/abs/1802.06723.Google Scholar
• Krishnasamy S, Sen R, Johari R, Shakkottai S (2021) Learning unknown service rates in queues: A multiarmed bandit approach. Oper. Res. 69(1):315–330.Link, Google Scholar
• Krishnasamy S, Akhil PT, Arapostathis A, Sundaresan R, Shakkottai S (2018b) Augmenting max-weight with explicit learning for wireless scheduling with switching costs. IEEE/ACM Trans. Networking 26(6):2501–2514.Google Scholar
• Lattimore T, Szepesvári C (2020) Bandit Algorithms (Cambridge University Press, Cambridge, UK).Google Scholar
• Lippman SA, Stidham S Jr (1977) Individual vs. social optimization in exponential congestion systems. Oper. Res. 25(2):233–247.Link, Google Scholar
• Naor P (1969) The regulation of queue size by levying tolls. Econometrica 37(1):15–24.Google Scholar
• Neely MJ, Rager ST, La Porta TF (2012) Max-weight learning algorithms for scheduling in unknown environments. IEEE Trans. Automatic Control 57(5):1179–1191.Google Scholar
• Oz B (2022) Optimal admission policy to an observable M/G/1 queue. Queueing Systems 100(3–4):477–479.Google Scholar
• Shwartz A, Makowski AM (1986) An optimal adaptive scheme for two competing queues with constraints. Bensoussan FA, Lions JL, eds. Analysis and Optimization of Systems, vol. 83 (Springer, Berlin), 515–532.Google Scholar
• Smith WE (1956) Various optimizers for single-stage production. Naval Res. Logist. Quart. 3:59–66.Google Scholar
• Stahlbuhk T, Shrader B, Modiano E (2021) Learning algorithms for minimizing queue length regret. IEEE Trans. Inform. Theory 67(3):1759–1781.Google Scholar
• Sutton RS, Barto AG (2018) Reinforcement Learning: An Introduction, 2nd ed., Adaptive Computation and Machine Learning (MIT Press, Cambridge, MA).Google Scholar
• Takagi H, Tarabia AMK (2009) Explicit probability density function for the length of a busy period in an M/M/1/K queue. Yue W, Takahashi Y, Takagi H, eds. Advances in Queueing Theory and Network Applications (Springer, New York), 213–226.Google Scholar
• Vershynin R (2018) High-Dimensional Probability, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 47 (Cambridge University Press, Cambridge, UK).Google Scholar
• Wainwright MJ (2019) High-Dimensional Statistics, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 48 (Cambridge University Press, Cambridge, UK).Google Scholar
• Walton N, Xu K (2021) Learning and information in stochastic networks and queues. Preprint, submitted May 18, https://arxiv.org/abs/2105.08769.Google Scholar
• Yang Z, Srikant R, Ying L (2023) Learning while scheduling in multi-server systems with unknown statistics: MaxWeight with discounted UCB. Ruiz F, Dy J, van de Meent JW, eds. Proc. 26th Internat. Conf. Artificial Intelligence Statist., vol. 206 (PMLR, New York), 4275–4312.Google Scholar
• Zhong Y, Birge JR, Ward A (2022) Learning the scheduling policy in time-varying multiclass many server queues with abandonment. Preprint, submitted May 9, https://dx.doi.org/10.2139/ssrn.4090021.Google Scholar