IDEAS home Printed from https://ideas.repec.org/a/spr/queues/v82y2016i3d10.1007_s11134-015-9466-6.html
   My bibliography  Save this article

Optimal control of a multiclass queueing system when customers can change types

Author

Listed:
  • Ping Cao

    (University of Science and Technology of China)

  • Jingui Xie

    (University of Science and Technology of China)

Abstract

It is well known that the $$c\mu $$ c μ -rule is optimal for serving multiple types of customers to minimize the expected total waiting cost. What happens when less valuable customers (those with lower $$c\mu $$ c μ ) can change to valuable ones? In this paper, we study this problem by considering two types of customers. The first type of customers is less valuable, but it may change to the second type (i.e., more valuable customers) after a random amount of time. The resulting problem is a continuous-time Markov decision process with countable state space and unbounded transition rates, which is known to be technically challenging. We first prove the existence of optimal non-idling stationary policies. Based on the smoothed rate truncation, we derive conditions under which a modified $$c\mu $$ c μ -rule remains optimal. For other cases, we develop a simple heuristic policy for serving customers. Our numerical study shows that the heuristic policy performs close to the optimal, with the worst case within 2.47 % of the optimal solution and 95 % of the examples within 1 % of the optimal solution.

Suggested Citation

  • Ping Cao & Jingui Xie, 2016. "Optimal control of a multiclass queueing system when customers can change types," Queueing Systems: Theory and Applications, Springer, vol. 82(3), pages 285-313, April.
    • Handle: RePEc:spr:queues:v:82:y:2016:i:3:d:10.1007_s11134-015-9466-6
    DOI: 10.1007/s11134-015-9466-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11134-015-9466-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11134-015-9466-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Richard F. Serfozo, 1979. "Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes," Operations Research, INFORMS, vol. 27(3), pages 616-620, June.
    2. Xianping Guo & Alexei Piunovskiy, 2011. "Discounted Continuous-Time Markov Decision Processes with Constraints: Unbounded Transition and Loss Rates," Mathematics of Operations Research, INFORMS, vol. 36(1), pages 105-132, February.
    3. Linn I. Sennott, 1989. "Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs," Operations Research, INFORMS, vol. 37(4), pages 626-633, August.
    4. Mustafa Akan & Oguzhan Alagoz & Baris Ata & Fatih Safa Erenay & Adnan Said, 2012. "A Broader View of Designing the Liver Allocation System," Operations Research, INFORMS, vol. 60(4), pages 757-770, August.
    5. Guo, Xianping & Zhang, Wenzhao, 2014. "Convergence of controlled models and finite-state approximation for discounted continuous-time Markov decision processes with constraints," European Journal of Operational Research, Elsevier, vol. 238(2), pages 486-496.
    6. Achal Bassamboo & Ramandeep S. Randhawa, 2010. "On the Accuracy of Fluid Models for Capacity Sizing in Queueing Systems with Impatient Customers," Operations Research, INFORMS, vol. 58(5), pages 1398-1413, October.
    7. Liuer Ye & Xianping Guo, 2010. "New sufficient conditions for average optimality in continuous-time Markov decision processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(1), pages 75-94, August.
    8. Alexey Piunovskiy & Yi Zhang, 2012. "The Transformation Method for Continuous-Time Markov Decision Processes," Journal of Optimization Theory and Applications, Springer, vol. 154(2), pages 691-712, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alexander Dudin & Olga Dudina & Sergei Dudin & Konstantin Samouylov, 2021. "Analysis of Single-Server Multi-Class Queue with Unreliable Service, Batch Correlated Arrivals, Customers Impatience, and Dynamical Change of Priorities," Mathematics, MDPI, vol. 9(11), pages 1-17, May.
    2. Yue Hu & Carri W. Chan & Jing Dong, 2022. "Optimal Scheduling of Proactive Service with Customer Deterioration and Improvement," Management Science, INFORMS, vol. 68(4), pages 2533-2578, April.
    3. Kristoffel C. Pandiangan & Palti Maruli Tua Sitorus, 2017. "Analysis of Queue System to Improve the Quality of Service in GraPARI Telkomsel Banda Aceh," International Journal of Business and Economic Affairs (IJBEA), Sana N. Maswadeh, vol. 2(4), pages 220-226.
    4. Valentina Klimenok & Alexander Dudin & Olga Dudina & Irina Kochetkova, 2020. "Queuing System with Two Types of Customers and Dynamic Change of a Priority," Mathematics, MDPI, vol. 8(5), pages 1-25, May.
    5. Paret, Kyle E. & Mayorga, Maria E. & Lodree, Emmett J., 2021. "Assigning spontaneous volunteers to relief efforts under uncertainty in task demand and volunteer availability," Omega, Elsevier, vol. 99(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Noa Zychlinski, 2023. "Applications of fluid models in service operations management," Queueing Systems: Theory and Applications, Springer, vol. 103(1), pages 161-185, February.
    2. Guo, Xianping & Zhang, Wenzhao, 2014. "Convergence of controlled models and finite-state approximation for discounted continuous-time Markov decision processes with constraints," European Journal of Operational Research, Elsevier, vol. 238(2), pages 486-496.
    3. Alexey Piunovskiy & Yi Zhang, 2012. "The Transformation Method for Continuous-Time Markov Decision Processes," Journal of Optimization Theory and Applications, Springer, vol. 154(2), pages 691-712, August.
    4. Xianping Guo & Yi Zhang, 2016. "Optimality of Mixed Policies for Average Continuous-Time Markov Decision Processes with Constraints," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1276-1296, November.
    5. Dongyuan Zhan & Amy R. Ward, 2019. "Staffing, Routing, and Payment to Trade off Speed and Quality in Large Service Systems," Operations Research, INFORMS, vol. 67(6), pages 1738-1751, November.
    6. Oscar Vega-Amaya & Raúl Montes-de-Oca, 1998. "Application of average dynamic programming to inventory systems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 47(3), pages 451-471, October.
    7. Allahviranloo, Mahdieh & Recker, Will, 2013. "Daily activity pattern recognition by using support vector machines with multiple classes," Transportation Research Part B: Methodological, Elsevier, vol. 58(C), pages 16-43.
    8. Yonghui Huang & Xianping Guo, 2020. "Multiconstrained Finite-Horizon Piecewise Deterministic Markov Decision Processes with Unbounded Transition Rates," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 641-659, May.
    9. Baris Ata & Yichuan Ding & Stefanos Zenios, 2021. "An Achievable-Region-Based Approach for Kidney Allocation Policy Design with Endogenous Patient Choice," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 36-54, 1-2.
    10. Alexander Zadorojniy & Guy Even & Adam Shwartz, 2009. "A Strongly Polynomial Algorithm for Controlled Queues," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 992-1007, November.
    11. Xiuli Chao & Frank Y. Chen, 2005. "An Optimal Production and Shutdown Strategy when a Supplier Offers an Incentive Program," Manufacturing & Service Operations Management, INFORMS, vol. 7(2), pages 130-143, March.
    12. Dwi Ertiningsih & Sandjai Bhulai & Flora Spieksma, 2018. "A novel use of value iteration for deriving bounds for threshold and switching curve optimal policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(8), pages 638-659, December.
    13. Hui Zhao & Vinayak Deshpande & Jennifer K. Ryan, 2006. "Emergency transshipment in decentralized dealer networks: When to send and accept transshipment requests," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(6), pages 547-567, September.
    14. I. M. MacPhee & L. J. Müller, 2007. "Stability Criteria for Multi-class Queueing Networks with Re-entrant Lines," Methodology and Computing in Applied Probability, Springer, vol. 9(3), pages 377-388, September.
    15. Li, Han-Lin & Fang, Shu-Cherng & Huang, Yao-Huei & Nie, Tiantian, 2016. "An enhanced logarithmic method for signomial programming with discrete variables," European Journal of Operational Research, Elsevier, vol. 255(3), pages 922-934.
    16. Waal, P.R. & Dijk, N.M. van, 1988. "Monotonicity of performance measures in a processor sharing queue," Serie Research Memoranda 0051, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    17. Chenguang (Allen) Wu & Achal Bassamboo & Ohad Perry, 2019. "Service System with Dependent Service and Patience Times," Management Science, INFORMS, vol. 65(3), pages 1151-1172, March.
    18. Nicole Leder & Bernd Heidergott & Arie Hordijk, 2010. "An Approximation Approach for the Deviation Matrix of Continuous-Time Markov Processes with Application to Markov Decision Theory," Operations Research, INFORMS, vol. 58(4-part-1), pages 918-932, August.
    19. Guihua Wang & Ronghuo Zheng & Tinglong Dai, 2022. "Does Transportation Mean Transplantation? Impact of New Airline Routes on Sharing of Cadaveric Kidneys," Management Science, INFORMS, vol. 68(5), pages 3660-3679, May.
    20. Sobel, Matthew J. & Szmerekovsky, Joseph G. & Tilson, Vera, 2009. "Scheduling projects with stochastic activity duration to maximize expected net present value," European Journal of Operational Research, Elsevier, vol. 198(3), pages 697-705, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:82:y:2016:i:3:d:10.1007_s11134-015-9466-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.