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

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.

[1]  A. Zeifman,et al.  Quasi-ergodicity for non-homogeneous continuous-time Markov chains , 1989, Journal of Applied Probability.

[3]  Ali Movaghar On queueing with customer impatience until the beginning of service , 1996 .

[4]  P. R. Parthasarathy,et al.  Transient analysis of a queue where potential customers are discouraged by queue length. , 2001 .

[5]  Alexander Zeifman,et al.  Limiting characteristics for finite birth-death-catastrophe processes. , 2013, Mathematical biosciences.

[6]  James P. Keener,et al.  Global Asymptotic Stability of Solutions of Nonautonomous Master Equations , 2010, SIAM J. Appl. Dyn. Syst..

[7]  Boris L. Granovsky,et al.  Nonstationary Queues: Estimation of the Rate of Convergence , 2003, Queueing Syst. Theory Appl..

[8]  R. Sudhesh Transient analysis of a queue with system disasters and customer impatience , 2010, Queueing Syst. Theory Appl..

[9]  Ragab Omarah Al-Seedy,et al.  A matrix approach for the transient solution of an M/M/1/N queue with discouraged arrivals and reneging , 2012, Int. J. Comput. Math..

[10]  E. A. Doorn,et al.  The transient state probabilities for a queueing model where potential customers are discouraged by queue length , 1981 .

[11]  A. Yu. Mitrophanov Stability and exponential convergence of continuous-time Markov chains , 2003 .

[12]  Alexander Zeifman,et al.  On strong ergodicity for nonhomogeneous continuous-time Markov chains , 1994 .

[13]  Alexander I. Zeifman Upper and lower bounds on the rate of convergence for nonhomogeneous birth and death processes , 1995 .

[14]  Alexander I. Zeifman,et al.  Perturbation Bounds for M t /M t /N Queue with Catastrophes , 2012 .

[15]  Ward Whitt,et al.  Engineering Solution of a Basic Call-Center Model , 2005, Manag. Sci..

[16]  Alexander I. Zeifman,et al.  On truncations for weakly ergodic inhomogeneous birth and death processes , 2014, Int. J. Appl. Math. Comput. Sci..

[17]  Brey,et al.  Normal solutions for master equations with time-dependent transition rates: Application to heating processes. , 1993, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[18]  Alexander Zeifman,et al.  On perturbation bounds for continuous-time Markov chains , 2014 .

[19]  John F. Reynolds The Stationary Solution of a Multiserver Queuing Model with Discouragement , 1968, Oper. Res..

[20]  Sunggon Kim,et al.  Approximate sojourn time distribution of a discriminatory processor sharing queue with impatient customers , 2018, Math. Methods Oper. Res..