IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v232y2025icp102-122.html
   My bibliography  Save this article

Analysis of repairable discrete-time queueing systems with negative customers, disasters, balking customers and interruptible working vacations under Bernoulli schedule

Author

Listed:
  • Wu, Shipei
  • Lan, Shaojun

Abstract

The study of discrete-time queueing systems is important for modeling and optimizing real-world systems that operate in fixed time intervals, such as telecommunications, computer networks, and manufacturing. This paper contributes to this field by analyzing two unreliable discrete-time Geo/G/1 queueing models that incorporate Bernoulli working vacation interruptions and balking customers under two different killing strategies, allowing for a more realistic representation of disruptions in service operations. After serving all currently present positive customers, the server promptly begins a working vacation. If a service is completed and there are still positive customers awaiting service during this vacation period, the server will either attend to the next customer at the normal speed with a probability of p, or continue to serve the existing customer at a reduced speed with a probability of 1−p. Employing the supplementary variable method and the probability generating function technique, we obtain the steady-state queue length distributions and sojourn time distributions for both models. Besides, some crucial performance characteristics are presented. Finally, Sensitivity analysis is conducted through numerical examples to explore the operational characteristics and patterns of the systems under consideration. The findings of this study can be applied to optimizing operations in digital communication systems, minimizing customer waiting times and reducing the risk of server failures.

Suggested Citation

  • Wu, Shipei & Lan, Shaojun, 2025. "Analysis of repairable discrete-time queueing systems with negative customers, disasters, balking customers and interruptible working vacations under Bernoulli schedule," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 232(C), pages 102-122.
    • Handle: RePEc:eee:matcom:v:232:y:2025:i:c:p:102-122
    DOI: 10.1016/j.matcom.2024.12.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475424004877
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2024.12.018?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. Torben Meisling, 1958. "Discrete-Time Queuing Theory," Operations Research, INFORMS, vol. 6(1), pages 96-105, February.
    2. F. P. Barbhuiya & U. C. Gupta, 2020. "A Discrete-Time GIX/Geo/1 Queue with Multiple Working Vacations Under Late and Early Arrival System," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 599-624, June.
    3. Yonatan Levy & Uri Yechiali, 1975. "Utilization of Idle Time in an M/G/1 Queueing System," Management Science, INFORMS, vol. 22(2), pages 202-211, October.
    4. Doo Ho Lee & Kilhwan Kim, 2014. "Analysis of Repairable Geo/G/1 Queues with Negative Customers," Journal of Applied Mathematics, Hindawi, vol. 2014, pages 1-10, December.
    5. Yoel G. Yera & Carlos A. Fernández & José E. Valdés, 2019. "A variant of the Geo/G/1 queues with disasters and general repair times," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 48(24), pages 6119-6133, December.
    6. Naishuo Tian & Zhe George Zhang, 2006. "Vacation Queueing Models Theory and Applications," International Series in Operations Research and Management Science, Springer, number 978-0-387-33723-4, December.
    7. Shweta Upadhyaya, 2016. "Queueing systems with vacation: an overview," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 9(2), pages 167-213.
    8. A. G. Pakes, 1969. "Some Conditions for Ergodicity and Recurrence of Markov Chains," Operations Research, INFORMS, vol. 17(6), pages 1058-1061, December.
    9. Mustafa Demircioglu & Herwig Bruneel & Sabine Wittevrongel, 2021. "Analysis of a Discrete-Time Queueing Model with Disasters," Mathematics, MDPI, vol. 9(24), pages 1-22, December.
    10. Doo Ho Lee & Kilhwan Kim, 2014. "Analysis of Repairable Geo/G/1 Queues with Negative Customers," Journal of Applied Mathematics, John Wiley & Sons, vol. 2014(1).
    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. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    2. Manickam Vadivukarasi & Kaliappan Kalidass, 2021. "Discussion on the transient behavior of single server Markovian multiple variant vacation queues," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(1), pages 123-146.
    3. Ambika, K. & Vijayashree, K.V. & Janani, B., 2024. "Modelling and analysis of production management system using vacation queueing theoretic approach," Applied Mathematics and Computation, Elsevier, vol. 479(C).
    4. Manickam Vadivukarasi & Kaliappan Kalidass, 2021. "Discussion on the transient behavior of single server Markovian multiple variant vacation queues," Operations Research and Decisions, Wroclaw University of Science Technology, Faculty of Management, vol. 31, pages 123-146.
    5. Shweta Upadhyaya, 2020. "Investigating a general service retrial queue with damaging and licensed units: an application in local area networks," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 716-745, September.
    6. Ramachandran Remya & Amina Angelika Bouchentouf & Kaliappan Kalidass, 2024. "Cost optimization of a M/M/1/WV&MAV queueing system using Newton–Raphson and particle swarm optimization techniques," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(3), pages 205-220.
    7. Janani, B., 2022. "Transient Analysis of Differentiated Breakdown Model," Applied Mathematics and Computation, Elsevier, vol. 417(C).
    8. Nada Riheb Yatim & Amina Angelika Bouchentouf & Pikkala Vijaya Laxmi, 2024. "A queueing model for an automatic manufacturing system with disasters, breakdowns and vacations. Optimal design and analysis," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(4), pages 231-250.
    9. Gabi Hanukov & Uri Yechiali, 2024. "Orbit while in service," Operational Research, Springer, vol. 24(2), pages 1-32, June.
    10. Achyutha Krishnamoorthy & Anu Nuthan Joshua & Dmitry Kozyrev, 2021. "Analysis of a Batch Arrival, Batch Service Queuing-Inventory System with Processing of Inventory While on Vacation," Mathematics, MDPI, vol. 9(4), pages 1-29, February.
    11. Abdoun Sylia & Taleb Samira, 2024. "Strategic Joining in an Unobservable Markovian Queue with Differentiated Vacations," SN Operations Research Forum, Springer, vol. 5(3), pages 1-27, September.
    12. M. I. G. Suranga Sampath & K. Kalidass & Jicheng Liu, 2020. "Transient Analysis of an M/M/1 Queueing System Subjected to Multiple Differentiated Vacations, Impatient Customers and a Waiting Server with Application to IEEE 802.16E Power Saving Mechanism," Indian Journal of Pure and Applied Mathematics, Springer, vol. 51(1), pages 297-320, March.
    13. M. Vadivukarasi & K. Kalidass, 2022. "Discussion on the transient solution of single server Markovian multiple variant vacation queues with disasters," OPSEARCH, Springer;Operational Research Society of India, vol. 59(4), pages 1352-1376, December.
    14. G. K. Tamrakar & A. Banerjee, 2020. "On steady-state joint distribution of an infinite buffer batch service Poisson queue with single and multiple vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1337-1373, December.
    15. Sylia Abdoun & Samira Taleb, 2025. "Efficiency of a markovian queue with non homogeneous vacations and strategic customers under partial vacation interruption," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 88(2), pages 1-18, June.
    16. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    17. Wang, Yong & Wei, Zikai & Luo, Siyu & Zhou, Jingxin & Zhen, Lu, 2024. "Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    18. Yuying Zhang & Dequan Yue & Wuyi Yue, 2022. "A queueing-inventory system with random order size policy and server vacations," Annals of Operations Research, Springer, vol. 310(2), pages 595-620, March.
    19. Jeongsim Kim & Bara Kim, 2016. "A survey of retrial queueing systems," Annals of Operations Research, Springer, vol. 247(1), pages 3-36, December.
    20. Yi Peng & Jinbiao Wu, 2020. "A Lévy-Driven Stochastic Queueing System with Server Breakdowns and Vacations," Mathematics, MDPI, vol. 8(8), pages 1-12, July.

    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:eee:matcom:v:232:y:2025:i:c:p:102-122. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.