175
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Event-based optimization of service rate control in retrial queues

, &
Pages 979-991 | Received 22 Dec 2020, Accepted 21 Feb 2022, Published online: 31 Mar 2022

References

  • Almehdawe, E., Jewkes, B., & He, Q.-M. (2019). Optimization in a two-stage multi-server service system with customer priorities. Journal of the Operational Research Society, 70(2), 326–337. https://doi.org/10.1080/01605682.2018.1438762
  • Artalejo, J. R. (2010). Accessible bibliography on retrial queues: Progress in 2000–2009. Mathematical and Computer Modelling, 51(9-10), 1071–1081. https://doi.org/10.1016/j.mcm.2009.12.011
  • Ata, B., & Shneorson, S. (2006). Dynamic control of an M/M/1 service system with adjustable arrival and service rates. Management Science, 52, 1778–1791.
  • Badian-Pessot, P., Lewis, M. E., & Down, D. G. (2021). Optimal control policies for an M/M/1 queue with a removable server and dynamic service rates. Probability in the Engineering and Informational Sciences, 35, 189–209.
  • Cao, X.-R. (2005). Basic ideas for event-based optimization of Markov systems. Discrete Event Dynamic Systems, 15(2), 169–197. https://doi.org/10.1007/s10626-004-6211-4
  • Cao, X.-R. (2007). Stochastic Learning and Optimization–A Sensitivity-based Approach. Springer.
  • Efrosinin, D., & Breuer, L. (2006). Threshold policies for controlled retrial queues with heterogeneous servers. Annals of Operations Research, 141(1), 139–162. https://doi.org/10.1007/s10479-006-5297-5
  • Falin, G. (1990). A survey of retrial queues. Queueing Systems, 7(2), 127–167. https://doi.org/10.1007/BF01158472
  • George, J. M., & Harrison, J. M. (2001). Dynamic control of a queue with adjustable service rate. Operations Research, 49(5), 720–731. https://doi.org/10.1287/opre.49.5.720.10605
  • Janssen, A., & van Leeuwaarden, J. S. (2015). Staffing many-server systems with admission control and retrials. Advances in Applied Probability, 47(2), 450–475. https://doi.org/10.1239/aap/1435236983
  • Jia, Q.-S. (2011). On solving event-based optimization with average reward over infinite stages. IEEE Transactions on Automatic Control, 56(12), 2912–2917. https://doi.org/10.1109/TAC.2011.2159653
  • Kumar, R., Lewis, M. E., & Topaloglu, H. (2013). Dynamic service rate control for a single-server queue with Markov-modulated arrivals. Naval Research Logistics (NRL), 60(8), 661–677. https://doi.org/10.1002/nav.21560
  • Lee, N., & Kulkarni, V. G. (2014). Optimal arrival rate and service rate control of multi-server queues. Queueing Systems, 76(1), 37–50. https://doi.org/10.1007/s11134-012-9341-7
  • Littman, M. L., Dean, T. L., & Kaelbling, L. P. (1995). On the complexity of solving Markov decision problems. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, 394–402.
  • Puterman, M. L. (2014). Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons.
  • Roubos, D., & Bhulai, S. (2010). Approximate dynamic programming techniques for the control of time-varying queuing systems applied to call centers with abandonments and retrials. Probability in the Engineering and Informational Sciences, 24(1), 27–45. https://doi.org/10.1017/S026996480999012X
  • Wang, K.-H., & Huang, H.-M. (1995). Optimal control of an M/Ek/1 queueing system with a removable service station. Journal of the Operational Research Society, 46, 1014–1022.
  • Wang, J., Zhang, Y., & Zhang, Z. G. (2021). Strategic joining in an M/M/k queue with asynchronous and synchronous multiple vacations. Journal of the Operational Research Society, 72, 161–179.
  • Ward, A. R., & Armony, M. (2013). Blind fair routing in large-scale service systems with heterogeneous customers and servers. Operations Research, 61(1), 228–243. https://doi.org/10.1287/opre.1120.1129
  • Weber, R. R., & Stidham, S. (1987). Optimal control of service rates in networks of queues. Advances in Applied Probability, 19(1), 202–218. https://doi.org/10.2307/1427380
  • Weichbold, J., & Winkler, A. (2010). Optimal stochastic scheduling in a single server biclass retrial queueing system. Mathematical Methods of Operations Research, 72(3), 405–431. https://doi.org/10.1007/s00186-010-0325-2
  • Winkler, A. (2013). Dynamic scheduling of a single-server two-class queue with constant retrial policy. Annals of Operations Research, 202(1), 197–210. https://doi.org/10.1007/s10479-011-0950-z
  • Xia, L. (2014). Event-based optimization of admission control in open queueing networks. Discrete Event Dynamic Systems, 24(2), 133–151. https://doi.org/10.1007/s10626-013-0167-1
  • Xia, L., & Chen, S. (2018). Dynamic pricing control for open queueing networks. IEEE Transactions on Automatic Control, 63(10), 3290–3300. https://doi.org/10.1109/TAC.2018.2799576
  • Xia, L., He, Q.-M., & Alfa, A. S. (2017). Optimal control of state-dependent service rates in a MAP/M/1 queue. IEEE Transactions on Automatic Control, 62, 4965–4979.
  • Xia, L., & Jia, Q.-S. (2015). Parameterized Markov decision process and its application to service rate control. Automatica, 54, 29–35. https://doi.org/10.1016/j.automatica.2015.01.006
  • Xia, L., Jia, Q.-S., & Cao, X.-R. (2014). A tutorial on event-based optimization – A new optimization framework. Discrete Event Dynamic Systems, 24(2), 103–132. https://doi.org/10.1007/s10626-013-0170-6
  • Xia, L., & Shihada, B. (2013). Max-min optimality of service rate control in closed queueing networks. IEEE Transactions on Automatic Control, 58(4), 1051–1056. https://doi.org/10.1109/TAC.2012.2218145
  • Xia, L., Zhang, Z. G., & Li, Q. L. (2021). A c/μ-rule for job assignment in heterogeneous group-server queues. Production and Operations Management. https://doi.org/10.1111/poms.13605.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.