The method of calculating queuing system with impatient customers | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2014. № 2(27).

The method of calculating queuing system with impatient customers

The paper deals with queuing systems with impatient customers. The known methods for calculating these systems refers to either the purely Markov model MIMIn-M (in addition to the Kendall notation the hyphen indicates the type of a patience distribution law) or such methods have very restricted conditions, namely, the single-channel service and great loading, the exponential distribution service or patience. We propose a method for calculating the multi-channel QS with the second order hyperexponential distributions both service time and patience M^In-^. The method relies on the method of fictitious phases. The calculation consists of the following stages: • approximation by phase type distributions; • construction of the diagram of transitions; • forming the matrixes of transition intensities in accordance with the diagram; • deriving the balance equations and their solutions and calculating the QS stationary characteristics. The second order hyperexponential distribution (H2) and three initial moments of the origin distribution have been used. Then we have combined the proposed Roubos & Jouini diagram for MIMIn-H queue with the well known diagram of system without impatient customers MIH In. The balance equations were solved by the iterative Takahashi & Takami's method. The probability of impatience queue is defined as Pimp = ^ V V Cm + (k - j)Y2 К, j, k=1 j=0 where X is the intensity of the incoming flow; y! and y are the intensities for the exponential phase of the H -patience; %k j is the probability that the queue length is k, of which j are the first type of patience. It is shown the influence of the variation coefficients of service and patience. Also, the dependence of the probability of removing for impatience queue on the load coefficient is investigated. We concluded using Markov models for the calculation of systems, in which the service and patience distributions are markedly different from the exponential ones, gives incorrect results. The effect of fragmentation performance and its influence on the probability of impatience is made known. The results can be applied in the design of call centers, emergency services, systems of obsolescent information processing, etc.

Download file
Counter downloads: 418

Keywords

системы массового обслуживания, нетерпеливые заявки, ограниченное ожидание, численные методы, гиперэкспоненциальное распределение, queuing systems, impatient customers, restricted waiting time, hyperexponential distribution, numerical methods

Authors

NameOrganizationE-mail
Ryzhikov Yu.I.Mozhaisky Military Space Academy; St. Petersburg Institute of Informatics and Automation of RASryzhbox@yandex.ru
Ulanov A.V.Mozhaisky Military Space Academyulanov246@rambler.ru
Всего: 2

References

Hoshi K., Iijima S., Takahashi Y., Komatsu N. TrafficPerfomance for a Time-Out Scheme Communication System II Proc. of In ternational Conference ICUMT 2009. St. Petersburg, 2009. P. 1-6.
Бочаров П.П., Печинкин А.В. Теория массового обслуживания : учеб. М. : РУДН им. П. Лумумбы, 1995. 529 с.
Roubos A., Jouini O. Call Centers with Hyperexponential Patience Modeling II International Journal of Production Economics. 2013. V. 141. P. 307-315.
Дудин С.А., Дудина О.С. Модель функционирования колл-центра как система MAPIPHINIR-N с нетерпеливыми запросами II Проблемы передачи информации. 2011. № 47. С. 68-83.
Кендалл М. Дж., Стьюарт А. Теория распределений : пер. с англ. М. : Наука, 1966. 587 с.
Рыжиков Ю.И., Уланов А.В. Опыт расчёта сложных систем массового обслуживания II Информационно-управляющие системы. 2009. № 2. С. 56-62.
Takahashi Y., Takami Y.A. Numerical Method for the Steady-State Probabilities of a GIIGIc Queuing System in General Class II Journal of the Operations Research Society of Japan. 1976. V. 19, №э. 2. P. 147-155.
Рыжиков Ю.И., Хомоненко А.Д. Итеративный метод расчета многоканальных систем с произвольным распределением времени обслуживания II Проблемы управления и теории информации. 1980. № 3. С. 203-213.
Рыжиков Ю.И., Уланов А.В. Имитационное моделирование систем с «нетерпеливыми» заявками II Имитационное моде лирование. Теория и практика : тр. VI Всерос. конф. Казань, 2013. С. 339-342.
Башарин Г.П., Бочаров П.П., Коган Я.А. Анализ очередей в вычислительных системах. М. : Наука ; Физматгиз, 1989. 336 с.
 The method of calculating 
                   queuing system with impatient customers | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2014. № 2(27).

The method of calculating queuing system with impatient customers | Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitelnaja tehnika i informatika – Tomsk State University Journal of Control and Computer Science. 2014. № 2(27).

Download full-text version
Counter downloads: 1143