IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i4p594-d345672.html
   My bibliography  Save this article

On Probability Characteristics for a Class of Queueing Models with Impatient Customers

Author

Listed:
  • Yacov Satin

    (Department of Mathematics, Vologda State University, 160000 Vologda, Russia)

  • Alexander Zeifman

    (Department of Applied Mathematics, Vologda State University, 160000 Vologda, Russia
    Institute of Informatics Problems of the Federal Research Center “Computer Science and Control”, Russian Academy of Sciences, 119333 Moscow, Russia
    Vologda Research Center of the Russian Academy of Sciences, 160014 Vologda, Russia)

  • Alexander Sipin

    (Department of Mathematics, Vologda State University, 160000 Vologda, Russia)

  • Sherif I. Ammar

    (Department of Mathematics, Faculty of Science, Menofia University, Shebin El Kom 32511, Egypt
    Department of Mathematics, College of Science, Taibah University, Medinah 414111, Saudi Arabia)

  • Janos Sztrik

    (Department of Information Technology Systems and Networks, University of Debrecen, 4032 Debrecen, Hungary)

Abstract

In this paper, a class of queueing models with impatient customers is considered. It deals with the probability characteristics of an individual customer in a non-stationary Markovian queue with impatient customers, the stationary analogue of which was studied previously as a successful approximation of a more general non-Markov model. A new mathematical model of the process is considered that describes the behavior of an individual requirement in the queue of requirements. This can be applied both in the stationary and non-stationary cases. Based on the proposed model, a methodology has been developed for calculating the system characteristics both in the case of the existence of a stationary solution and in the case of the existence of a periodic solution for the corresponding forward Kolmogorov system. Some numerical examples are provided to illustrate the effect of input parameters on the probability characteristics of the system.

Suggested Citation

  • Yacov Satin & Alexander Zeifman & Alexander Sipin & Sherif I. Ammar & Janos Sztrik, 2020. "On Probability Characteristics for a Class of Queueing Models with Impatient Customers," Mathematics, MDPI, vol. 8(4), pages 1-15, April.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:4:p:594-:d:345672
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/4/594/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/4/594/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Schwarz, Justus Arne & Selinka, Gregor & Stolletz, Raik, 2016. "Performance analysis of time-dependent queueing systems: Survey and classification," Omega, Elsevier, vol. 63(C), pages 170-189.
    2. Zeifman, A. I. & Isaacson, Dean L., 1994. "On strong ergodicity for nonhomogeneous continuous-time Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 50(2), pages 263-273, April.
    3. Ward Whitt, 2005. "Engineering Solution of a Basic Call-Center Model," Management Science, INFORMS, vol. 51(2), pages 221-235, February.
    4. P. R. Parthasarathy & N. Selvaraju, 2001. "Transient analysis of a queue where potential customers are discouraged by queue length," Mathematical Problems in Engineering, Hindawi, vol. 7, pages 1-22, January.
    5. Sunggon Kim, 2018. "Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(3), pages 411-430, June.
    6. Zeifman, A.I., 1995. "Upper and lower bounds on the rate of convergence for nonhomogeneous birth and death processes," Stochastic Processes and their Applications, Elsevier, vol. 59(1), pages 157-173, September.
    7. Zeifman, A.I. & Korolev, V.Yu., 2014. "On perturbation bounds for continuous-time Markov chains," Statistics & Probability Letters, Elsevier, vol. 88(C), pages 66-72.
    8. John F. Reynolds, 1968. "The Stationary Solution of a Multiserver Queuing Model with Discouragement," Operations Research, INFORMS, vol. 16(1), pages 64-71, February.
    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. Zeifman, A. & Satin, Y. & Kiseleva, K. & Korolev, V. & Panfilova, T., 2019. "On limiting characteristics for a non-stationary two-processor heterogeneous system," Applied Mathematics and Computation, Elsevier, vol. 351(C), pages 48-65.
    2. Alexander Zeifman & Victor Korolev & Yacov Satin, 2020. "Two Approaches to the Construction of Perturbation Bounds for Continuous-Time Markov Chains," Mathematics, MDPI, vol. 8(2), pages 1-25, February.
    3. Pei, Zhi & Dai, Xu & Yuan, Yilun & Du, Rui & Liu, Changchun, 2021. "Managing price and fleet size for courier service with shared drones," Omega, Elsevier, vol. 104(C).
    4. Zeifman, A.I. & Korolev, V.Yu., 2014. "On perturbation bounds for continuous-time Markov chains," Statistics & Probability Letters, Elsevier, vol. 88(C), pages 66-72.
    5. Yacov Satin & Rostislav Razumchik & Ivan Kovalev & Alexander Zeifman, 2023. "Ergodicity and Related Bounds for One Particular Class of Markovian Time—Varying Queues with Heterogeneous Servers and Customer’s Impatience," Mathematics, MDPI, vol. 11(9), pages 1-15, April.
    6. Zeifman, A.I. & Korolev, V. Yu., 2015. "Two-sided bounds on the rate of convergence for continuous-time finite inhomogeneous Markov chains," Statistics & Probability Letters, Elsevier, vol. 103(C), pages 30-36.
    7. Yacov Satin & Alexander Zeifman & Anastasia Kryukova, 2019. "On the Rate of Convergence and Limiting Characteristics for a Nonstationary Queueing Model," Mathematics, MDPI, vol. 7(8), pages 1-11, July.
    8. Rouba Ibrahim & Ward Whitt, 2011. "Wait-Time Predictors for Customer Service Systems with Time-Varying Demand and Capacity," Operations Research, INFORMS, vol. 59(5), pages 1106-1118, October.
    9. Bolandifar, Ehsan & DeHoratius, Nicole & Olsen, Tava, 2023. "Modeling abandonment behavior among patients," European Journal of Operational Research, Elsevier, vol. 306(1), pages 243-254.
    10. André de Palma & Claude Lefèvre, 2018. "Bottleneck models and departure time problems," Working Papers hal-01581519, HAL.
    11. Niyirora, Jerome & Zhuang, Jun, 2017. "Fluid approximations and control of queues in emergency departments," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1110-1124.
    12. Xi Chen & Dave Worthington, 2017. "Staffing of time-varying queues using a geometric discrete time modelling approach," Annals of Operations Research, Springer, vol. 252(1), pages 63-84, May.
    13. Tkachenko Andrey, 2013. "Multichannel queuing systems with balking and regenerative input fl ow," HSE Working papers WP BRP 14/STI/2013, National Research University Higher School of Economics.
    14. Odysseas Kanavetas & Barış Balcıog̃lu, 2022. "The “Sensitive” Markovian queueing system and its application for a call center problem," Annals of Operations Research, Springer, vol. 317(2), pages 651-664, October.
    15. Legros, Benjamin & Fransoo, Jan C., 2023. "Admission and pricing optimization of on-street parking with delivery bays," Other publications TiSEM 6d41ee5c-27dc-4d34-aff1-4, Tilburg University, School of Economics and Management.
    16. Yunan Liu & Ward Whitt, 2012. "Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals," Operations Research, INFORMS, vol. 60(6), pages 1551-1564, December.
    17. Francis de Véricourt & Otis B. Jennings, 2008. "Dimensioning Large-Scale Membership Services," Operations Research, INFORMS, vol. 56(1), pages 173-187, February.
    18. Pala, Ali & Zhuang, Jun, 2018. "Security screening queues with impatient applicants: A new model with a case study," European Journal of Operational Research, Elsevier, vol. 265(3), pages 919-930.
    19. Veena Goswami & Gopinath Panda, 2024. "Analysis of Renewal Batch Arrival Queues with Multiple Vacations and Geometric Abandonment," Methodology and Computing in Applied Probability, Springer, vol. 26(2), pages 1-27, June.
    20. Li Xiao & Susan H. Xu & David D. Yao & Hanqin Zhang, 2022. "Optimal staffing for ticket queues," Queueing Systems: Theory and Applications, Springer, vol. 102(1), pages 309-351, October.

    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:gam:jmathe:v:8:y:2020:i:4:p:594-:d:345672. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.