IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v26y2024i2d10.1007_s11009-024-10080-3.html
   My bibliography  Save this article

Optimal Pricing Strategy in an Unreliable M/M/1 Retrial Queue with Delayed Repair and Breakdown Deterioration

Author

Listed:
  • Fan Xu

    (Yanshan University)

  • Ruiling Tian

    (Yanshan University)

  • Qi Shao

    (Yanshan University)

Abstract

This paper focuses on an unreliable M/M/1 retrial queue with delayed repair, in which a novel breakdown mechanism is considered, i.e., a normal breakdown may deteriorate into a major breakdown. Arriving customers are not provided with the system’s information, but must decide whether or not to join it. First, the steady state of the system is analyzed. Then, based on the practical requirements of the cloud computing system, we construct an optimization model to minimize the response time of requesting information with proportions of detection, and repair of the normal and major breakdown as the decision variable. Furthermore, equilibrium joining strategies and the socially optimal pricing strategy are studied from the perspectives of the customer and the social planner, respectively. Finally, numerical examples are used to illustrate the impact of different parameters on strategies.

Suggested Citation

  • Fan Xu & Ruiling Tian & Qi Shao, 2024. "Optimal Pricing Strategy in an Unreliable M/M/1 Retrial Queue with Delayed Repair and Breakdown Deterioration," Methodology and Computing in Applied Probability, Springer, vol. 26(2), pages 1-22, June.
    • Handle: RePEc:spr:metcap:v:26:y:2024:i:2:d:10.1007_s11009-024-10080-3
    DOI: 10.1007/s11009-024-10080-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-024-10080-3
    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/s11009-024-10080-3?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. Shan Gao & Hua Dong & Xianchao Wang, 2021. "Equilibrium and pricing analysis for an unreliable retrial queue with limited idle period and single vacation," Operational Research, Springer, vol. 21(1), pages 621-643, March.
    2. Shan Gao & Hua Dong & Xianchao Wang, 2021. "Correction to: Equilibrium and pricing analysis for an unreliable retrial queue with limited idle period and single vacation," Operational Research, Springer, vol. 21(1), pages 645-646, March.
    3. Shweta Upadhyaya & Richa Sharma & Divya Agarwal & Geetika Malik, 2023. "Convexity analysis and cost optimization of a retrial queue with Bernoulli vacation and delayed phase mending," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(5), pages 1671-1690, October.
    4. Shweta Upadhyaya & Chetna Kushwaha, 2020. "Performance prediction and ANFIS computing for unreliable retrial queue with delayed repair under modified vacation policy," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 17(4), pages 437-466.
    5. Wang, Jinting & Zhang, Feng, 2013. "Strategic joining in M/M/1 retrial queues," European Journal of Operational Research, Elsevier, vol. 230(1), pages 76-87.
    6. Agassi Melikov & Sevinj Aliyeva & Janos Sztrik, 2021. "Retrial Queues with Unreliable Servers and Delayed Feedback," Mathematics, MDPI, vol. 9(19), pages 1-23, September.
    Full references (including those not matched with items on IDEAS)

    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. R. Harini & K. Indhira, 2024. "Meta heuristic optimization of a batch arrival retrial queue with optional re-service and M-optional vacations," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(9), pages 4252-4282, September.
    2. V., Saravanan & V., Poongothai & P., Godhandaraman, 2023. "Performance analysis of a multi server retrial queueing system with unreliable server, discouragement and vacation model," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 214(C), pages 204-226.
    3. Gabi Hanukov & Uri Yechiali, 2024. "Orbit while in service," Operational Research, Springer, vol. 24(2), pages 1-32, June.
    4. Jalili Marand, Ata & Tang, Ou & Li, Hongyan, 2019. "Quandary of service logistics: Fast or reliable?," European Journal of Operational Research, Elsevier, vol. 275(3), pages 983-996.
    5. Nam H. Do & Tien Do & Agassi Melikov, 2020. "Equilibrium customer behavior in the M/M/1 retrial queue with working vacations and a constant retrial rate," Operational Research, Springer, vol. 20(2), pages 627-646, June.
    6. Gopinath Panda & Veena Goswami & Abhijit Datta Banik, 2016. "Equilibrium and Socially Optimal Balking Strategies in Markovian Queues with Vacations and Sequential Abandonment," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-34, October.
    7. Opher Baron & Antonis Economou & Athanasia Manou, 2022. "Increasing social welfare with delays: Strategic customers in the M/G/1 orbit queue," Production and Operations Management, Production and Operations Management Society, vol. 31(7), pages 2907-2924, July.
    8. Bountali, Olga & Economou, Antonis, 2017. "Equilibrium joining strategies in batch service queueing systems," European Journal of Operational Research, Elsevier, vol. 260(3), pages 1142-1151.
    9. Olga Bountali & Apostolos Burnetas & Lerzan Örmeci, 2022. "Join, balk, or jettison? The effect of flexibility and ranking knowledge in systems with batch arrivals," Production and Operations Management, Production and Operations Management Society, vol. 31(9), pages 3505-3524, September.
    10. Shan Gao & Hua Dong & Xianchao Wang, 2021. "Equilibrium and pricing analysis for an unreliable retrial queue with limited idle period and single vacation," Operational Research, Springer, vol. 21(1), pages 621-643, March.
    11. Zhen Wang & Liwei Liu & Yiqiang Q. Zhao, 2022. "Equilibrium customer and socially optimal balking strategies in a constant retrial queue with multiple vacations and N-policy," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 870-908, May.
    12. Brill, P.H. & Huang, M.L. & Hlynka, M., 2020. "On the service time in a workload-barrier M/G/1 queue with accepted and blocked customers," European Journal of Operational Research, Elsevier, vol. 283(1), pages 235-243.
    13. Xinlei Liu & Xiuli Xu & Mingxin Liu, 2024. "Strategy Analysis of Retrial Queue with Parallel Customer and Standby Server," Methodology and Computing in Applied Probability, Springer, vol. 26(3), pages 1-22, September.
    14. Lian, Zhaotong & Gu, Xinhua & Wu, Jinbiao, 2016. "A re-examination of experience service offering and regular service pricing under profit maximization," European Journal of Operational Research, Elsevier, vol. 254(3), pages 907-915.
    15. Shweta Upadhyaya & Richa Sharma & Divya Agarwal & Geetika Malik, 2023. "Convexity analysis and cost optimization of a retrial queue with Bernoulli vacation and delayed phase mending," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 14(5), pages 1671-1690, October.
    16. Wang, Jinting & Zhang, Xuelu & Huang, Ping, 2017. "Strategic behavior and social optimization in a constant retrial queue with the N-policy," European Journal of Operational Research, Elsevier, vol. 256(3), pages 841-849.
    17. Ahuja, Anjali & Jain, Anamika & Jain, Madhu, 2022. "Transient analysis and ANFIS computing of unreliable single server queueing model with multiple stage service and functioning vacation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 192(C), pages 464-490.
    18. Zhou, Wenhui & Lian, Zhaotong & Wu, Jinbiao, 2014. "When should service firms provide free experience service?," European Journal of Operational Research, Elsevier, vol. 234(3), pages 830-838.

    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:metcap:v:26:y:2024:i:2:d:10.1007_s11009-024-10080-3. 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.